Home > Papers

 
 
Algebraic Constructions of Quasi-Cyclic LDPC Codes Based on Finite Fields
Rui Zhang * #
Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Teleommunications, Beijing 100876
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:25 November 2014
Accepted by: none
Citation: Rui Zhang.Algebraic Constructions of Quasi-Cyclic LDPC Codes Based on Finite Fields[OL]. [25 November 2014] http://en.paper.edu.cn/en_releasepaper/content/4619205
 
 
This paper introduces two new algebraic constructions of quasi-cyclic LDPC codes based on finite fields. Constructions of regular or near-regular codes based on primitive elements and subgroups of a multiplicative group are introduced. The constructions are achieved by dispersing base matrices into arrays of CPMs. Masking can also be applied to all the two resultant parity check matrices for codes with various rates and degree distributions. The codes constructed based on the new approaches perform well with iterative decoding over AWGN channel.
Keywords:Array dispersion; circulant permutation matrix (CPM); iterative decoding; low-density parity-check (LDPC) codes; location-vector; quasi-cyclic codes
 
 
 

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 119
Bookmarked 0
Recommend 5
Comments Array
Submit your papers