Finite Length Analysis of Generalized Expanding Window Fountain Codes

Fountain codes are suitable for data transmission over binary erasure channels. When such codes are applied in live broadcast applications, due to the limited bandwidth and delay constraints, it is often convenient to treat the input media stream as a concatenation of short data blocks and to encode...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chia-Jung Chang, Lung-Sheng Tsai, Da-shan Shiu
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 5
container_issue
container_start_page 1
container_title
container_volume
creator Chia-Jung Chang
Lung-Sheng Tsai
Da-shan Shiu
description Fountain codes are suitable for data transmission over binary erasure channels. When such codes are applied in live broadcast applications, due to the limited bandwidth and delay constraints, it is often convenient to treat the input media stream as a concatenation of short data blocks and to encode each block individually. However, the use of a small block size may result in poor coding efficiency. In this paper, we introduce an approach to enhance the coding efficiency by encoding over progressively more source bits. Our approach can be considered as a generalization of the expanding window fountain code concept. In addition, we provide an error analysis based on state generating functions. The state generating function is useful both as a performance evaluation tool and as a design criterion for the generalized expanding window codes.
doi_str_mv 10.1109/VETECF.2009.5378691
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5378691</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5378691</ieee_id><sourcerecordid>5378691</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-621ade60d63f71ea5a7cdaa219a30f311dbfc9d8d0fe229dcc9cb9fee2036b6c3</originalsourceid><addsrcrecordid>eNo1kEtOwzAUAM1PIi09QTe-QMp7duLEyypKClIkNhWwq9z4uRgVp4qDoJy-SJTVLEaaxTA2R1gggr5_rtd11SwEgF7ksiiVxgs200WJmcgykWMOlywReVGkIlP5FZv8i-z1miW_CUglyPKWTWJ8BwBEJRJWNz74kXhLYTe-8WUw-2P0kfeOryjQYPb-hyyvvw8mWB92_MUH23_xpv8Mo_GBV72leMdunNlHmp05ZeumXlcPafu0eqyWbeo1jKkSaCwpsEq6AsnkpuisMQK1keAkot26TtvSgiMhtO063W21IxIg1VZ1csrmf1lPRJvD4D_McNycb8gTp2JQ2A</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Finite Length Analysis of Generalized Expanding Window Fountain Codes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Chia-Jung Chang ; Lung-Sheng Tsai ; Da-shan Shiu</creator><creatorcontrib>Chia-Jung Chang ; Lung-Sheng Tsai ; Da-shan Shiu</creatorcontrib><description>Fountain codes are suitable for data transmission over binary erasure channels. When such codes are applied in live broadcast applications, due to the limited bandwidth and delay constraints, it is often convenient to treat the input media stream as a concatenation of short data blocks and to encode each block individually. However, the use of a small block size may result in poor coding efficiency. In this paper, we introduce an approach to enhance the coding efficiency by encoding over progressively more source bits. Our approach can be considered as a generalization of the expanding window fountain code concept. In addition, we provide an error analysis based on state generating functions. The state generating function is useful both as a performance evaluation tool and as a design criterion for the generalized expanding window codes.</description><identifier>ISSN: 1090-3038</identifier><identifier>ISBN: 142442514X</identifier><identifier>ISBN: 9781424425143</identifier><identifier>EISSN: 2577-2465</identifier><identifier>EISBN: 9781424425150</identifier><identifier>EISBN: 1424425158</identifier><identifier>DOI: 10.1109/VETECF.2009.5378691</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Broadcasting ; Data communication ; Data engineering ; Decision support systems ; Decoding ; Delay ; Error correction codes ; Streaming media ; Transmitters</subject><ispartof>2009 IEEE 70th Vehicular Technology Conference Fall, 2009, p.1-5</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5378691$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5378691$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chia-Jung Chang</creatorcontrib><creatorcontrib>Lung-Sheng Tsai</creatorcontrib><creatorcontrib>Da-shan Shiu</creatorcontrib><title>Finite Length Analysis of Generalized Expanding Window Fountain Codes</title><title>2009 IEEE 70th Vehicular Technology Conference Fall</title><addtitle>VETECF</addtitle><description>Fountain codes are suitable for data transmission over binary erasure channels. When such codes are applied in live broadcast applications, due to the limited bandwidth and delay constraints, it is often convenient to treat the input media stream as a concatenation of short data blocks and to encode each block individually. However, the use of a small block size may result in poor coding efficiency. In this paper, we introduce an approach to enhance the coding efficiency by encoding over progressively more source bits. Our approach can be considered as a generalization of the expanding window fountain code concept. In addition, we provide an error analysis based on state generating functions. The state generating function is useful both as a performance evaluation tool and as a design criterion for the generalized expanding window codes.</description><subject>Bandwidth</subject><subject>Broadcasting</subject><subject>Data communication</subject><subject>Data engineering</subject><subject>Decision support systems</subject><subject>Decoding</subject><subject>Delay</subject><subject>Error correction codes</subject><subject>Streaming media</subject><subject>Transmitters</subject><issn>1090-3038</issn><issn>2577-2465</issn><isbn>142442514X</isbn><isbn>9781424425143</isbn><isbn>9781424425150</isbn><isbn>1424425158</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1kEtOwzAUAM1PIi09QTe-QMp7duLEyypKClIkNhWwq9z4uRgVp4qDoJy-SJTVLEaaxTA2R1gggr5_rtd11SwEgF7ksiiVxgs200WJmcgykWMOlywReVGkIlP5FZv8i-z1miW_CUglyPKWTWJ8BwBEJRJWNz74kXhLYTe-8WUw-2P0kfeOryjQYPb-hyyvvw8mWB92_MUH23_xpv8Mo_GBV72leMdunNlHmp05ZeumXlcPafu0eqyWbeo1jKkSaCwpsEq6AsnkpuisMQK1keAkot26TtvSgiMhtO063W21IxIg1VZ1csrmf1lPRJvD4D_McNycb8gTp2JQ2A</recordid><startdate>200909</startdate><enddate>200909</enddate><creator>Chia-Jung Chang</creator><creator>Lung-Sheng Tsai</creator><creator>Da-shan Shiu</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200909</creationdate><title>Finite Length Analysis of Generalized Expanding Window Fountain Codes</title><author>Chia-Jung Chang ; Lung-Sheng Tsai ; Da-shan Shiu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-621ade60d63f71ea5a7cdaa219a30f311dbfc9d8d0fe229dcc9cb9fee2036b6c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Bandwidth</topic><topic>Broadcasting</topic><topic>Data communication</topic><topic>Data engineering</topic><topic>Decision support systems</topic><topic>Decoding</topic><topic>Delay</topic><topic>Error correction codes</topic><topic>Streaming media</topic><topic>Transmitters</topic><toplevel>online_resources</toplevel><creatorcontrib>Chia-Jung Chang</creatorcontrib><creatorcontrib>Lung-Sheng Tsai</creatorcontrib><creatorcontrib>Da-shan Shiu</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chia-Jung Chang</au><au>Lung-Sheng Tsai</au><au>Da-shan Shiu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Finite Length Analysis of Generalized Expanding Window Fountain Codes</atitle><btitle>2009 IEEE 70th Vehicular Technology Conference Fall</btitle><stitle>VETECF</stitle><date>2009-09</date><risdate>2009</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><issn>1090-3038</issn><eissn>2577-2465</eissn><isbn>142442514X</isbn><isbn>9781424425143</isbn><eisbn>9781424425150</eisbn><eisbn>1424425158</eisbn><abstract>Fountain codes are suitable for data transmission over binary erasure channels. When such codes are applied in live broadcast applications, due to the limited bandwidth and delay constraints, it is often convenient to treat the input media stream as a concatenation of short data blocks and to encode each block individually. However, the use of a small block size may result in poor coding efficiency. In this paper, we introduce an approach to enhance the coding efficiency by encoding over progressively more source bits. Our approach can be considered as a generalization of the expanding window fountain code concept. In addition, we provide an error analysis based on state generating functions. The state generating function is useful both as a performance evaluation tool and as a design criterion for the generalized expanding window codes.</abstract><pub>IEEE</pub><doi>10.1109/VETECF.2009.5378691</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1090-3038
ispartof 2009 IEEE 70th Vehicular Technology Conference Fall, 2009, p.1-5
issn 1090-3038
2577-2465
language eng
recordid cdi_ieee_primary_5378691
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Bandwidth
Broadcasting
Data communication
Data engineering
Decision support systems
Decoding
Delay
Error correction codes
Streaming media
Transmitters
title Finite Length Analysis of Generalized Expanding Window Fountain Codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T01%3A44%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Finite%20Length%20Analysis%20of%20Generalized%20Expanding%20Window%20Fountain%20Codes&rft.btitle=2009%20IEEE%2070th%20Vehicular%20Technology%20Conference%20Fall&rft.au=Chia-Jung%20Chang&rft.date=2009-09&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.issn=1090-3038&rft.eissn=2577-2465&rft.isbn=142442514X&rft.isbn_list=9781424425143&rft_id=info:doi/10.1109/VETECF.2009.5378691&rft_dat=%3Cieee_6IE%3E5378691%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424425150&rft.eisbn_list=1424425158&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5378691&rfr_iscdi=true