Title

Several Properties Of Short Ldpc Codes

Keywords

Concatenated systems; Final length analysis; Iterative decoding; Short low-density parity-check (LDPC) codes; Turbo decoding

Abstract

In this paper, we present several properties on minimum distance (dm in) and girth (Gm in) in Tanner graphs for low-density parity-check (LDPC) codes with small left degrees. We show that the distance growth of (2,4) LDPC codes is too slow to achieve the desired performance. We further give a tight upper bound on the maximum possible girth. The numerical results show that codes with large Gm in could outperform the average performance of regular ensembles of the LDPC codes over binary symmetric channels. The same codes perform about 1.5 dB away from the sphere-packing bound on additive white Gaussian noise channels.

Publication Date

5-1-2004

Publication Title

IEEE Transactions on Communications

Volume

52

Issue

5

Number of Pages

721-727

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/TCOMM.2004.826242

Socpus ID

2942519388 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/2942519388

This document is currently not available here.

Share

COinS