Online fountain code with an improved caching mechanism
Abstract The original online fountain codes discard a large number of symbols that do not meet the requirements at the decoder. To improve channel utilization, this article proposes a new online fountain code. In the completion phase, the proposed code improves the receiving rules of encoded symbols...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-12-01
|
| Series: | IET Communications |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cmu2.12868 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850250680484233216 |
|---|---|
| author | Yin Zhang Zhen Zhen Yuli Zhao Francis C. M. Lau Bochang Ma Bin Zhang Hai Yu Zhiliang Zhu |
| author_facet | Yin Zhang Zhen Zhen Yuli Zhao Francis C. M. Lau Bochang Ma Bin Zhang Hai Yu Zhiliang Zhu |
| author_sort | Yin Zhang |
| collection | DOAJ |
| description | Abstract The original online fountain codes discard a large number of symbols that do not meet the requirements at the decoder. To improve channel utilization, this article proposes a new online fountain code. In the completion phase, the proposed code improves the receiving rules of encoded symbols, that is, the encoded symbols discarded in the original online fountain codes are selectively cached. Moreover, an optimal degree selection strategy of encoded symbols is obtained in the proposed scheme. The valid degree range of the proposed strategy is also analyzed, leading to an upper bound of cached events which eventually limits the number of feedbacks. The theoretical analysis and simulation results reveal that the proposed scheme outperforms two state‐of‐the‐art online fountain codes in terms of overhead factors, number of feedback transmissions, and encoding/decoding efficiency. |
| format | Article |
| id | doaj-art-3d5eb1531ebb45109f6d60fbe3970f7d |
| institution | OA Journals |
| issn | 1751-8628 1751-8636 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Communications |
| spelling | doaj-art-3d5eb1531ebb45109f6d60fbe3970f7d2025-08-20T01:58:08ZengWileyIET Communications1751-86281751-86362024-12-0118201813182510.1049/cmu2.12868Online fountain code with an improved caching mechanismYin Zhang0Zhen Zhen1Yuli Zhao2Francis C. M. Lau3Bochang Ma4Bin Zhang5Hai Yu6Zhiliang Zhu7Software College Northeastern University Shenyang ChinaSoftware College Northeastern University Shenyang ChinaSoftware College Northeastern University Shenyang ChinaDepartment of Electrical & Electronic Engineering The Hong Kong Polytechnic University Hong Kong SAR ChinaSoftware College Northeastern University Shenyang ChinaSoftware College Northeastern University Shenyang ChinaSoftware College Northeastern University Shenyang ChinaSoftware College Northeastern University Shenyang ChinaAbstract The original online fountain codes discard a large number of symbols that do not meet the requirements at the decoder. To improve channel utilization, this article proposes a new online fountain code. In the completion phase, the proposed code improves the receiving rules of encoded symbols, that is, the encoded symbols discarded in the original online fountain codes are selectively cached. Moreover, an optimal degree selection strategy of encoded symbols is obtained in the proposed scheme. The valid degree range of the proposed strategy is also analyzed, leading to an upper bound of cached events which eventually limits the number of feedbacks. The theoretical analysis and simulation results reveal that the proposed scheme outperforms two state‐of‐the‐art online fountain codes in terms of overhead factors, number of feedback transmissions, and encoding/decoding efficiency.https://doi.org/10.1049/cmu2.12868caching mechanismintermediate symbol recovery rateonline fountain codesoverhead analysis |
| spellingShingle | Yin Zhang Zhen Zhen Yuli Zhao Francis C. M. Lau Bochang Ma Bin Zhang Hai Yu Zhiliang Zhu Online fountain code with an improved caching mechanism IET Communications caching mechanism intermediate symbol recovery rate online fountain codes overhead analysis |
| title | Online fountain code with an improved caching mechanism |
| title_full | Online fountain code with an improved caching mechanism |
| title_fullStr | Online fountain code with an improved caching mechanism |
| title_full_unstemmed | Online fountain code with an improved caching mechanism |
| title_short | Online fountain code with an improved caching mechanism |
| title_sort | online fountain code with an improved caching mechanism |
| topic | caching mechanism intermediate symbol recovery rate online fountain codes overhead analysis |
| url | https://doi.org/10.1049/cmu2.12868 |
| work_keys_str_mv | AT yinzhang onlinefountaincodewithanimprovedcachingmechanism AT zhenzhen onlinefountaincodewithanimprovedcachingmechanism AT yulizhao onlinefountaincodewithanimprovedcachingmechanism AT franciscmlau onlinefountaincodewithanimprovedcachingmechanism AT bochangma onlinefountaincodewithanimprovedcachingmechanism AT binzhang onlinefountaincodewithanimprovedcachingmechanism AT haiyu onlinefountaincodewithanimprovedcachingmechanism AT zhiliangzhu onlinefountaincodewithanimprovedcachingmechanism |