Referenced Items are not available for this document.
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
Published in:
Communications, IEEE Transactions on
(Volume:54
,
Issue:
6
)
Date of Publication: June 2006
- Page(s):
- 1006 - 1016
- ISSN :
- 0090-6778
- INSPEC Accession Number:
- 8951980
- Digital Object Identifier :
- 10.1109/TCOMM.2006.876843
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 19 June 2006
- Issue Date :
- June 2006
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
