Abstract
Rateless coding such as Luby transform (LT) codes is representative of rate adaptive solutions to improve the frequency efficiency of transmitting data over a time-varying wireless channel. Also, these type of codes use belief propagation (BP) decoding which searches for encoded packets with degree 1 among the large numbers of encoded packets. This method fails if no encoded packets with degree 1 exist. However, in reality, small numbers of input packets are often encountered. In this paper, we have proposed a decoding algorithm that increases the performance of these codes for the small number of source packets. After the failure of BP decoding, to recover the remaining source packets, we use a method which keeps on decoding using the encoded packets whose degrees are not one. This algorithm continues until a degree 1 packet emerges in one of the iterations of this decoding process. Then, decoding algorithm switches back to the traditional BP decoding.
Sign-in/Register to access full text options 
Free) 
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 call
