Systematic Redundant Residue Number System Codes: Analytical Upper Bound and Iterative Decoding Performance Over AWGN and
T.H. Liew, Lie‐Liang Yang, Lajos Hanzo · 2006
The novel family of redundant residue number system (RRNS) codes is studied. RRNS codes constitute max- imum-minimum distance block codes, exhibiting identical distance properties to Reed-Solomon codes. Binary to RRNS symbol-mapping methods are proposed, in order to implement both systematic and nonsystematic RRNS codes. Furthermore, the upper-bound performance of systematic RRNS codes is inves- tigated, when maximum-likelihood (ML) soft decoding is invoked. The classic Chase algorithm achieving near-ML soft decoding is introduced for the first time for RRNS codes, in order to decrease the complexity of the ML soft decoding. Furthermore, the modi- fied Chase algorithm is employed to accept soft inputs, as well as to provide soft outputs, assisting in the turbo decoding of RRNS codes by using the soft-input/soft-output Chase algorithm. Index Terms—Redundant residue number system (RRNS), residue number system (RNS), turbo detection.