Thumbnail
Access Restriction
Open

Author Lin, Jingli ♦ Shi, Peng ♦ Yan, Gongjun ♦ Wang, Jun ♦ Huang, Yong
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Search Algorithm ♦ Graphical Model ♦ Quasi-cyclic Low-density Parity-check Code Scheme ♦ Ldpc Code ♦ Flexible Code Length ♦ Construction Parameter ♦ Quasi-cyclic Low-density Parity-check ♦ Good Error Performance ♦ Constant Challenge ♦ Qc-ldpc Code Construction Approach ♦ Adaptable Qc-ldpc Code ♦ Optimal Construction Method ♦ Qc-ldpc Code ♦ Classic Progressive Edge-growth ♦ Block Rate ♦ Regular Qc-ldpc Code ♦ Column Weight ♦ Block Length ♦ Simulation Result
Abstract ABSTRACT: A constant challenge in Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes lies on flexible code lengths and rates, conditioned by good error performance. This paper presents an optimal construction method of QC-LDPC Codes on the basis of graphical model and search algorithm. Utilizing the proposed scheme, we can construct adaptable QC-LDPC codes whose girths are no less than 12, and column weights are 3. Comparing to any other QC-LDPC code construction approach, this method is much more flexible in block length and block rate. Furthermore, when construction parameters are selected, regular QC-LDPC codes can be constructed easily. Simulation results indicate that LDPC codes proposed in the method perform similarly to the classic Progressive Edge-Growth (PEG) based LDPC codes but outweigh in convenience of implementation and applications.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2011-01-01