kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Weighted Online Fountain Codes With Limited Buffer Size and Feedback Transmissions
Beijing Inst Technol, Sch Informat & Elect, Beijing 100081, Peoples R China..
Beijing Inst Technol, Sch Informat & Elect, Beijing 100081, Peoples R China..
Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 1H9, Canada.;Huawei Technol Canada Co Ltd, Heterogeneous Compiler Lab, Markham, ON L3R 5A4, Canada..ORCID iD: 0000-0003-4546-3255
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-5407-0835
Show others and affiliations
2021 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 69, no 12, p. 7960-7973Article in journal (Refereed) Published
Abstract [en]

Online fountain codes (OFC) have attracted much attention for their good intermediate performance, which is important for receivers with low-complexity requirement. However, low-complexity receivers generally have limited buffer size to store coded symbols that have not been fully decoded yet, as well as limited power budget for feedback transmissions. In this paper, we propose improved transmission schemes for online fountain codes to reduce the buffer occupancy and feedback transmissions. Firstly, we analyze the relationship between buffer occupancy and overhead as well as the relationship between recovery rate and overhead for online fountain codes. Motivated by the analysis, we propose the weighted online fountain codes (WOFC) which can adapt to various buffer sizes by adjusting the weight to control the probability that a coded symbol can be fully processed immediately, and analyze its performance. Then we further propose weighted online fountain codes with low feedback (WOFC-LF), which utilize the proposed analysis to estimate the recovery rate, and reduce feedback transmissions. Simulation results verify the effectiveness of the analysis for both OFC and WOFC, and demonstrate the superior performance of WOFC-LF with limited buffer size and feedback transmissions.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2021. Vol. 69, no 12, p. 7960-7973
Keywords [en]
Codes, Decoding, Receivers, Encoding, Buffer storage, Complexity theory, Simulation, Online fountain codes, intermediate performance, erasure channel, feedback
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-307165DOI: 10.1109/TCOMM.2021.3114764ISI: 000731147500009Scopus ID: 2-s2.0-85115665633OAI: oai:DiVA.org:kth-307165DiVA, id: diva2:1632717
Note

QC 20220127

Available from: 2022-01-27 Created: 2022-01-27 Last updated: 2022-06-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Xiao, Ming

Search in DiVA

By author/editor
Cao, CongzheXiao, MingYuan, Jinhong
By organisation
Information Science and Engineering
In the same journal
IEEE Transactions on Communications
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 91 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf