Construction of short-length LDPC codes with low error floor

X. Zheng; Chung Ming Lau; Chi Kong Tse; Y. He

doi:10.1109/APCCAS.2008.4746396

Construction of short-length LDPC codes with low error floor

X. Zheng, Chung Ming Lau, Chi Kong Tse, Y. He

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

2 Citations (Scopus)

Abstract

It has been known that stopping sets and trapping sets are the main contributors to error floors exhibited by short-length low-density parity-check (LDPC) codes. In this work, a new metric called "approximate cycle set extrinsic message degree (ACSE)" is defined to help removing stopping sets with small size and bad trapping sets. Based on the new metric, we propose a code-construction algorithm that produces LDPC codes with very low error floors. Finally, we compare the error rates between codes produced by the proposed algorithm and MacKay code.

Original language	English
Title of host publication	Proceedings of APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems
Pages	1818-1821
Number of pages	4
DOIs	https://doi.org/10.1109/APCCAS.2008.4746396
Publication status	Published - 1 Dec 2008
Event	APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems - Macao, China Duration: 30 Nov 2008 → 3 Dec 2008

Conference

Conference	APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems
Country/Territory	China
City	Macao
Period	30/11/08 → 3/12/08

ASJC Scopus subject areas

Electrical and Electronic Engineering

More information

10.1109/APCCAS.2008.4746396

Cite this

@inproceedings{67d7c04551974abaa853cc268cbd44d6,

title = "Construction of short-length LDPC codes with low error floor",

abstract = "It has been known that stopping sets and trapping sets are the main contributors to error floors exhibited by short-length low-density parity-check (LDPC) codes. In this work, a new metric called {"}approximate cycle set extrinsic message degree (ACSE){"} is defined to help removing stopping sets with small size and bad trapping sets. Based on the new metric, we propose a code-construction algorithm that produces LDPC codes with very low error floors. Finally, we compare the error rates between codes produced by the proposed algorithm and MacKay code.",

author = "X. Zheng and Lau, {Chung Ming} and Tse, {Chi Kong} and Y. He",

year = "2008",

month = dec,

day = "1",

doi = "10.1109/APCCAS.2008.4746396",

language = "English",

isbn = "9781424423422",

pages = "1818--1821",

booktitle = "Proceedings of APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems",

note = "APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems ; Conference date: 30-11-2008 Through 03-12-2008",

}

Construction of short-length LDPC codes with low error floor. / Zheng, X.; Lau, Chung Ming; Tse, Chi Kong et al.
Proceedings of APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems. 2008. p. 1818-1821 4746396.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Construction of short-length LDPC codes with low error floor

AU - Zheng, X.

AU - Lau, Chung Ming

AU - Tse, Chi Kong

AU - He, Y.

PY - 2008/12/1

Y1 - 2008/12/1

N2 - It has been known that stopping sets and trapping sets are the main contributors to error floors exhibited by short-length low-density parity-check (LDPC) codes. In this work, a new metric called "approximate cycle set extrinsic message degree (ACSE)" is defined to help removing stopping sets with small size and bad trapping sets. Based on the new metric, we propose a code-construction algorithm that produces LDPC codes with very low error floors. Finally, we compare the error rates between codes produced by the proposed algorithm and MacKay code.

AB - It has been known that stopping sets and trapping sets are the main contributors to error floors exhibited by short-length low-density parity-check (LDPC) codes. In this work, a new metric called "approximate cycle set extrinsic message degree (ACSE)" is defined to help removing stopping sets with small size and bad trapping sets. Based on the new metric, we propose a code-construction algorithm that produces LDPC codes with very low error floors. Finally, we compare the error rates between codes produced by the proposed algorithm and MacKay code.

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

U2 - 10.1109/APCCAS.2008.4746396

DO - 10.1109/APCCAS.2008.4746396

M3 - Conference article published in proceeding or book

SN - 9781424423422

SP - 1818

EP - 1821

BT - Proceedings of APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems

T2 - APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems

Y2 - 30 November 2008 through 3 December 2008

ER -

Construction of short-length LDPC codes with low error floor

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this