Design methods for irregular repeat-accumulate codes
We optimize the random-like ensemble of irregular repeat-accumulate (IRA) codes for binary-input symmetric channels in the large block-length limit. Our optimization technique is based on approximating the evolution of the densities (DE) of the messages exchanged by the belief-propagation (BP) messa...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2004-08, Vol.50 (8), p.1711-1727 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1727 |
|---|---|
| container_issue | 8 |
| container_start_page | 1711 |
| container_title | IEEE transactions on information theory |
| container_volume | 50 |
| creator | Roumy, A. Guemghar, S. Caire, G. Verdu, S. |
| description | We optimize the random-like ensemble of irregular repeat-accumulate (IRA) codes for binary-input symmetric channels in the large block-length limit. Our optimization technique is based on approximating the evolution of the densities (DE) of the messages exchanged by the belief-propagation (BP) message-passing decoder by a one-dimensional dynamical system. In this way, the code ensemble optimization can be solved by linear programming. We propose four such DE approximation methods, and compare the performance of the obtained code ensembles over the binary-symmetric channel (BSC) and the binary-antipodal input additive white Gaussian noise channel (BIAWGNC). Our results clearly identify the best among the proposed methods and show that the IRA codes obtained by these methods are competitive with respect to the best known irregular low-density parity-check (LDPC) codes. In view of this and the very simple encoding structure of IRA codes, they emerge as attractive design choices. |
| doi_str_mv | 10.1109/TIT.2004.831778 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28253532</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1317116</ieee_id><sourcerecordid>749682881</sourcerecordid><originalsourceid>FETCH-LOGICAL-c376t-b18f5d1f55c645eae292aa78c2d068b977bd46a78a02173b61c8e3ffcdae97bc3</originalsourceid><addsrcrecordid>eNpdkM1LAzEQxYMoWD_OHrwsgt62zeQ7R6mfUPBSzyGbna1btt2a7B78702pUPA0zLzfewyPkBugUwBqZ8v35ZRRKqaGg9bmhExASl1aJcUpmVAKprRCmHNykdI6r0ICmxDxhKldbYsNDl99nYqmj0UbI67Gzsci4g79UPoQxk0-DFiEvsZ0Rc4a3yW8_puX5PPleTl_Kxcfr-_zx0UZuFZDWYFpZA2NlEEJiR6ZZd5rE1hNlams1lUtVD54ykDzSkEwyJsm1B6trgK_JA-H3F3sv0dMg9u0KWDX-S32Y3LMMMklZxm8-weu-zFu828OrDRWKAUZmh2gEPuUIjZuF9uNjz8OqNtX6HKFbl-hO1SYHfd_sT4F3zXRb0ObjjYFGgBs5m4PXIuIR5nvZcV_AfJ3eRE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195894661</pqid></control><display><type>article</type><title>Design methods for irregular repeat-accumulate codes</title><source>IEEE Electronic Library (IEL)</source><creator>Roumy, A. ; Guemghar, S. ; Caire, G. ; Verdu, S.</creator><creatorcontrib>Roumy, A. ; Guemghar, S. ; Caire, G. ; Verdu, S.</creatorcontrib><description>We optimize the random-like ensemble of irregular repeat-accumulate (IRA) codes for binary-input symmetric channels in the large block-length limit. Our optimization technique is based on approximating the evolution of the densities (DE) of the messages exchanged by the belief-propagation (BP) message-passing decoder by a one-dimensional dynamical system. In this way, the code ensemble optimization can be solved by linear programming. We propose four such DE approximation methods, and compare the performance of the obtained code ensembles over the binary-symmetric channel (BSC) and the binary-antipodal input additive white Gaussian noise channel (BIAWGNC). Our results clearly identify the best among the proposed methods and show that the IRA codes obtained by these methods are competitive with respect to the best known irregular low-density parity-check (LDPC) codes. In view of this and the very simple encoding structure of IRA codes, they emerge as attractive design choices.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2004.831778</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Additive white noise ; Applied sciences ; Approximation methods ; Channel capacity ; Codes ; Coding, codes ; Design methodology ; Exact sciences and technology ; Information, signal and communications theory ; Intersymbol interference ; Iterative decoding ; Linear programming ; Optimization techniques ; Parity check codes ; Signal and communications theory ; Stability ; Systems design ; Systems stability ; Telecommunications and information theory ; Turbo codes</subject><ispartof>IEEE transactions on information theory, 2004-08, Vol.50 (8), p.1711-1727</ispartof><rights>2004 INIST-CNRS</rights><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Aug 2004</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c376t-b18f5d1f55c645eae292aa78c2d068b977bd46a78a02173b61c8e3ffcdae97bc3</citedby><cites>FETCH-LOGICAL-c376t-b18f5d1f55c645eae292aa78c2d068b977bd46a78a02173b61c8e3ffcdae97bc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1317116$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1317116$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16171119$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Roumy, A.</creatorcontrib><creatorcontrib>Guemghar, S.</creatorcontrib><creatorcontrib>Caire, G.</creatorcontrib><creatorcontrib>Verdu, S.</creatorcontrib><title>Design methods for irregular repeat-accumulate codes</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We optimize the random-like ensemble of irregular repeat-accumulate (IRA) codes for binary-input symmetric channels in the large block-length limit. Our optimization technique is based on approximating the evolution of the densities (DE) of the messages exchanged by the belief-propagation (BP) message-passing decoder by a one-dimensional dynamical system. In this way, the code ensemble optimization can be solved by linear programming. We propose four such DE approximation methods, and compare the performance of the obtained code ensembles over the binary-symmetric channel (BSC) and the binary-antipodal input additive white Gaussian noise channel (BIAWGNC). Our results clearly identify the best among the proposed methods and show that the IRA codes obtained by these methods are competitive with respect to the best known irregular low-density parity-check (LDPC) codes. In view of this and the very simple encoding structure of IRA codes, they emerge as attractive design choices.</description><subject>Additive white noise</subject><subject>Applied sciences</subject><subject>Approximation methods</subject><subject>Channel capacity</subject><subject>Codes</subject><subject>Coding, codes</subject><subject>Design methodology</subject><subject>Exact sciences and technology</subject><subject>Information, signal and communications theory</subject><subject>Intersymbol interference</subject><subject>Iterative decoding</subject><subject>Linear programming</subject><subject>Optimization techniques</subject><subject>Parity check codes</subject><subject>Signal and communications theory</subject><subject>Stability</subject><subject>Systems design</subject><subject>Systems stability</subject><subject>Telecommunications and information theory</subject><subject>Turbo codes</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkM1LAzEQxYMoWD_OHrwsgt62zeQ7R6mfUPBSzyGbna1btt2a7B78702pUPA0zLzfewyPkBugUwBqZ8v35ZRRKqaGg9bmhExASl1aJcUpmVAKprRCmHNykdI6r0ICmxDxhKldbYsNDl99nYqmj0UbI67Gzsci4g79UPoQxk0-DFiEvsZ0Rc4a3yW8_puX5PPleTl_Kxcfr-_zx0UZuFZDWYFpZA2NlEEJiR6ZZd5rE1hNlams1lUtVD54ykDzSkEwyJsm1B6trgK_JA-H3F3sv0dMg9u0KWDX-S32Y3LMMMklZxm8-weu-zFu828OrDRWKAUZmh2gEPuUIjZuF9uNjz8OqNtX6HKFbl-hO1SYHfd_sT4F3zXRb0ObjjYFGgBs5m4PXIuIR5nvZcV_AfJ3eRE</recordid><startdate>20040801</startdate><enddate>20040801</enddate><creator>Roumy, A.</creator><creator>Guemghar, S.</creator><creator>Caire, G.</creator><creator>Verdu, S.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20040801</creationdate><title>Design methods for irregular repeat-accumulate codes</title><author>Roumy, A. ; Guemghar, S. ; Caire, G. ; Verdu, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c376t-b18f5d1f55c645eae292aa78c2d068b977bd46a78a02173b61c8e3ffcdae97bc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Additive white noise</topic><topic>Applied sciences</topic><topic>Approximation methods</topic><topic>Channel capacity</topic><topic>Codes</topic><topic>Coding, codes</topic><topic>Design methodology</topic><topic>Exact sciences and technology</topic><topic>Information, signal and communications theory</topic><topic>Intersymbol interference</topic><topic>Iterative decoding</topic><topic>Linear programming</topic><topic>Optimization techniques</topic><topic>Parity check codes</topic><topic>Signal and communications theory</topic><topic>Stability</topic><topic>Systems design</topic><topic>Systems stability</topic><topic>Telecommunications and information theory</topic><topic>Turbo codes</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Roumy, A.</creatorcontrib><creatorcontrib>Guemghar, S.</creatorcontrib><creatorcontrib>Caire, G.</creatorcontrib><creatorcontrib>Verdu, S.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Roumy, A.</au><au>Guemghar, S.</au><au>Caire, G.</au><au>Verdu, S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Design methods for irregular repeat-accumulate codes</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2004-08-01</date><risdate>2004</risdate><volume>50</volume><issue>8</issue><spage>1711</spage><epage>1727</epage><pages>1711-1727</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We optimize the random-like ensemble of irregular repeat-accumulate (IRA) codes for binary-input symmetric channels in the large block-length limit. Our optimization technique is based on approximating the evolution of the densities (DE) of the messages exchanged by the belief-propagation (BP) message-passing decoder by a one-dimensional dynamical system. In this way, the code ensemble optimization can be solved by linear programming. We propose four such DE approximation methods, and compare the performance of the obtained code ensembles over the binary-symmetric channel (BSC) and the binary-antipodal input additive white Gaussian noise channel (BIAWGNC). Our results clearly identify the best among the proposed methods and show that the IRA codes obtained by these methods are competitive with respect to the best known irregular low-density parity-check (LDPC) codes. In view of this and the very simple encoding structure of IRA codes, they emerge as attractive design choices.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2004.831778</doi><tpages>17</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2004-08, Vol.50 (8), p.1711-1727 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28253532 |
| source | IEEE Electronic Library (IEL) |
| subjects | Additive white noise Applied sciences Approximation methods Channel capacity Codes Coding, codes Design methodology Exact sciences and technology Information, signal and communications theory Intersymbol interference Iterative decoding Linear programming Optimization techniques Parity check codes Signal and communications theory Stability Systems design Systems stability Telecommunications and information theory Turbo codes |
| title | Design methods for irregular repeat-accumulate codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T23%3A13%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Design%20methods%20for%20irregular%20repeat-accumulate%20codes&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Roumy,%20A.&rft.date=2004-08-01&rft.volume=50&rft.issue=8&rft.spage=1711&rft.epage=1727&rft.pages=1711-1727&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2004.831778&rft_dat=%3Cproquest_RIE%3E749682881%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195894661&rft_id=info:pmid/&rft_ieee_id=1317116&rfr_iscdi=true |