Iterative Decoding of Redundant Residue Number System Codes

Turbo decoded Redundant Residue Number System (RRNS) codes are proposed and their performance is evaluated. An RRNS $(n,k)$ code is a maximum-minimum distance block code, exhibiting identical distance properties to Reed-Solomon (RS) codes. Hence their error correction capability is given by $t = (n - k)/2$. We adapt the classic Chase algorithm in order to accept soft inputs and to provide soft outputs. Using the proposed soft input soft output (SISO) Chase algorithm, the turbo decoding of RRNS codes is contrived