Constrained iterative decoding: Performance and convergence analysis

Jun Heo, Keith M. Chugg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We introduce a modification to the standard iterative decoding (message passing) algorithm that yields improved performance at the cost of higher complexity. 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, we show 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.

Original languageEnglish
Title of host publicationConference Record of the Asilomar Conference on Signals, Systems and Computers
EditorsM.B. Matthews
Pages275-279
Number of pages5
Volume1
Publication statusPublished - 2001
Externally publishedYes
Event35th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: 2001 Nov 42001 Nov 7

Other

Other35th Asilomar Conference on Signals, Systems and Computers
CountryUnited States
CityPacific Grove, CA
Period01/11/401/11/7

Fingerprint

Iterative decoding
Decoding
Convolutional codes
Message passing
Convolution

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Heo, J., & Chugg, K. M. (2001). Constrained iterative decoding: Performance and convergence analysis. In M. B. Matthews (Ed.), Conference Record of the Asilomar Conference on Signals, Systems and Computers (Vol. 1, pp. 275-279)

Constrained iterative decoding : Performance and convergence analysis. / Heo, Jun; Chugg, Keith M.

Conference Record of the Asilomar Conference on Signals, Systems and Computers. ed. / M.B. Matthews. Vol. 1 2001. p. 275-279.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Heo, J & Chugg, KM 2001, Constrained iterative decoding: Performance and convergence analysis. in MB Matthews (ed.), Conference Record of the Asilomar Conference on Signals, Systems and Computers. vol. 1, pp. 275-279, 35th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, United States, 01/11/4.
Heo J, Chugg KM. Constrained iterative decoding: Performance and convergence analysis. In Matthews MB, editor, Conference Record of the Asilomar Conference on Signals, Systems and Computers. Vol. 1. 2001. p. 275-279
Heo, Jun ; Chugg, Keith M. / Constrained iterative decoding : Performance and convergence analysis. Conference Record of the Asilomar Conference on Signals, Systems and Computers. editor / M.B. Matthews. Vol. 1 2001. pp. 275-279
@inproceedings{52a18e4240e74b50ba99f53b7409cffe,
title = "Constrained iterative decoding: Performance and convergence analysis",
abstract = "We introduce a modification to the standard iterative decoding (message passing) algorithm that yields improved performance at the cost of higher complexity. 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, we show 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.",
author = "Jun Heo and Chugg, {Keith M.}",
year = "2001",
language = "English",
volume = "1",
pages = "275--279",
editor = "M.B. Matthews",
booktitle = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",

}

TY - GEN

T1 - Constrained iterative decoding

T2 - Performance and convergence analysis

AU - Heo, Jun

AU - Chugg, Keith M.

PY - 2001

Y1 - 2001

N2 - We introduce a modification to the standard iterative decoding (message passing) algorithm that yields improved performance at the cost of higher complexity. 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, we show 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.

AB - We introduce a modification to the standard iterative decoding (message passing) algorithm that yields improved performance at the cost of higher complexity. 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, we show 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.

UR - http://www.scopus.com/inward/record.url?scp=0035573773&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035573773&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0035573773

VL - 1

SP - 275

EP - 279

BT - Conference Record of the Asilomar Conference on Signals, Systems and Computers

A2 - Matthews, M.B.

ER -