Home > Papers

 
 
A method of eliminating short cycles for LDPC convolutional codes
ZHOU HUA,ZHOU YU,WANG LI,WANG YILIN
Department of Electronic and Information Engineering, Nanjing University of Information Science and Technology
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online: 7 December 2015
Accepted by: none
Citation: ZHOU HUA,ZHOU YU,WANG LI.A method of eliminating short cycles for LDPC convolutional codes[OL]. [ 7 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4666951
 
 
Time-invariant low-density parity-check convolutional codes (LDPC-CCs) can be represented by a polynomial-domain parity-check matrix derived from the corresponding quasi-cyclic (QC) LDPC block codes (LDPC-BCs). Based on the analysis of the graphical structure of short cycles in $ extbf{H}^T(D)$, we propose a method to design the polynomial syndrome former matrix $ extbf{H}_{CR}^T(D)$ for LDPC-CCs. It eliminates short cycles and shows better decoding performance on an additive white Gaussian noise (AWGN) channel with lower bit error ratio (BER) curves.
Keywords:Communication and information system; LDPC convolutional codes; girth; eliminating short cycles
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 60
Bookmarked 0
Recommend 0
Comments Array
Submit your papers