Optimization of scaling soft information in iterative decoding via density evolution methods

Jun Heo, Keith M. Chugg

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

Density evolution has recently been used to analyze iterative decoding and explain many characteristics of iterative decoding including convergence of performance and preferred structures for the constituent codes. The scaling of extrinsic information (messages) has been heuristically used to enhance the performance in the iterative decoding literature, particularly based on the min-sum message passing algorithm. In this paper, it is demonstrated that density evolution can be used to obtain the optimal scaling factor and also estimate the maximum achievable scaling gain. For low density parity check (LDPC) codes and serially concatenated convolutional codes (SCCC) with two-state constituent codes, the analytic density evolution technique is used, while the signal-to-noise ratio (SNR) evolution technique and the EXIT chart technique is used for SCCC with more than 2 state constituent codes. Simulation results show that the scaling gain predicted by density evolution or SNR evolution matches well with the scaling gain observed by simulation.

Original languageEnglish
Pages (from-to)957-961
Number of pages5
JournalIEEE Transactions on Communications
Volume53
Issue number6
DOIs
Publication statusPublished - 2005 Jun 1
Externally publishedYes

Fingerprint

Iterative decoding
Convolutional codes
Signal to noise ratio
Message passing

Keywords

  • Density evolution
  • Iterative decoding
  • Low-density parity-check (LDPC) codes
  • Serially concatenated convolutional codes (SCCC)

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Optimization of scaling soft information in iterative decoding via density evolution methods. / Heo, Jun; Chugg, Keith M.

In: IEEE Transactions on Communications, Vol. 53, No. 6, 01.06.2005, p. 957-961.

Research output: Contribution to journalArticle

@article{16a39ba393464077ad240db3a99479ce,
title = "Optimization of scaling soft information in iterative decoding via density evolution methods",
abstract = "Density evolution has recently been used to analyze iterative decoding and explain many characteristics of iterative decoding including convergence of performance and preferred structures for the constituent codes. The scaling of extrinsic information (messages) has been heuristically used to enhance the performance in the iterative decoding literature, particularly based on the min-sum message passing algorithm. In this paper, it is demonstrated that density evolution can be used to obtain the optimal scaling factor and also estimate the maximum achievable scaling gain. For low density parity check (LDPC) codes and serially concatenated convolutional codes (SCCC) with two-state constituent codes, the analytic density evolution technique is used, while the signal-to-noise ratio (SNR) evolution technique and the EXIT chart technique is used for SCCC with more than 2 state constituent codes. Simulation results show that the scaling gain predicted by density evolution or SNR evolution matches well with the scaling gain observed by simulation.",
keywords = "Density evolution, Iterative decoding, Low-density parity-check (LDPC) codes, Serially concatenated convolutional codes (SCCC)",
author = "Jun Heo and Chugg, {Keith M.}",
year = "2005",
month = "6",
day = "1",
doi = "10.1109/TCOMM.2005.849782",
language = "English",
volume = "53",
pages = "957--961",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Optimization of scaling soft information in iterative decoding via density evolution methods

AU - Heo, Jun

AU - Chugg, Keith M.

PY - 2005/6/1

Y1 - 2005/6/1

N2 - Density evolution has recently been used to analyze iterative decoding and explain many characteristics of iterative decoding including convergence of performance and preferred structures for the constituent codes. The scaling of extrinsic information (messages) has been heuristically used to enhance the performance in the iterative decoding literature, particularly based on the min-sum message passing algorithm. In this paper, it is demonstrated that density evolution can be used to obtain the optimal scaling factor and also estimate the maximum achievable scaling gain. For low density parity check (LDPC) codes and serially concatenated convolutional codes (SCCC) with two-state constituent codes, the analytic density evolution technique is used, while the signal-to-noise ratio (SNR) evolution technique and the EXIT chart technique is used for SCCC with more than 2 state constituent codes. Simulation results show that the scaling gain predicted by density evolution or SNR evolution matches well with the scaling gain observed by simulation.

AB - Density evolution has recently been used to analyze iterative decoding and explain many characteristics of iterative decoding including convergence of performance and preferred structures for the constituent codes. The scaling of extrinsic information (messages) has been heuristically used to enhance the performance in the iterative decoding literature, particularly based on the min-sum message passing algorithm. In this paper, it is demonstrated that density evolution can be used to obtain the optimal scaling factor and also estimate the maximum achievable scaling gain. For low density parity check (LDPC) codes and serially concatenated convolutional codes (SCCC) with two-state constituent codes, the analytic density evolution technique is used, while the signal-to-noise ratio (SNR) evolution technique and the EXIT chart technique is used for SCCC with more than 2 state constituent codes. Simulation results show that the scaling gain predicted by density evolution or SNR evolution matches well with the scaling gain observed by simulation.

KW - Density evolution

KW - Iterative decoding

KW - Low-density parity-check (LDPC) codes

KW - Serially concatenated convolutional codes (SCCC)

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

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

U2 - 10.1109/TCOMM.2005.849782

DO - 10.1109/TCOMM.2005.849782

M3 - Article

AN - SCOPUS:22144481369

VL - 53

SP - 957

EP - 961

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 6

ER -