Systematic redundant residue number system codes: analytical upper bound and iterative decoding performance over AWGN and Rayleigh channels
Systematic redundant residue number system codes: analytical upper bound and iterative decoding performance over AWGN and Rayleigh channels
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.
1006-1016
Liew, T.H.
a431a389-23f9-4360-9c85-8f4265770636
Yang, L-L.
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
June 2006
Liew, T.H.
a431a389-23f9-4360-9c85-8f4265770636
Yang, L-L.
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
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), .
Abstract
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.
More information
Published date: June 2006
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 262975
URI: http://eprints.soton.ac.uk/id/eprint/262975
PURE UUID: 9ebd86cb-3429-40e3-bf2a-aeef2e663759
Catalogue record
Date deposited: 18 Sep 2006
Last modified: 18 Mar 2024 02:49
Export record
Contributors
Author:
T.H. Liew
Author:
L-L. Yang
Author:
L. Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics