中文摘要：

无率的代码通常在编码器产生编码的包的一个潜在地无限的数字并且在解码器收集足够的包保证多重信息包的可靠恢复。常规无率的解码器通常以需要开始在编码的包的每个最新收到的集合之上译码过程的新信仰繁殖(BP ) 的一种平行方式工作，从而导致禁止的译码在实践的复杂性。在这份报纸，我们在场一个新奇连续译码算法，即，连续存储信仰繁殖(SS BP ) 算法，为在吵闹的隧道上的无率的代码。在接待编码的包的一个新组之上，明确地，解码器开始一次新尝试译码到目前为止收到的所有包，用象起始的输入的以前的尝试的结果。而且在新尝试的每次重复，解码器连续地宣传消息，从最近的一个由组组织到一年代初。这样，最新更新的消息能更快被宣传，帮助信息包的恢复。另外，译码算法的建议连续剧比译码算法的存在平行有显著地更低的复杂性。模拟结果在 AWGN，瑞利，和 Rician 褪色隧道验证它的有效性。

英文摘要：

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.