Belief propagation decoding assisted on-the-fly Gaussian elimination for short LT codes
Belief propagation (BP) decoding has been widely used for decoding Luby transform (LT) codes which perform very well for a large number of input symbols. However, in reality, small numbers of input symbols are often encountered. In this paper, an efficient BP decoding assisted on-the-fly Gaussian el...
Gespeichert in:
| Veröffentlicht in: | Cluster computing 2016-03, Vol.19 (1), p.309-314 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 314 |
|---|---|
| container_issue | 1 |
| container_start_page | 309 |
| container_title | Cluster computing |
| container_volume | 19 |
| creator | Cheong, Hoyoung Eun, Jonwon Kim, Hyuncheol Kim, Kuinam J. |
| description | Belief propagation (BP) decoding has been widely used for decoding Luby transform (LT) codes which perform very well for a large number of input symbols. However, in reality, small numbers of input symbols are often encountered. In this paper, an efficient BP decoding assisted on-the-fly Gaussian elimination (OFG) decoding process is proposed. Our algorithm exploits XOR operations to get a packet of degree one when the ripple is empty, which gives a small value of overhead. Simulation results show that the proposed algorithm gives a largely improved overhead, about a 0.25 or more, with respect to that of the conventional BP algorithm. The complexity of the proposed algorithm is notably reduced with respect to that of OFG, especially in case of
k
=
150
–500, while guaranteeing the overhead nearly same as that of OFG. |
| doi_str_mv | 10.1007/s10586-015-0522-0 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918271337</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918271337</sourcerecordid><originalsourceid>FETCH-LOGICAL-c386t-f3d9be97fd610c6d2f809b4f71067908427b01c4c888723ccc845022ac980cf63</originalsourceid><addsrcrecordid>eNp1kE1PAyEQhonRxFr9Ad5IPKMDLAsctdFq0sRLjUdCWWi3aaHC9uC_l2ZNPHmaycz7zMeL0C2FewogHwoFoVoCVBAQjBE4QxMqJCdSNPy85rx2pRLyEl2VsgUALZmeoM8nv-t9wIecDnZthz5F3HmXuj6usS2lL4PvcIpk2HgSdt94bo-1aiOu3L6PIxFSxmWT8oAXS1xhX67RRbC74m9-4xR9vDwvZ69k8T5_mz0uiKsHDSTwTq-8lqFrKbi2Y0GBXjVBUmilBtUwuQLqGqeUkow751QjgDHrtAIXWj5Fd-Pc-sDX0ZfBbNMxx7rSME0Vk5RzWVV0VLmcSsk-mEPu9zZ_Gwrm5J8Z_TPVP3Pyz0Bl2MiUqo1rn_8m_w_9AGRscmg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918271337</pqid></control><display><type>article</type><title>Belief propagation decoding assisted on-the-fly Gaussian elimination for short LT codes</title><source>ProQuest Central UK/Ireland</source><source>SpringerLink Journals - AutoHoldings</source><source>ProQuest Central</source><creator>Cheong, Hoyoung ; Eun, Jonwon ; Kim, Hyuncheol ; Kim, Kuinam J.</creator><creatorcontrib>Cheong, Hoyoung ; Eun, Jonwon ; Kim, Hyuncheol ; Kim, Kuinam J.</creatorcontrib><description>Belief propagation (BP) decoding has been widely used for decoding Luby transform (LT) codes which perform very well for a large number of input symbols. However, in reality, small numbers of input symbols are often encountered. In this paper, an efficient BP decoding assisted on-the-fly Gaussian elimination (OFG) decoding process is proposed. Our algorithm exploits XOR operations to get a packet of degree one when the ripple is empty, which gives a small value of overhead. Simulation results show that the proposed algorithm gives a largely improved overhead, about a 0.25 or more, with respect to that of the conventional BP algorithm. The complexity of the proposed algorithm is notably reduced with respect to that of OFG, especially in case of
k
=
150
–500, while guaranteeing the overhead nearly same as that of OFG.</description><identifier>ISSN: 1386-7857</identifier><identifier>EISSN: 1573-7543</identifier><identifier>DOI: 10.1007/s10586-015-0522-0</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Codes ; Computer Communication Networks ; Computer Science ; Decoding ; Gaussian elimination ; Operating Systems ; Processor Architectures ; Propagation ; Symbols</subject><ispartof>Cluster computing, 2016-03, Vol.19 (1), p.309-314</ispartof><rights>Springer Science+Business Media New York 2016</rights><rights>Springer Science+Business Media New York 2016.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c386t-f3d9be97fd610c6d2f809b4f71067908427b01c4c888723ccc845022ac980cf63</citedby><cites>FETCH-LOGICAL-c386t-f3d9be97fd610c6d2f809b4f71067908427b01c4c888723ccc845022ac980cf63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10586-015-0522-0$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918271337?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,21386,27922,27923,33742,41486,42555,43803,51317,64383,64387,72239</link.rule.ids></links><search><creatorcontrib>Cheong, Hoyoung</creatorcontrib><creatorcontrib>Eun, Jonwon</creatorcontrib><creatorcontrib>Kim, Hyuncheol</creatorcontrib><creatorcontrib>Kim, Kuinam J.</creatorcontrib><title>Belief propagation decoding assisted on-the-fly Gaussian elimination for short LT codes</title><title>Cluster computing</title><addtitle>Cluster Comput</addtitle><description>Belief propagation (BP) decoding has been widely used for decoding Luby transform (LT) codes which perform very well for a large number of input symbols. However, in reality, small numbers of input symbols are often encountered. In this paper, an efficient BP decoding assisted on-the-fly Gaussian elimination (OFG) decoding process is proposed. Our algorithm exploits XOR operations to get a packet of degree one when the ripple is empty, which gives a small value of overhead. Simulation results show that the proposed algorithm gives a largely improved overhead, about a 0.25 or more, with respect to that of the conventional BP algorithm. The complexity of the proposed algorithm is notably reduced with respect to that of OFG, especially in case of
k
=
150
–500, while guaranteeing the overhead nearly same as that of OFG.</description><subject>Algorithms</subject><subject>Codes</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Decoding</subject><subject>Gaussian elimination</subject><subject>Operating Systems</subject><subject>Processor Architectures</subject><subject>Propagation</subject><subject>Symbols</subject><issn>1386-7857</issn><issn>1573-7543</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kE1PAyEQhonRxFr9Ad5IPKMDLAsctdFq0sRLjUdCWWi3aaHC9uC_l2ZNPHmaycz7zMeL0C2FewogHwoFoVoCVBAQjBE4QxMqJCdSNPy85rx2pRLyEl2VsgUALZmeoM8nv-t9wIecDnZthz5F3HmXuj6usS2lL4PvcIpk2HgSdt94bo-1aiOu3L6PIxFSxmWT8oAXS1xhX67RRbC74m9-4xR9vDwvZ69k8T5_mz0uiKsHDSTwTq-8lqFrKbi2Y0GBXjVBUmilBtUwuQLqGqeUkow751QjgDHrtAIXWj5Fd-Pc-sDX0ZfBbNMxx7rSME0Vk5RzWVV0VLmcSsk-mEPu9zZ_Gwrm5J8Z_TPVP3Pyz0Bl2MiUqo1rn_8m_w_9AGRscmg</recordid><startdate>20160301</startdate><enddate>20160301</enddate><creator>Cheong, Hoyoung</creator><creator>Eun, Jonwon</creator><creator>Kim, Hyuncheol</creator><creator>Kim, Kuinam J.</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope></search><sort><creationdate>20160301</creationdate><title>Belief propagation decoding assisted on-the-fly Gaussian elimination for short LT codes</title><author>Cheong, Hoyoung ; Eun, Jonwon ; Kim, Hyuncheol ; Kim, Kuinam J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c386t-f3d9be97fd610c6d2f809b4f71067908427b01c4c888723ccc845022ac980cf63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Codes</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Decoding</topic><topic>Gaussian elimination</topic><topic>Operating Systems</topic><topic>Processor Architectures</topic><topic>Propagation</topic><topic>Symbols</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cheong, Hoyoung</creatorcontrib><creatorcontrib>Eun, Jonwon</creatorcontrib><creatorcontrib>Kim, Hyuncheol</creatorcontrib><creatorcontrib>Kim, Kuinam J.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection (ProQuest)</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Cluster computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cheong, Hoyoung</au><au>Eun, Jonwon</au><au>Kim, Hyuncheol</au><au>Kim, Kuinam J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Belief propagation decoding assisted on-the-fly Gaussian elimination for short LT codes</atitle><jtitle>Cluster computing</jtitle><stitle>Cluster Comput</stitle><date>2016-03-01</date><risdate>2016</risdate><volume>19</volume><issue>1</issue><spage>309</spage><epage>314</epage><pages>309-314</pages><issn>1386-7857</issn><eissn>1573-7543</eissn><abstract>Belief propagation (BP) decoding has been widely used for decoding Luby transform (LT) codes which perform very well for a large number of input symbols. However, in reality, small numbers of input symbols are often encountered. In this paper, an efficient BP decoding assisted on-the-fly Gaussian elimination (OFG) decoding process is proposed. Our algorithm exploits XOR operations to get a packet of degree one when the ripple is empty, which gives a small value of overhead. Simulation results show that the proposed algorithm gives a largely improved overhead, about a 0.25 or more, with respect to that of the conventional BP algorithm. The complexity of the proposed algorithm is notably reduced with respect to that of OFG, especially in case of
k
=
150
–500, while guaranteeing the overhead nearly same as that of OFG.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10586-015-0522-0</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1386-7857 |
| ispartof | Cluster computing, 2016-03, Vol.19 (1), p.309-314 |
| issn | 1386-7857 1573-7543 |
| language | eng |
| recordid | cdi_proquest_journals_2918271337 |
| source | ProQuest Central UK/Ireland; SpringerLink Journals - AutoHoldings; ProQuest Central |
| subjects | Algorithms Codes Computer Communication Networks Computer Science Decoding Gaussian elimination Operating Systems Processor Architectures Propagation Symbols |
| title | Belief propagation decoding assisted on-the-fly Gaussian elimination for short LT codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T14%3A25%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Belief%20propagation%20decoding%20assisted%20on-the-fly%20Gaussian%20elimination%20for%20short%20LT%20codes&rft.jtitle=Cluster%20computing&rft.au=Cheong,%20Hoyoung&rft.date=2016-03-01&rft.volume=19&rft.issue=1&rft.spage=309&rft.epage=314&rft.pages=309-314&rft.issn=1386-7857&rft.eissn=1573-7543&rft_id=info:doi/10.1007/s10586-015-0522-0&rft_dat=%3Cproquest_cross%3E2918271337%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918271337&rft_id=info:pmid/&rfr_iscdi=true |