科研之友
微信
新浪微博
Facebook
分享链接
摘要
A new type of recursive algorithm for decoding turbo codes is proposed, based on a symbol-by-symbol maximum a posteriori probability algorithm. It requires only a forward recursion and has lower computational complexity. The number of variables to be stored increases linearly with the decoding delay. For iterative decoding, the extrinsic information given by the new algorithm is also described. This algorithm can be used in continuous decoding for both recursive and non-recursive encoder.
- 出版日期2000-7
- 单位西安电子科技大学
