Abstract
By combining bit-shift and exclusive-or operations, a weighted zigzag decodable fountain code is proposed to achieve an unequal error protection property. In the proposed scheme, the input symbols of different importance levels are first pre-coded into variable nodes using low-density parity-check codes. Then, bit-shift operations prior to exclusive-or are performed on the non-uniformly selected variable nodes to generate encoded symbols. An analysis of the erasure probabilities based on the and-or tree is further introduced. Simulation results show that by appropriately choosing the maximum bit-shift amount, the proposed weighted zigzag decodable fountain codes can successfully recover the more important input symbols prior to the less important ones.
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.
