Design of degree distributions for LDPCA codes

Authors:
Feng Cen
Affiliations:
Department of Control Science and Engineering, Tongji University, Shanghai, China
Venue:
IEEE Communications Letters
Year:
2009

Citing 5
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Compression with Side Information Using Turbo Codes

DCC '02 Proceedings of the Data Compression Conference
Rate-adaptive codes for distributed source coding

Signal Processing - Special section: Distributed source coding
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A degree distribution design method of Low-Density Parity-Check Accumulate (LDPCA) codes [6] is proposed for rate-compatible asymmetric Slepian-Wolf coding (SWC) of correlated binary memoryless sources. The degree distribution is designed by seeking the simultaneous optimum at the lowest and the highest compression rates of the specified range with density evolution algorithm. The experimental results show that the coding efficiency of codes constructed with the designed degree distribution is close to the Slepian-Wolf limit over the entire target range and better than all other reported results of the rate-compatible asymmetric SWC.