Abstract
Luby Transform (LT) codes are more important in communication applications due to the characteristics of fast encoding/decoding process, and low complexity. However, LT codes are optimal only when the number of input symbols is close to infinity. Some researches modified the degree distribution of LT codes to make LT codes suitable for short symbol length. In this article, we propose an optimal coding algorithm to recover all of the encoded symbols for LT codes quickly. The proposed algorithm observes the coding status of each client and increases the coding performance by changing the transmission sequence of low-degree and high-degree encoding packets. Simulation results show that the resulting decoding overhead of our algorithm are lower than the traditional LT codes, and our algorithm is very appropriate to server various clients in the broadcasting channel environment.
Highlights
Due to the rapid development of embedded system and wireless communication, smart phones and tablet computer are widely used by people
The performance of the proposed method is compared with Luby Transform (LT) codes
We apply the short data block length to evaluate the performance of proposed codes in comparison with LT codes
Summary
Due to the rapid development of embedded system and wireless communication, smart phones and tablet computer are widely used by people. The network traffic loads are change frequently and unpredictably, the channel errors and loss are very serious. Some data acknowledgement and retransmission methods such as Automatic Repeat Request (ARQ) scheme and Forward Error Correction (FEC) codes are proposed to alleviate the problem of data packet loss. These methods will incur additional overhead that includes data retransmission and add redundancy into the original data. They cannot correctly decode the source data when the packet loss rate is large
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have