For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Iterative Decoding of Product Codes Based on Syndrome Decoding of Sub-Codes
Zongwang LI Youyun XU Wentao SONG
IEICE TRANSACTIONS on Communications
Publication Date: 2002/10/01
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Fundamental Theories
linear block codes, iterative decoding, product codes, syndrome decoding, list decoding,
Full Text: PDF(285.8KB)>>
This paper presents an iterative algorithm for decoding product codes based on syndrome decoding of component codes. This algorithm is devised to achieve an effective trade-off between error performance and decoding complexity. A simplified list decoding algorithm, which uses a modified syndrome decoding method, for linear block codes is devised to deliver soft outputs for iterative decoding of product codes. By adjusting the size of the list, the decoder can achieve a proper trade-off between decoding complexity and performance. Compared to the other iterative decoding algorithms for product codes, the proposed algorithm has lower complexity while offers at least the same performance, which is demonstrated by analyses and simulations. The proposed algorithm has been simulated for BPSK and 16-QAM modulations over both the additive white Gaussian noise (AWGN) and Raleigh fading channels. This paper also presents an efficient scheme for applying product codes and their punctured versions. This scheme can be implemented with variable packet size and channel data block.