Loading…

Optimal Design of a Gallager B Noisy Decoder for Irregular LDPC Codes

In this letter, we study the performance of a noisy Gallager B decoder used to decode irregular low-density parity-check (LDPC) codes. We derive the final bit error rate (BER) as a function of both the transmission noise and processing errors. We allow different components of the decoder associated...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2012-12, Vol.16 (12), p.2052-2055
Main Authors: Yazdi, S. M. S. T., Chu-Hsiang Huang, Dolecek, L.
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-c309t-232eadcb52b506a93c02006c95b66e37d88143caacaab1f768c9953134b07d9f3
cites cdi_FETCH-LOGICAL-c309t-232eadcb52b506a93c02006c95b66e37d88143caacaab1f768c9953134b07d9f3
container_end_page 2055
container_issue 12
container_start_page 2052
container_title IEEE communications letters
container_volume 16
creator Yazdi, S. M. S. T.
Chu-Hsiang Huang
Dolecek, L.
description In this letter, we study the performance of a noisy Gallager B decoder used to decode irregular low-density parity-check (LDPC) codes. We derive the final bit error rate (BER) as a function of both the transmission noise and processing errors. We allow different components of the decoder associated with certain computational units (i.e., bit and check nodes of varying degrees) to have different processing errors. We formulate an optimization problem to distribute available processing resources across different components of a noisy decoder to achieve minimal BER. Simulations demonstrate that the optimal resource allocation derived from our analysis outperforms uninformed (random) resource assignment.
doi_str_mv 10.1109/LCOMM.2012.101712.121953
format article
fullrecord <record><control><sourceid>pascalfrancis_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LCOMM_2012_101712_121953</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6336856</ieee_id><sourcerecordid>27211273</sourcerecordid><originalsourceid>FETCH-LOGICAL-c309t-232eadcb52b506a93c02006c95b66e37d88143caacaab1f768c9953134b07d9f3</originalsourceid><addsrcrecordid>eNo9kM1OwzAQhC0EEqXwBFx84Ziya9d_R0hLqZRSDnCOHMepgkJT2eXQt8chqJLlXWtmVuuPEIowQwTzWOTbzWbGANkMAdVQGBrBL8gEhdAZS9dl6kGbTCmjr8lNjF8AoJnACVluD8f223Z04WO729O-oZaubNfZnQ_0mb71bTwl0fV1ejd9oOsQ_O6ns4EWi_ec5kmIt-SqsV30d_91Sj5flh_5a1ZsV-v8qcgcB3PMGGfe1q4SrBIgreEOGIB0RlRSeq5qrXHOnbXpVNgoqZ1JX0E-r0DVpuFTose5LvQxBt-Uh5C2D6cSoRxwlH84ygFHOeIoRxwp-jBGDzY62zXB7l0bz3mmGCJTg-9-9LXe-7MsOZdaSP4LeeNniQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Optimal Design of a Gallager B Noisy Decoder for Irregular LDPC Codes</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Yazdi, S. M. S. T. ; Chu-Hsiang Huang ; Dolecek, L.</creator><creatorcontrib>Yazdi, S. M. S. T. ; Chu-Hsiang Huang ; Dolecek, L.</creatorcontrib><description>In this letter, we study the performance of a noisy Gallager B decoder used to decode irregular low-density parity-check (LDPC) codes. We derive the final bit error rate (BER) as a function of both the transmission noise and processing errors. We allow different components of the decoder associated with certain computational units (i.e., bit and check nodes of varying degrees) to have different processing errors. We formulate an optimization problem to distribute available processing resources across different components of a noisy decoder to achieve minimal BER. Simulations demonstrate that the optimal resource allocation derived from our analysis outperforms uninformed (random) resource assignment.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2012.101712.121953</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Bit error rate ; Coding, codes ; Decoding ; density evolution ; Exact sciences and technology ; Gallager B algorithm ; Hardware ; Information, signal and communications theory ; irregular codes ; LDPC decoder ; Noise measurement ; noisy hardware ; Parity check codes ; Program processors ; Signal and communications theory ; Telecommunications and information theory</subject><ispartof>IEEE communications letters, 2012-12, Vol.16 (12), p.2052-2055</ispartof><rights>2014 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c309t-232eadcb52b506a93c02006c95b66e37d88143caacaab1f768c9953134b07d9f3</citedby><cites>FETCH-LOGICAL-c309t-232eadcb52b506a93c02006c95b66e37d88143caacaab1f768c9953134b07d9f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6336856$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27923,27924,54795</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=27211273$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Yazdi, S. M. S. T.</creatorcontrib><creatorcontrib>Chu-Hsiang Huang</creatorcontrib><creatorcontrib>Dolecek, L.</creatorcontrib><title>Optimal Design of a Gallager B Noisy Decoder for Irregular LDPC Codes</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>In this letter, we study the performance of a noisy Gallager B decoder used to decode irregular low-density parity-check (LDPC) codes. We derive the final bit error rate (BER) as a function of both the transmission noise and processing errors. We allow different components of the decoder associated with certain computational units (i.e., bit and check nodes of varying degrees) to have different processing errors. We formulate an optimization problem to distribute available processing resources across different components of a noisy decoder to achieve minimal BER. Simulations demonstrate that the optimal resource allocation derived from our analysis outperforms uninformed (random) resource assignment.</description><subject>Applied sciences</subject><subject>Bit error rate</subject><subject>Coding, codes</subject><subject>Decoding</subject><subject>density evolution</subject><subject>Exact sciences and technology</subject><subject>Gallager B algorithm</subject><subject>Hardware</subject><subject>Information, signal and communications theory</subject><subject>irregular codes</subject><subject>LDPC decoder</subject><subject>Noise measurement</subject><subject>noisy hardware</subject><subject>Parity check codes</subject><subject>Program processors</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNo9kM1OwzAQhC0EEqXwBFx84Ziya9d_R0hLqZRSDnCOHMepgkJT2eXQt8chqJLlXWtmVuuPEIowQwTzWOTbzWbGANkMAdVQGBrBL8gEhdAZS9dl6kGbTCmjr8lNjF8AoJnACVluD8f223Z04WO729O-oZaubNfZnQ_0mb71bTwl0fV1ejd9oOsQ_O6ns4EWi_ec5kmIt-SqsV30d_91Sj5flh_5a1ZsV-v8qcgcB3PMGGfe1q4SrBIgreEOGIB0RlRSeq5qrXHOnbXpVNgoqZ1JX0E-r0DVpuFTose5LvQxBt-Uh5C2D6cSoRxwlH84ygFHOeIoRxwp-jBGDzY62zXB7l0bz3mmGCJTg-9-9LXe-7MsOZdaSP4LeeNniQ</recordid><startdate>20121201</startdate><enddate>20121201</enddate><creator>Yazdi, S. M. S. T.</creator><creator>Chu-Hsiang Huang</creator><creator>Dolecek, L.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20121201</creationdate><title>Optimal Design of a Gallager B Noisy Decoder for Irregular LDPC Codes</title><author>Yazdi, S. M. S. T. ; Chu-Hsiang Huang ; Dolecek, L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c309t-232eadcb52b506a93c02006c95b66e37d88143caacaab1f768c9953134b07d9f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Applied sciences</topic><topic>Bit error rate</topic><topic>Coding, codes</topic><topic>Decoding</topic><topic>density evolution</topic><topic>Exact sciences and technology</topic><topic>Gallager B algorithm</topic><topic>Hardware</topic><topic>Information, signal and communications theory</topic><topic>irregular codes</topic><topic>LDPC decoder</topic><topic>Noise measurement</topic><topic>noisy hardware</topic><topic>Parity check codes</topic><topic>Program processors</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yazdi, S. M. S. T.</creatorcontrib><creatorcontrib>Chu-Hsiang Huang</creatorcontrib><creatorcontrib>Dolecek, L.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yazdi, S. M. S. T.</au><au>Chu-Hsiang Huang</au><au>Dolecek, L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal Design of a Gallager B Noisy Decoder for Irregular LDPC Codes</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2012-12-01</date><risdate>2012</risdate><volume>16</volume><issue>12</issue><spage>2052</spage><epage>2055</epage><pages>2052-2055</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>In this letter, we study the performance of a noisy Gallager B decoder used to decode irregular low-density parity-check (LDPC) codes. We derive the final bit error rate (BER) as a function of both the transmission noise and processing errors. We allow different components of the decoder associated with certain computational units (i.e., bit and check nodes of varying degrees) to have different processing errors. We formulate an optimization problem to distribute available processing resources across different components of a noisy decoder to achieve minimal BER. Simulations demonstrate that the optimal resource allocation derived from our analysis outperforms uninformed (random) resource assignment.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2012.101712.121953</doi><tpages>4</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1089-7798
ispartof IEEE communications letters, 2012-12, Vol.16 (12), p.2052-2055
issn 1089-7798
1558-2558
language eng
recordid cdi_crossref_primary_10_1109_LCOMM_2012_101712_121953
source IEEE Electronic Library (IEL) Journals
subjects Applied sciences
Bit error rate
Coding, codes
Decoding
density evolution
Exact sciences and technology
Gallager B algorithm
Hardware
Information, signal and communications theory
irregular codes
LDPC decoder
Noise measurement
noisy hardware
Parity check codes
Program processors
Signal and communications theory
Telecommunications and information theory
title Optimal Design of a Gallager B Noisy Decoder for Irregular LDPC Codes
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T08%3A06%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20Design%20of%20a%20Gallager%20B%20Noisy%20Decoder%20for%20Irregular%20LDPC%20Codes&rft.jtitle=IEEE%20communications%20letters&rft.au=Yazdi,%20S.%20M.%20S.%20T.&rft.date=2012-12-01&rft.volume=16&rft.issue=12&rft.spage=2052&rft.epage=2055&rft.pages=2052-2055&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2012.101712.121953&rft_dat=%3Cpascalfrancis_cross%3E27211273%3C/pascalfrancis_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c309t-232eadcb52b506a93c02006c95b66e37d88143caacaab1f768c9953134b07d9f3%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=6336856&rfr_iscdi=true