Regular Quasi-cyclic LDPC Codes with Girth 6 from Prime Fields

The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles...

Full description

Saved in:
Bibliographic Details
Main Authors: Qingji Zheng, Xiangxue Li, Dong Zheng, Baoan Guo
Format: Conference Proceeding
Language:English
Subjects:
AWGN
Bit error rate
Encoding
error floor
Iterative decoding
Matrices
prime field
quasi-cyclic LDPC
Shannon limit
Sparse matrices
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 473
container_issue
container_start_page 470
container_title
container_volume
creator Qingji Zheng
Xiangxue Li
Dong Zheng
Baoan Guo
description The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of 10 -7 .
doi_str_mv 10.1109/IIHMSP.2010.120
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5635634</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5635634</ieee_id><sourcerecordid>5635634</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-884e94fda50a468ac7800cedaa3ef726b2e059c51b2e911d032a648c18c176753</originalsourceid><addsrcrecordid>eNotTs1KAzEYjIig1j178JIX2PrlP7kIstp2YUtX7b3E7Lca2VLZtEjfvhEdhplhDsMQcstgyhi4-7peLN_aKYffgsMZKZyxYLRTknOuzsk1k1xKK4zVl6RI6QsypGLWsSvy8Iofh8GP9OXgUyzDMQwx0OaprWi16zDRn7j_pPM4ZtW0H3db2o5xi3QWcejSDbno_ZCw-PcJWc-e19WibFbzunpsyuhgX1or0cm-8wq81NaHfBACdt4L7A3X7xxBuaBYDo6xDgT3WtrAMo02SkzI3d9sRMTNdz7gx-NGaZEpxQmG3kdK</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Regular Quasi-cyclic LDPC Codes with Girth 6 from Prime Fields</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Qingji Zheng ; Xiangxue Li ; Dong Zheng ; Baoan Guo</creator><creatorcontrib>Qingji Zheng ; Xiangxue Li ; Dong Zheng ; Baoan Guo</creatorcontrib><description>The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of 10 -7 .</description><identifier>ISBN: 1424483786</identifier><identifier>ISBN: 9781424483785</identifier><identifier>EISBN: 9780769542225</identifier><identifier>EISBN: 0769542220</identifier><identifier>DOI: 10.1109/IIHMSP.2010.120</identifier><language>eng</language><publisher>IEEE</publisher><subject>AWGN ; Bit error rate ; Encoding ; error floor ; Iterative decoding ; Matrices ; prime field ; quasi-cyclic LDPC ; Shannon limit ; Sparse matrices</subject><ispartof>2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2010, p.470-473</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5635634$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5635634$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Qingji Zheng</creatorcontrib><creatorcontrib>Xiangxue Li</creatorcontrib><creatorcontrib>Dong Zheng</creatorcontrib><creatorcontrib>Baoan Guo</creatorcontrib><title>Regular Quasi-cyclic LDPC Codes with Girth 6 from Prime Fields</title><title>2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing</title><addtitle>iih-msp</addtitle><description>The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of 10 -7 .</description><subject>AWGN</subject><subject>Bit error rate</subject><subject>Encoding</subject><subject>error floor</subject><subject>Iterative decoding</subject><subject>Matrices</subject><subject>prime field</subject><subject>quasi-cyclic LDPC</subject><subject>Shannon limit</subject><subject>Sparse matrices</subject><isbn>1424483786</isbn><isbn>9781424483785</isbn><isbn>9780769542225</isbn><isbn>0769542220</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotTs1KAzEYjIig1j178JIX2PrlP7kIstp2YUtX7b3E7Lca2VLZtEjfvhEdhplhDsMQcstgyhi4-7peLN_aKYffgsMZKZyxYLRTknOuzsk1k1xKK4zVl6RI6QsypGLWsSvy8Iofh8GP9OXgUyzDMQwx0OaprWi16zDRn7j_pPM4ZtW0H3db2o5xi3QWcejSDbno_ZCw-PcJWc-e19WibFbzunpsyuhgX1or0cm-8wq81NaHfBACdt4L7A3X7xxBuaBYDo6xDgT3WtrAMo02SkzI3d9sRMTNdz7gx-NGaZEpxQmG3kdK</recordid><startdate>201010</startdate><enddate>201010</enddate><creator>Qingji Zheng</creator><creator>Xiangxue Li</creator><creator>Dong Zheng</creator><creator>Baoan Guo</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201010</creationdate><title>Regular Quasi-cyclic LDPC Codes with Girth 6 from Prime Fields</title><author>Qingji Zheng ; Xiangxue Li ; Dong Zheng ; Baoan Guo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-884e94fda50a468ac7800cedaa3ef726b2e059c51b2e911d032a648c18c176753</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>AWGN</topic><topic>Bit error rate</topic><topic>Encoding</topic><topic>error floor</topic><topic>Iterative decoding</topic><topic>Matrices</topic><topic>prime field</topic><topic>quasi-cyclic LDPC</topic><topic>Shannon limit</topic><topic>Sparse matrices</topic><toplevel>online_resources</toplevel><creatorcontrib>Qingji Zheng</creatorcontrib><creatorcontrib>Xiangxue Li</creatorcontrib><creatorcontrib>Dong Zheng</creatorcontrib><creatorcontrib>Baoan Guo</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Qingji Zheng</au><au>Xiangxue Li</au><au>Dong Zheng</au><au>Baoan Guo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Regular Quasi-cyclic LDPC Codes with Girth 6 from Prime Fields</atitle><btitle>2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing</btitle><stitle>iih-msp</stitle><date>2010-10</date><risdate>2010</risdate><spage>470</spage><epage>473</epage><pages>470-473</pages><isbn>1424483786</isbn><isbn>9781424483785</isbn><eisbn>9780769542225</eisbn><eisbn>0769542220</eisbn><abstract>The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of 10 -7 .</abstract><pub>IEEE</pub><doi>10.1109/IIHMSP.2010.120</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 1424483786
ispartof 2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2010, p.470-473
issn
language eng
recordid cdi_ieee_primary_5635634
source IEEE Electronic Library (IEL) Conference Proceedings
subjects AWGN
Bit error rate
Encoding
error floor
Iterative decoding
Matrices
prime field
quasi-cyclic LDPC
Shannon limit
Sparse matrices
title Regular Quasi-cyclic LDPC Codes with Girth 6 from Prime Fields
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T14%3A24%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Regular%20Quasi-cyclic%20LDPC%20Codes%20with%20Girth%206%20from%20Prime%20Fields&rft.btitle=2010%20Sixth%20International%20Conference%20on%20Intelligent%20Information%20Hiding%20and%20Multimedia%20Signal%20Processing&rft.au=Qingji%20Zheng&rft.date=2010-10&rft.spage=470&rft.epage=473&rft.pages=470-473&rft.isbn=1424483786&rft.isbn_list=9781424483785&rft_id=info:doi/10.1109/IIHMSP.2010.120&rft.eisbn=9780769542225&rft.eisbn_list=0769542220&rft_dat=%3Cieee_6IE%3E5635634%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-884e94fda50a468ac7800cedaa3ef726b2e059c51b2e911d032a648c18c176753%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5635634&rfr_iscdi=true