Abstract
Recently, fountain codes have developed some online versions to cope with the increasingly complicated spectrum environment. The conventional online fountain code structures are still not sufficient to meet the unequal recovery time (URT) requirement when the data have a mass of different priorities. This letter adopts an expanding-window strategy to implement two structures, where the data with higher priority ensure less recovery time. Simulation results verify the superior performance of two structures that can achieve a significant increase in decoding speed of the data of high priorities, except that they are accompanied by negligible extra overhead in comparison with the conventional online fountain codes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
