TY - JOUR
T1 - Weighted Online Fountain Codes with Limited Buffer Size and Feedback Transmissions
AU - Huang, Jingxuan
AU - Fei, Zesong
AU - Cao, Congzhe
AU - Xiao, Ming
AU - Yuan, Jinhong
N1 - Publisher Copyright:
© 1972-2012 IEEE.
PY - 2021/12/1
Y1 - 2021/12/1
N2 - 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.
AB - 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.
KW - Online fountain codes
KW - erasure channel
KW - feedback
KW - intermediate performance
UR - http://www.scopus.com/inward/record.url?scp=85115665633&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2021.3114764
DO - 10.1109/TCOMM.2021.3114764
M3 - Article
AN - SCOPUS:85115665633
SN - 1558-0857
VL - 69
SP - 7960
EP - 7973
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 12
ER -