Constrained Iterative Decoding on the Serially Concatenated Convolution Code and Low-Density-Parity-Check Code 


Vol. 27,  No. 12, pp. 1288-1295, Dec.  2002


PDF
  Abstract

A modification to the standard iterative decoding (message passing) algorithm that yield improved performance at the cost of higher complexity is introduced. This modification is to run multiple iterative decoders, each with a different constraint on a system variable (e.g., input value, state value, etc.). This Constrained Iterative Decoding (CID) implements optimal MAP decoding for systems represented by single-cycle graphs (e.g., tail-biting convolutional codes). For more complex graphical models, the CID is suboptimal, but outperforms the standard decoding algorithm because it negates the effects of some cycles in the model. In this paper, it is shown that the CID outperforms the standard ID for a Serially Concatenated Convolution Code (SCCC) system and Low-Density-Parity-Check (LDPC) code system, especially when the interleaver size is small. Density evolution analysis is used to show how CID improves the convergence relative to that of standard ID by showing that the threshold of the CID is lower than that of the standard ID.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Heo, "Constrained Iterative Decoding on the Serially Concatenated Convolution Code and Low-Density-Parity-Check Code," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 12, pp. 1288-1295, 2002. DOI: .

[ACM Style]

Jun Heo. 2002. Constrained Iterative Decoding on the Serially Concatenated Convolution Code and Low-Density-Parity-Check Code. The Journal of Korean Institute of Communications and Information Sciences, 27, 12, (2002), 1288-1295. DOI: .

[KICS Style]

Jun Heo, "Constrained Iterative Decoding on the Serially Concatenated Convolution Code and Low-Density-Parity-Check Code," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 12, pp. 1288-1295, 12. 2002.