Systematic redundant residue number system codes: analytical upper bound and iterative decoding performance over AWGN and Rayleigh channels
Liew, T.H., Yang, L-L. and Hanzo, L. (2006) Systematic redundant residue number system codes: analytical upper bound and iterative decoding performance over AWGN and Rayleigh channels. IEEE Transactions on Communications, 54, (6), 1006-1016.
The novel family of redundant residue number system (RRNS) codes is studied. RRNS codes constitute maximum–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 investigated, 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 modified 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.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control
|Date Deposited:||18 Sep 2006|
|Last Modified:||20 Aug 2012 04:09|
|Contributors:||Liew, T.H. (Author)
Yang, L-L. (Author)
Hanzo, L. (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||3|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)