New Fountain Codes With Improved Intermediate Recovery Based on Batched Zigzag Coding
In this paper, two classes of fountain codes, called batched zigzag fountain codes and two-phase batched zigzag fountain codes, are proposed for the symbol erasure channel. At a cost of slightly lengthened code symbols, the involved message symbols in each batch of the proposed codes can be recovere...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications 2017-01, Vol.65 (1), p.23-36 |
|---|---|
| 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 | 36 |
|---|---|
| container_issue | 1 |
| container_start_page | 23 |
| container_title | IEEE transactions on communications |
| container_volume | 65 |
| creator | Jun, Bohwan Yang, Pilwoong No, Jong-Seon Park, Hosung |
| description | In this paper, two classes of fountain codes, called batched zigzag fountain codes and two-phase batched zigzag fountain codes, are proposed for the symbol erasure channel. At a cost of slightly lengthened code symbols, the involved message symbols in each batch of the proposed codes can be recovered by low complexity zigzag decoding algorithm. Thus, the proposed codes have low buffer occupancy during decoding process. These features are suitable for broadcasting to receivers with limited hardware resources. We also propose a method to obtain degree distributions of code symbols for the proposed codes via ripple size evolution by taking into account the released code symbols from the batches. We also show that the proposed codes outperform Luby transform codes and zigzag decodable fountain codes with respect to intermediate recovery rate and coding overhead when message length is short, symbol erasure rate is low, and available buffer size is limited. |
| doi_str_mv | 10.1109/TCOMM.2016.2622700 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2174420918</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7723915</ieee_id><sourcerecordid>2174420918</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-26dedd9683254694ce96b9bf6d52e779590f85c1eeec6abc50eb19447936fbc33</originalsourceid><addsrcrecordid>eNo9UF1LwzAUDaLgnP4BfSn43HmTNEnzqMXpYHMgG4IvoU1vtw7XzqRT5q83c8One7j3fFwOIdcUBpSCvptl08lkwIDKAZOMKYAT0qNCpDGkQp2SHoCGWCqVnpML71cAkADnPTJ_we9o2G6bLq-bKGtL9NFb3S2j0Xrj2i8so1HToVtjWecdRq9ow9Ltoofch1vbBNDZZYDv9eInX-wd6mZxSc6q_MPj1XH2yXz4OMue4_H0aZTdj2PLtOhiJkssSy1TzkQidWJRy0IXlSwFQ6W00FClwlJEtDIvrAAsqE4SpbmsCst5n9wefMOvn1v0nVm1W9eESMOoShIGmqaBxQ4s61rvHVZm4-p17naGgtnXZ_7qM_v6zLG-ILo5iOqQ_i9QinFNBf8F26Vrbw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174420918</pqid></control><display><type>article</type><title>New Fountain Codes With Improved Intermediate Recovery Based on Batched Zigzag Coding</title><source>IEEE Electronic Library (IEL)</source><creator>Jun, Bohwan ; Yang, Pilwoong ; No, Jong-Seon ; Park, Hosung</creator><creatorcontrib>Jun, Bohwan ; Yang, Pilwoong ; No, Jong-Seon ; Park, Hosung</creatorcontrib><description>In this paper, two classes of fountain codes, called batched zigzag fountain codes and two-phase batched zigzag fountain codes, are proposed for the symbol erasure channel. At a cost of slightly lengthened code symbols, the involved message symbols in each batch of the proposed codes can be recovered by low complexity zigzag decoding algorithm. Thus, the proposed codes have low buffer occupancy during decoding process. These features are suitable for broadcasting to receivers with limited hardware resources. We also propose a method to obtain degree distributions of code symbols for the proposed codes via ripple size evolution by taking into account the released code symbols from the batches. We also show that the proposed codes outperform Luby transform codes and zigzag decodable fountain codes with respect to intermediate recovery rate and coding overhead when message length is short, symbol erasure rate is low, and available buffer size is limited.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2016.2622700</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Broadcasting ; Buffer storage ; Buffers ; Coding ; Complexity theory ; Decoding ; Encoding ; Erasure channel ; fountain codes ; Luby transform (LT) codes ; Occupancy ; Receivers ; Recovery ; ripple size evolution ; Symbols ; Transforms ; zigzag decodable (ZD) codes</subject><ispartof>IEEE transactions on communications, 2017-01, Vol.65 (1), p.23-36</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-26dedd9683254694ce96b9bf6d52e779590f85c1eeec6abc50eb19447936fbc33</citedby><cites>FETCH-LOGICAL-c295t-26dedd9683254694ce96b9bf6d52e779590f85c1eeec6abc50eb19447936fbc33</cites><orcidid>0000-0001-7854-7792 ; 0000-0002-6793-7143</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7723915$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7723915$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jun, Bohwan</creatorcontrib><creatorcontrib>Yang, Pilwoong</creatorcontrib><creatorcontrib>No, Jong-Seon</creatorcontrib><creatorcontrib>Park, Hosung</creatorcontrib><title>New Fountain Codes With Improved Intermediate Recovery Based on Batched Zigzag Coding</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>In this paper, two classes of fountain codes, called batched zigzag fountain codes and two-phase batched zigzag fountain codes, are proposed for the symbol erasure channel. At a cost of slightly lengthened code symbols, the involved message symbols in each batch of the proposed codes can be recovered by low complexity zigzag decoding algorithm. Thus, the proposed codes have low buffer occupancy during decoding process. These features are suitable for broadcasting to receivers with limited hardware resources. We also propose a method to obtain degree distributions of code symbols for the proposed codes via ripple size evolution by taking into account the released code symbols from the batches. We also show that the proposed codes outperform Luby transform codes and zigzag decodable fountain codes with respect to intermediate recovery rate and coding overhead when message length is short, symbol erasure rate is low, and available buffer size is limited.</description><subject>Broadcasting</subject><subject>Buffer storage</subject><subject>Buffers</subject><subject>Coding</subject><subject>Complexity theory</subject><subject>Decoding</subject><subject>Encoding</subject><subject>Erasure channel</subject><subject>fountain codes</subject><subject>Luby transform (LT) codes</subject><subject>Occupancy</subject><subject>Receivers</subject><subject>Recovery</subject><subject>ripple size evolution</subject><subject>Symbols</subject><subject>Transforms</subject><subject>zigzag decodable (ZD) codes</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9UF1LwzAUDaLgnP4BfSn43HmTNEnzqMXpYHMgG4IvoU1vtw7XzqRT5q83c8One7j3fFwOIdcUBpSCvptl08lkwIDKAZOMKYAT0qNCpDGkQp2SHoCGWCqVnpML71cAkADnPTJ_we9o2G6bLq-bKGtL9NFb3S2j0Xrj2i8so1HToVtjWecdRq9ow9Ltoofch1vbBNDZZYDv9eInX-wd6mZxSc6q_MPj1XH2yXz4OMue4_H0aZTdj2PLtOhiJkssSy1TzkQidWJRy0IXlSwFQ6W00FClwlJEtDIvrAAsqE4SpbmsCst5n9wefMOvn1v0nVm1W9eESMOoShIGmqaBxQ4s61rvHVZm4-p17naGgtnXZ_7qM_v6zLG-ILo5iOqQ_i9QinFNBf8F26Vrbw</recordid><startdate>20170101</startdate><enddate>20170101</enddate><creator>Jun, Bohwan</creator><creator>Yang, Pilwoong</creator><creator>No, Jong-Seon</creator><creator>Park, Hosung</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><orcidid>https://orcid.org/0000-0001-7854-7792</orcidid><orcidid>https://orcid.org/0000-0002-6793-7143</orcidid></search><sort><creationdate>20170101</creationdate><title>New Fountain Codes With Improved Intermediate Recovery Based on Batched Zigzag Coding</title><author>Jun, Bohwan ; Yang, Pilwoong ; No, Jong-Seon ; Park, Hosung</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-26dedd9683254694ce96b9bf6d52e779590f85c1eeec6abc50eb19447936fbc33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Broadcasting</topic><topic>Buffer storage</topic><topic>Buffers</topic><topic>Coding</topic><topic>Complexity theory</topic><topic>Decoding</topic><topic>Encoding</topic><topic>Erasure channel</topic><topic>fountain codes</topic><topic>Luby transform (LT) codes</topic><topic>Occupancy</topic><topic>Receivers</topic><topic>Recovery</topic><topic>ripple size evolution</topic><topic>Symbols</topic><topic>Transforms</topic><topic>zigzag decodable (ZD) codes</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jun, Bohwan</creatorcontrib><creatorcontrib>Yang, Pilwoong</creatorcontrib><creatorcontrib>No, Jong-Seon</creatorcontrib><creatorcontrib>Park, Hosung</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_linktorsrc</fulltext></delivery><addata><au>Jun, Bohwan</au><au>Yang, Pilwoong</au><au>No, Jong-Seon</au><au>Park, Hosung</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>New Fountain Codes With Improved Intermediate Recovery Based on Batched Zigzag Coding</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2017-01-01</date><risdate>2017</risdate><volume>65</volume><issue>1</issue><spage>23</spage><epage>36</epage><pages>23-36</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>In this paper, two classes of fountain codes, called batched zigzag fountain codes and two-phase batched zigzag fountain codes, are proposed for the symbol erasure channel. At a cost of slightly lengthened code symbols, the involved message symbols in each batch of the proposed codes can be recovered by low complexity zigzag decoding algorithm. Thus, the proposed codes have low buffer occupancy during decoding process. These features are suitable for broadcasting to receivers with limited hardware resources. We also propose a method to obtain degree distributions of code symbols for the proposed codes via ripple size evolution by taking into account the released code symbols from the batches. We also show that the proposed codes outperform Luby transform codes and zigzag decodable fountain codes with respect to intermediate recovery rate and coding overhead when message length is short, symbol erasure rate is low, and available buffer size is limited.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2016.2622700</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0001-7854-7792</orcidid><orcidid>https://orcid.org/0000-0002-6793-7143</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 2017-01, Vol.65 (1), p.23-36 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_proquest_journals_2174420918 |
| source | IEEE Electronic Library (IEL) |
| subjects | Broadcasting Buffer storage Buffers Coding Complexity theory Decoding Encoding Erasure channel fountain codes Luby transform (LT) codes Occupancy Receivers Recovery ripple size evolution Symbols Transforms zigzag decodable (ZD) codes |
| title | New Fountain Codes With Improved Intermediate Recovery Based on Batched Zigzag Coding |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T20%3A53%3A18IST&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=New%20Fountain%20Codes%20With%20Improved%20Intermediate%20Recovery%20Based%20on%20Batched%20Zigzag%20Coding&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Jun,%20Bohwan&rft.date=2017-01-01&rft.volume=65&rft.issue=1&rft.spage=23&rft.epage=36&rft.pages=23-36&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2016.2622700&rft_dat=%3Cproquest_RIE%3E2174420918%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=2174420918&rft_id=info:pmid/&rft_ieee_id=7723915&rfr_iscdi=true |