Shortening for irregular QC-LDPC codes

Authors:
Xiaojian Liu;Xiaofu Wu;Chunming Zhao
Affiliations:
National Mobile Communications Research Lab., Southeast University, Nanjing, China;Nanjing Institute of Communications Engineering and National Mobile Communications Research Lab., Southeast University, Nanjing, China;National Mobile Communications Research Lab., Southeast University, Nanjing, China
Venue:
IEEE Communications Letters
Year:
2009

Citing 4
Cited 0

Error Control Coding, Second Edition

Error Control Coding, Second Edition
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory
Shortened Array Codes of Large Girth

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Shortening is a technique to obtain codes of shorter length and lower rate from a given LDPC code by putting infinite reliability on some variable nodes, whose positions are assumed to be available to both encoder and decoder. In this paper, we propose a shortening algorithm suitable for irregular QC-LDPC codes. The efficiency of the proposed algorithm is verified by both theoretical analysis and simulation.