GAU Algorithm for Construction of Variably Long LDPC Codes
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A girth ACE union (GAU) construction algorithm is proposed for variably long LDPC codes considering the degree distribution, girth and approximate cycle extrinsic (ACE) message degree in a unified architecture. Therefore the short cycle number is reduced and the extrinsic message degree is increased. Large range of variable code length is accommodated through parity check matrix constructed by GAU algorithm. For short length codes, the performance of GAU algorithm is similar with that of LDPC codes in IEEE 802.16e. For middle length and long codes, GAU algorithm performs a little better. Variably long LDPC codes are designed using a common parity check matrix. The design of encoder and decoder with the same architecture for variable lengths is facilitated, which reduce the realizing complexity of encoder and decoder. Results show that the algorithm is useful in designing LDPC codes, which support variably long data communication, and the research is meaningful both in theory and practice.

    Reference
    Related
    Cited by
Get Citation

Zhu Hongpeng, Cheng Lei, Zhang Jian. GAU Algorithm for Construction of Variably Long LDPC Codes[J].,2015,30(6):1240-1245.

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: December 24,2015
  • Published:
Article QR Code