Self-adjustable offset min-sum algorithm for ISDB-S2 LDPC decoder

Wen Ji, Makoto Hamaminato, Hiroshi Nakayama, Satoshi Goto

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, a novel self-adjustable offset min-sum LDPC decoding algorithm is proposed for ISDB-S2 application. We present for the first time a uniform approximation of the check node operation through mathematical induction on Jacobian logarithm and theoretically shows that the offset value is mainly dependent on the difference of the two most unreliable inputs from the bit nodes, which makes the offset value adjustable during the iterative decoding procedure. Simulation results for all 11 code rates of ISDB-S2 demonstrate that the proposed method can achieve an average of 0.15 dB gain compared to the Min-sum based algorithms, and consumes only 1.21% computation complexity compared to BP-based algorithms in the best case.

Original languageEnglish
Pages (from-to)1283-1289
Number of pages7
JournalIEICE Electronics Express
Volume7
Issue number17
DOIs
Publication statusPublished - 2010 Sep 10

Fingerprint

decoders
decoding
Iterative decoding
logarithms
Decoding
induction
approximation
simulation

Keywords

  • ISDB-S2
  • LDPC decoding algorithm

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Electrical and Electronic Engineering

Cite this

Self-adjustable offset min-sum algorithm for ISDB-S2 LDPC decoder. / Ji, Wen; Hamaminato, Makoto; Nakayama, Hiroshi; Goto, Satoshi.

In: IEICE Electronics Express, Vol. 7, No. 17, 10.09.2010, p. 1283-1289.

Research output: Contribution to journalArticle

Ji, W, Hamaminato, M, Nakayama, H & Goto, S 2010, 'Self-adjustable offset min-sum algorithm for ISDB-S2 LDPC decoder', IEICE Electronics Express, vol. 7, no. 17, pp. 1283-1289. https://doi.org/10.1587/elex.7.1283
Ji, Wen ; Hamaminato, Makoto ; Nakayama, Hiroshi ; Goto, Satoshi. / Self-adjustable offset min-sum algorithm for ISDB-S2 LDPC decoder. In: IEICE Electronics Express. 2010 ; Vol. 7, No. 17. pp. 1283-1289.
@article{aafe6e0a2af74ff98648b0d0f7f8ae92,
title = "Self-adjustable offset min-sum algorithm for ISDB-S2 LDPC decoder",
abstract = "In this paper, a novel self-adjustable offset min-sum LDPC decoding algorithm is proposed for ISDB-S2 application. We present for the first time a uniform approximation of the check node operation through mathematical induction on Jacobian logarithm and theoretically shows that the offset value is mainly dependent on the difference of the two most unreliable inputs from the bit nodes, which makes the offset value adjustable during the iterative decoding procedure. Simulation results for all 11 code rates of ISDB-S2 demonstrate that the proposed method can achieve an average of 0.15 dB gain compared to the Min-sum based algorithms, and consumes only 1.21{\%} computation complexity compared to BP-based algorithms in the best case.",
keywords = "ISDB-S2, LDPC decoding algorithm",
author = "Wen Ji and Makoto Hamaminato and Hiroshi Nakayama and Satoshi Goto",
year = "2010",
month = "9",
day = "10",
doi = "10.1587/elex.7.1283",
language = "English",
volume = "7",
pages = "1283--1289",
journal = "IEICE Electronics Express",
issn = "1349-2543",
publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",
number = "17",

}

TY - JOUR

T1 - Self-adjustable offset min-sum algorithm for ISDB-S2 LDPC decoder

AU - Ji, Wen

AU - Hamaminato, Makoto

AU - Nakayama, Hiroshi

AU - Goto, Satoshi

PY - 2010/9/10

Y1 - 2010/9/10

N2 - In this paper, a novel self-adjustable offset min-sum LDPC decoding algorithm is proposed for ISDB-S2 application. We present for the first time a uniform approximation of the check node operation through mathematical induction on Jacobian logarithm and theoretically shows that the offset value is mainly dependent on the difference of the two most unreliable inputs from the bit nodes, which makes the offset value adjustable during the iterative decoding procedure. Simulation results for all 11 code rates of ISDB-S2 demonstrate that the proposed method can achieve an average of 0.15 dB gain compared to the Min-sum based algorithms, and consumes only 1.21% computation complexity compared to BP-based algorithms in the best case.

AB - In this paper, a novel self-adjustable offset min-sum LDPC decoding algorithm is proposed for ISDB-S2 application. We present for the first time a uniform approximation of the check node operation through mathematical induction on Jacobian logarithm and theoretically shows that the offset value is mainly dependent on the difference of the two most unreliable inputs from the bit nodes, which makes the offset value adjustable during the iterative decoding procedure. Simulation results for all 11 code rates of ISDB-S2 demonstrate that the proposed method can achieve an average of 0.15 dB gain compared to the Min-sum based algorithms, and consumes only 1.21% computation complexity compared to BP-based algorithms in the best case.

KW - ISDB-S2

KW - LDPC decoding algorithm

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

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

U2 - 10.1587/elex.7.1283

DO - 10.1587/elex.7.1283

M3 - Article

AN - SCOPUS:77957369674

VL - 7

SP - 1283

EP - 1289

JO - IEICE Electronics Express

JF - IEICE Electronics Express

SN - 1349-2543

IS - 17

ER -