Construction of Irregular Low-Density Parity-Check Codes with Circulant Permutation Matrices

Zixi SONG; Lijun ZHANG; Lee Lung CHENG

Construction of Irregular Low-Density Parity-Check Codes with Circulant Permutation Matrices

Zixi SONG
, Lijun ZHANG
, Lee Lung CHENG

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

A new design approach for constructing irregular low-density parity-check (LDPC) codes is proposed. Their parity-check matrices can be simply constructed based on circulant permutation matrices (CPMs) without cycles of length 4 in their Tanner graphs, and some of them are very sparse. Furthermore, the sizes and column weights of the parity-check matrices can be flexibly chosen and hence the corresponding codes have a wide range of lengths and rates. Simulation results show that these proposed codes decode with sum-product algorithms (SPA) exhibitgood performances over the AWGN channel.

Original language	English
Title of host publication	Proceedings of 2011 International Conference on Computers, Communications, Control and Automation
Pages	64-68
Publication status	Published - 20 Feb 2011
Event	2011 International Conference on Computers, Communications, Control and Automation - , China Duration: 20 Feb 2011 → 21 Feb 2011

Conference

Conference	2011 International Conference on Computers, Communications, Control and Automation
Place	China
Period	20/02/11 → 21/02/11

Research Keywords

circulant permutation matrices (CPMs)
degree distributions
error flopr.

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{ca831200496d4506ba7aa4a699a7bc9a,

title = "Construction of Irregular Low-Density Parity-Check Codes with Circulant Permutation Matrices",

abstract = "A new design approach for constructing irregular low-density parity-check (LDPC) codes is proposed. Their parity-check matrices can be simply constructed based on circulant permutation matrices (CPMs) without cycles of length 4 in their Tanner graphs, and some of them are very sparse. Furthermore, the sizes and column weights of the parity-check matrices can be flexibly chosen and hence the corresponding codes have a wide range of lengths and rates. Simulation results show that these proposed codes decode with sum-product algorithms (SPA) exhibitgood performances over the AWGN channel.",

keywords = "circulant permutation matrices (CPMs), degree distributions, error flopr.",

author = "Zixi SONG and Lijun ZHANG and CHENG, \{Lee Lung\}",

year = "2011",

month = feb,

day = "20",

language = "English",

pages = "64--68",

booktitle = "Proceedings of 2011 International Conference on Computers, Communications, Control and Automation",

note = "2011 International Conference on Computers, Communications, Control and Automation ; Conference date: 20-02-2011 Through 21-02-2011",

}

Construction of Irregular Low-Density Parity-Check Codes with Circulant Permutation Matrices. / SONG, Zixi; ZHANG, Lijun; CHENG, Lee Lung.
Proceedings of 2011 International Conference on Computers, Communications, Control and Automation. 2011. p. 64-68.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Construction of Irregular Low-Density Parity-Check Codes with Circulant Permutation Matrices

AU - SONG, Zixi

AU - ZHANG, Lijun

AU - CHENG, Lee Lung

PY - 2011/2/20

Y1 - 2011/2/20

N2 - A new design approach for constructing irregular low-density parity-check (LDPC) codes is proposed. Their parity-check matrices can be simply constructed based on circulant permutation matrices (CPMs) without cycles of length 4 in their Tanner graphs, and some of them are very sparse. Furthermore, the sizes and column weights of the parity-check matrices can be flexibly chosen and hence the corresponding codes have a wide range of lengths and rates. Simulation results show that these proposed codes decode with sum-product algorithms (SPA) exhibitgood performances over the AWGN channel.

AB - A new design approach for constructing irregular low-density parity-check (LDPC) codes is proposed. Their parity-check matrices can be simply constructed based on circulant permutation matrices (CPMs) without cycles of length 4 in their Tanner graphs, and some of them are very sparse. Furthermore, the sizes and column weights of the parity-check matrices can be flexibly chosen and hence the corresponding codes have a wide range of lengths and rates. Simulation results show that these proposed codes decode with sum-product algorithms (SPA) exhibitgood performances over the AWGN channel.

KW - circulant permutation matrices (CPMs)

KW - degree distributions

KW - error flopr.

M3 - RGC 32 - Refereed conference paper (with host publication)

SP - 64

EP - 68

BT - Proceedings of 2011 International Conference on Computers, Communications, Control and Automation

T2 - 2011 International Conference on Computers, Communications, Control and Automation

Y2 - 20 February 2011 through 21 February 2011

ER -

Construction of Irregular Low-Density Parity-Check Codes with Circulant Permutation Matrices

Abstract

Conference

Research Keywords

Other Access Options

Permanent Link

Fingerprint

Cite this