Abstract
Turbo codes, low-density parity-check (LDPC) codes and turbo product codes (TPCs) are high performance error-correction codes which employ iterative algorithms for decoding. Under different conditions, the behaviors of the decoders are different. While the nonlinear dynamical behaviors of turbo code decoders and LDPC decoders have been reported in the literature, the dynamical behavior of TPC decoders is relatively unexplored. In this paper, we investigate the behavior of the iterative algorithm of a two-dimensional TPC decoder when the input signal-to-noise ratio (SNR) varies. The quantity to be measured is the mean square value of the posterior probabilities of the information bits. Unlike turbo decoders or LDPC decoders, TPC decoders do not produce a clear "waterfall region". This is mainly because the TPC decoding algorithm does not converge to "indecisive" fixed points even at very low SNR values.
Original language | English |
---|---|
Pages (from-to) | 500-511 |
Number of pages | 12 |
Journal | Chaos, Solitons and Fractals |
Volume | 36 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Apr 2008 |
ASJC Scopus subject areas
- Statistical and Nonlinear Physics