Abstract
Degree distribution of the encoded symbols is a critical factor that affects the performance of LT codes. Inspired by the SF-LT and the decreasing ripple size LT codes, we propose an SF-DRS degree distribution to construct LT codes, i.e., SF-DRS LT codes. Theoretical analysis proves that our proposed LT codes possess the property that the ripple size decreases as the decoding process continues. Moreover, with an overhead factor of slighter larger than one, the ripple size of SF-DRS LT codes remains larger than one in the entire decoding process. The performance of our proposed LT codes is compared to SF-LT codes and decreasing ripple size over a perfect channel. Simulation results reveal that the proposed SF-DRS LT codes outperform the decreasing ripple size LT codes with respect to the probability of successful decoding, the average overhead factor with a relatively large number of input symbols. Moreover, in contrast to the SF-LT codes, the SF-DRS LT codes achieve a better probability of successful decoding.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.