Loading…
On the design of LDPC code ensembles for BIAWGN channels
Existing design methods for irregular Low-Density Parity-Check (LDPC) codes over the additive white Gaussian noise channel are based on using asymptotic analysis tools such as density evolution in an optimization process. Such a process is computationally expensive particularly when a large number o...
Saved in:
Published in: | IEEE transactions on communications 2010-05, Vol.58 (5), p.1376-1382 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c280t-ef86a2556515709b382e7ba333ed90a4940f450b1c453ddb97463d558c938e1b3 |
---|---|
cites | cdi_FETCH-LOGICAL-c280t-ef86a2556515709b382e7ba333ed90a4940f450b1c453ddb97463d558c938e1b3 |
container_end_page | 1382 |
container_issue | 5 |
container_start_page | 1376 |
container_title | IEEE transactions on communications |
container_volume | 58 |
creator | Saeedi, Hamid Banihashemi, Amir H |
description | Existing design methods for irregular Low-Density Parity-Check (LDPC) codes over the additive white Gaussian noise channel are based on using asymptotic analysis tools such as density evolution in an optimization process. Such a process is computationally expensive particularly when a large number of constituent variable node degrees are involved in the design. In this paper, we propose a systematic approach for the design of irregular LDPC codes. The proposed method, which is based on a pre-computed upper bound on the fraction of edges connected to variable nodes of degree 3, is considerably less complex than the conventional optimization approach. Through a number of examples, we demonstrate that using our method, ensembles with performance very close to those devised based on optimization, can be designed. In addition to having very good performance, the number of constituent variable node degrees in the designed ensembles is only three or four. This, in some cases, is much smaller than the corresponding number for optimization-based designs with similar performance. |
doi_str_mv | 10.1109/TCOMM.2010.05.080299 |
format | article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_5464237</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5464237</ieee_id><sourcerecordid>2716823241</sourcerecordid><originalsourceid>FETCH-LOGICAL-c280t-ef86a2556515709b382e7ba333ed90a4940f450b1c453ddb97463d558c938e1b3</originalsourceid><addsrcrecordid>eNo9kMtOwzAQRS0EEuXxBbCwxDpl_JjYXpYApVJLWRSxtPKY0FZtUux2wd-TEsRqNNI9d0aHsVsBQyHA3S-y-Ww2lNDtgEOwIJ07YQOBaBOwaE7ZAMBBkhpjz9lFjGsA0KDUgNl5w_dL4hXF1WfD25pPH98yXrYVcWoibYsNRV63gT9MRh_jV14u86ahTbxiZ3W-iXT9Ny_Z-_PTIntJpvPxJBtNk1Ja2CdU2zSXiCkKNOAKZSWZIldKUeUg105DrREKUWpUVVU4o1NVdY-XTlkShbpkd33vLrRfB4p7v24PoelOegHSCKtS1F1K96kytDEGqv0urLZ5-O5C_ujI_zryR0ce0PeOOuymx1ZE9I-gTrVURv0Aj3FffQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1027183654</pqid></control><display><type>article</type><title>On the design of LDPC code ensembles for BIAWGN channels</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Saeedi, Hamid ; Banihashemi, Amir H</creator><creatorcontrib>Saeedi, Hamid ; Banihashemi, Amir H</creatorcontrib><description>Existing design methods for irregular Low-Density Parity-Check (LDPC) codes over the additive white Gaussian noise channel are based on using asymptotic analysis tools such as density evolution in an optimization process. Such a process is computationally expensive particularly when a large number of constituent variable node degrees are involved in the design. In this paper, we propose a systematic approach for the design of irregular LDPC codes. The proposed method, which is based on a pre-computed upper bound on the fraction of edges connected to variable nodes of degree 3, is considerably less complex than the conventional optimization approach. Through a number of examples, we demonstrate that using our method, ensembles with performance very close to those devised based on optimization, can be designed. In addition to having very good performance, the number of constituent variable node degrees in the designed ensembles is only three or four. This, in some cases, is much smaller than the corresponding number for optimization-based designs with similar performance.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2010.05.080299</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Additive white noise ; Algorithms ; AWGN channel ; AWGN channels ; code design ; Codes ; Design ; Design methodology ; Design optimization ; irregular LDPC codes ; Iterative algorithms ; Iterative decoding ; LDPC codes ; Low-density parity-check codes ; Optimization methods ; Parity check codes ; Stability ; stability condition ; Studies ; systematic design ; Upper bound</subject><ispartof>IEEE transactions on communications, 2010-05, Vol.58 (5), p.1376-1382</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c280t-ef86a2556515709b382e7ba333ed90a4940f450b1c453ddb97463d558c938e1b3</citedby><cites>FETCH-LOGICAL-c280t-ef86a2556515709b382e7ba333ed90a4940f450b1c453ddb97463d558c938e1b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5464237$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,54771</link.rule.ids></links><search><creatorcontrib>Saeedi, Hamid</creatorcontrib><creatorcontrib>Banihashemi, Amir H</creatorcontrib><title>On the design of LDPC code ensembles for BIAWGN channels</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>Existing design methods for irregular Low-Density Parity-Check (LDPC) codes over the additive white Gaussian noise channel are based on using asymptotic analysis tools such as density evolution in an optimization process. Such a process is computationally expensive particularly when a large number of constituent variable node degrees are involved in the design. In this paper, we propose a systematic approach for the design of irregular LDPC codes. The proposed method, which is based on a pre-computed upper bound on the fraction of edges connected to variable nodes of degree 3, is considerably less complex than the conventional optimization approach. Through a number of examples, we demonstrate that using our method, ensembles with performance very close to those devised based on optimization, can be designed. In addition to having very good performance, the number of constituent variable node degrees in the designed ensembles is only three or four. This, in some cases, is much smaller than the corresponding number for optimization-based designs with similar performance.</description><subject>Additive white noise</subject><subject>Algorithms</subject><subject>AWGN channel</subject><subject>AWGN channels</subject><subject>code design</subject><subject>Codes</subject><subject>Design</subject><subject>Design methodology</subject><subject>Design optimization</subject><subject>irregular LDPC codes</subject><subject>Iterative algorithms</subject><subject>Iterative decoding</subject><subject>LDPC codes</subject><subject>Low-density parity-check codes</subject><subject>Optimization methods</subject><subject>Parity check codes</subject><subject>Stability</subject><subject>stability condition</subject><subject>Studies</subject><subject>systematic design</subject><subject>Upper bound</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNo9kMtOwzAQRS0EEuXxBbCwxDpl_JjYXpYApVJLWRSxtPKY0FZtUux2wd-TEsRqNNI9d0aHsVsBQyHA3S-y-Ww2lNDtgEOwIJ07YQOBaBOwaE7ZAMBBkhpjz9lFjGsA0KDUgNl5w_dL4hXF1WfD25pPH98yXrYVcWoibYsNRV63gT9MRh_jV14u86ahTbxiZ3W-iXT9Ny_Z-_PTIntJpvPxJBtNk1Ja2CdU2zSXiCkKNOAKZSWZIldKUeUg105DrREKUWpUVVU4o1NVdY-XTlkShbpkd33vLrRfB4p7v24PoelOegHSCKtS1F1K96kytDEGqv0urLZ5-O5C_ujI_zryR0ce0PeOOuymx1ZE9I-gTrVURv0Aj3FffQ</recordid><startdate>201005</startdate><enddate>201005</enddate><creator>Saeedi, Hamid</creator><creator>Banihashemi, Amir H</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>201005</creationdate><title>On the design of LDPC code ensembles for BIAWGN channels</title><author>Saeedi, Hamid ; Banihashemi, Amir H</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c280t-ef86a2556515709b382e7ba333ed90a4940f450b1c453ddb97463d558c938e1b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Additive white noise</topic><topic>Algorithms</topic><topic>AWGN channel</topic><topic>AWGN channels</topic><topic>code design</topic><topic>Codes</topic><topic>Design</topic><topic>Design methodology</topic><topic>Design optimization</topic><topic>irregular LDPC codes</topic><topic>Iterative algorithms</topic><topic>Iterative decoding</topic><topic>LDPC codes</topic><topic>Low-density parity-check codes</topic><topic>Optimization methods</topic><topic>Parity check codes</topic><topic>Stability</topic><topic>stability condition</topic><topic>Studies</topic><topic>systematic design</topic><topic>Upper bound</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Saeedi, Hamid</creatorcontrib><creatorcontrib>Banihashemi, Amir H</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Saeedi, Hamid</au><au>Banihashemi, Amir H</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the design of LDPC code ensembles for BIAWGN channels</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2010-05</date><risdate>2010</risdate><volume>58</volume><issue>5</issue><spage>1376</spage><epage>1382</epage><pages>1376-1382</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>Existing design methods for irregular Low-Density Parity-Check (LDPC) codes over the additive white Gaussian noise channel are based on using asymptotic analysis tools such as density evolution in an optimization process. Such a process is computationally expensive particularly when a large number of constituent variable node degrees are involved in the design. In this paper, we propose a systematic approach for the design of irregular LDPC codes. The proposed method, which is based on a pre-computed upper bound on the fraction of edges connected to variable nodes of degree 3, is considerably less complex than the conventional optimization approach. Through a number of examples, we demonstrate that using our method, ensembles with performance very close to those devised based on optimization, can be designed. In addition to having very good performance, the number of constituent variable node degrees in the designed ensembles is only three or four. This, in some cases, is much smaller than the corresponding number for optimization-based designs with similar performance.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2010.05.080299</doi><tpages>7</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0090-6778 |
ispartof | IEEE transactions on communications, 2010-05, Vol.58 (5), p.1376-1382 |
issn | 0090-6778 1558-0857 |
language | eng |
recordid | cdi_ieee_primary_5464237 |
source | IEEE Electronic Library (IEL) Journals |
subjects | Additive white noise Algorithms AWGN channel AWGN channels code design Codes Design Design methodology Design optimization irregular LDPC codes Iterative algorithms Iterative decoding LDPC codes Low-density parity-check codes Optimization methods Parity check codes Stability stability condition Studies systematic design Upper bound |
title | On the design of LDPC code ensembles for BIAWGN channels |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T03%3A14%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20design%20of%20LDPC%20code%20ensembles%20for%20BIAWGN%20channels&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Saeedi,%20Hamid&rft.date=2010-05&rft.volume=58&rft.issue=5&rft.spage=1376&rft.epage=1382&rft.pages=1376-1382&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2010.05.080299&rft_dat=%3Cproquest_ieee_%3E2716823241%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c280t-ef86a2556515709b382e7ba333ed90a4940f450b1c453ddb97463d558c938e1b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1027183654&rft_id=info:pmid/&rft_ieee_id=5464237&rfr_iscdi=true |