Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/79121
Type: | Journal article |
Title: | A graphical model and search algorithm based Quasi-Cyclic Low-Density Parity-Check codes scheme |
Author: | Lin, J. Shi, P. Yan, G. Wang, J. Huang, Y. |
Citation: | International Journal of Innovative Computing Information and Control, 2013; 9(4):1617-1625 |
Publisher: | ICIC International |
Issue Date: | 2013 |
ISSN: | 1349-4198 1349-418X |
Statement of Responsibility: | Jingli Lin, Peng Shi, Gongjun Yan, Jun Wang and Yong Huang |
Abstract: | A constant challenge in Quasi-Cyclic Low-Density Parity-Check (QC-LDP-C) 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 with 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. © 2013 ICIC International. |
Keywords: | Quasi-cyclic low-density parity-check (QC-LDPC) codes Tanner graph Girth Iterative decoding |
Rights: | © 2013 |
Published version: | http://www.ijicic.org/ijicic-11-12014.pdf |
Appears in Collections: | Aurora harvest 4 Electrical and Electronic Engineering publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.