Improved online fountain codes. Issue 18 (9th October 2018)

• Record Type: Journal Article
• Authors: Zhao, Yuli; Zhang, Yin; Lau, Francis C.M.; Yu, Hai; Zhu, Zhiliang
• Is Part Of: IET communications. Volume 12:Issue 18(2018)
• Page Start: 2297
• Page End: 2304
• Publication Date: 2018-10-09
• Subjects: channel coding -- codes -- encoding -- graph theory -- random codes -- decoding -- probability; original fountain codes -- intermediate symbol recovery rate -- average encoded symbols -- improved online fountain code -- growth codes -- degree‐1 input symbols -- received encoded symbols -- neighbouring white symbols -- original online fountain codes; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2018.5486
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : Online fountain codes have been proven to require lower overhead and fewer feedbacks than growth codes for successful decoding. In an attempt to improve the intermediate symbol recovery rate, the authors propose sending a number of degree‐1 input symbols prior to the build‐up phase based on a simple application of probability theory. In addition, during the completion phase, received encoded symbols with three neighbouring white (un‐decoded) symbols are retained for decoding and updating the decoding graph later. The performance and characteristics of the proposed improved online fountain codes are compared to those of the original online fountain codes over an erasure channel. Simulation results reveal that the improved online fountain codes outperform the original fountain codes in terms of intermediate symbol recovery rate, average encoded symbols required to be generated by the sender, average feedback transmissions, and encoding/decoding efficiency.