The parallel decoding method of a parallel concatenation of multiple codes is well known. In this paper, we present a new serial decoding method. The iterative gain in this method is always one. Therefore, this method...The parallel decoding method of a parallel concatenation of multiple codes is well known. In this paper, we present a new serial decoding method. The iterative gain in this method is always one. Therefore, this method does not need optimization of the iterative gain by using simulated annealing like the parallel decoding method. Though it is simpler than the parallel decoding method in calculation, it gives the same performance. We also use Pearl's propagation algorithm to show the appropriateness of the serial decoding method.展开更多
Rateless code usually generates a potentially infinite number of coded packets at the encoder and collects enough packets at the decoder to ensure reliable recovery of multiple information packets.The conventional rat...Rateless code usually generates a potentially infinite number of coded packets at the encoder and collects enough packets at the decoder to ensure reliable recovery of multiple information packets.The conventional rateless decoder usually works in a parallel manner which needs to initiate a new belief propagation (BP) decoding procedure upon each newly received collection of coded packets,thereby resulting in prohibitive decoding complexity in practice.In this paper,we present a novel serial decoding algorithm,i.e.,the serial storage belief propagation (SS BP) algorithm,for rateless codes over noisy channels.Specifically,upon receiving a new group of coded packets,the decoder initiates a new attempt to decode all the packets received so far,using the results of the previous attempt as initial input.Moreover,in each iteration of the new attempt,the decoder serially propagates the messages group by group from the most recent one to the earliest one.In this way,the newly updated messages can be propagated faster,expediting the recovery of information packets.In addition,the proposed serial decoding algorithm has significantly lower complexity than the existing parallel decoding algorithms.Simulation results validate its effectiveness in AWGN,Rayleigh,and Rician fading channels.展开更多
文摘The parallel decoding method of a parallel concatenation of multiple codes is well known. In this paper, we present a new serial decoding method. The iterative gain in this method is always one. Therefore, this method does not need optimization of the iterative gain by using simulated annealing like the parallel decoding method. Though it is simpler than the parallel decoding method in calculation, it gives the same performance. We also use Pearl's propagation algorithm to show the appropriateness of the serial decoding method.
基金Project supported by the National Basic Research Program (973) of China (Nos. 2009CB320405 and 2012CB316104)the National High-Tech R & D Program (863) of China (No. 2007AA01Z257)+1 种基金the National Natural Science Foundation of China (No. 60972057)the National Science & Technology Major Project of China (Nos. 2009ZX03003-004-03 and 2010ZX03003-003-01)
文摘Rateless code usually generates a potentially infinite number of coded packets at the encoder and collects enough packets at the decoder to ensure reliable recovery of multiple information packets.The conventional rateless decoder usually works in a parallel manner which needs to initiate a new belief propagation (BP) decoding procedure upon each newly received collection of coded packets,thereby resulting in prohibitive decoding complexity in practice.In this paper,we present a novel serial decoding algorithm,i.e.,the serial storage belief propagation (SS BP) algorithm,for rateless codes over noisy channels.Specifically,upon receiving a new group of coded packets,the decoder initiates a new attempt to decode all the packets received so far,using the results of the previous attempt as initial input.Moreover,in each iteration of the new attempt,the decoder serially propagates the messages group by group from the most recent one to the earliest one.In this way,the newly updated messages can be propagated faster,expediting the recovery of information packets.In addition,the proposed serial decoding algorithm has significantly lower complexity than the existing parallel decoding algorithms.Simulation results validate its effectiveness in AWGN,Rayleigh,and Rician fading channels.
