Construction of High-Girth QC-LDPC Codes


We describe a hill-climbing algorithm that constructs high-girth quasi-cyclic low density parity check (QC-LDPC) codes. Given a desired girth, the algorithm can find QC-LDPC codes of shorter block-length in much less time compared with the previously proposed ”guess-and-test” algorithm. An analysis is also provided to explain when guess-and-test would be expected to perform well or badly. 5th International Symposium on Turbo Codes and Related Topics This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Copyright c ©Mitsubishi Electric Research Laboratories, Inc., 2008 201 Broadway, Cambridge, Massachusetts 02139

8 Figures and Tables

Cite this paper

@inproceedings{Wang2008ConstructionOH, title={Construction of High-Girth QC-LDPC Codes}, author={Yige Wang and Jonathan Yedidia and Stark Draper and Jonathan S. Yedidia and Stark C. Draper}, year={2008} }