Construction of quasi-cyclic LDPC codes from one-coincidence sequences

Chun Ming Huang, Chao Chin Yang, Jen Fa Huang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we proposed a new method for constructing quasi-cyclic low-density parity-check (QC- LDPC) codes based on circulant permutation matrices via the one-coincidence sequences. The main advantage is that QC-LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC-LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths and have almost the same performance as Sridara- Fuja-Tanner codes.

Original languageEnglish
Title of host publication2008 International Conference on Communications, Circuits and Systems Proceedings, ICCCAS 2008
Pages26-30
Number of pages5
DOIs
Publication statusPublished - 2008 Dec 1
Event2008 International Conference on Communications, Circuits and Systems, ICCCAS 2008 - Xiamen, Fujian Province, China
Duration: 2008 May 252008 May 27

Publication series

Name2008 International Conference on Communications, Circuits and Systems Proceedings, ICCCAS 2008

Other

Other2008 International Conference on Communications, Circuits and Systems, ICCCAS 2008
Country/TerritoryChina
CityXiamen, Fujian Province
Period08-05-2508-05-27

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this