Random Redundant Soft-In Soft-Out Decoding of Linear Block Codes
Halford, T.R.
Chugg, K.M.
Inst. of Commun. Sci., Southern California Univ., Los Angeles, CA;
This paper appears in: Information Theory, 2006 IEEE International Symposium on
Publication Date: 9-14 July 2006
On page(s): 2230-2234
Location: Seattle, WA,
ISBN: 1-4244-0505-X
INSPEC Accession Number: 9164711
Digital Object Identifier: 10.1109/ISIT.2006.261947
Current Version Published: 2006-12-26
Abstract
A number of authors have recently considered iterative soft-in soft-out (SISO) decoding algorithms for classical linear block codes that utilize redundant Tanner graphs. Jiang and Narayanan presented a practically realizable algorithm that applies only to cyclic codes while Kothiyal et al. presented an algorithm that, while applicable to arbitrary linear block codes, does not imply a low-complexity implementation. This work first presents the aforementioned algorithms in a common framework and then presents a related algorithm - random redundant iterative decoding - that is both practically realizable and applicable to arbitrary linear block codes. Simulation results illustrate the successful application of the random redundant iterative decoding algorithm to the extended binary Golay code. Additionally, the proposed algorithm is shown to outperform Jiang and Narayanan's algorithm for a number of Bose-Chaudhuri-Hocquenghem (BCH) codes
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
