A lagrangian relaxation based decoding algorithm for LTE turbo codes
A lagrangian relaxation based decoding algorithm for LTE turbo codes
复制标题
基于拉格朗日松弛的 LTE Turbo 码解码算法
DOI：
10.1109/istc.2010.5613906
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
F. Kienle
中科院分区：
文献类型：
--
作者：
A. Tanatmis;Stefan Ruzika;F. Kienle
LTE Turbo码的最大似然解码（MLD）可以用整数规划（IP）问题来表示。基于一个新的IP公式，我们提出了一个两步解码算法。在某些假设下，可以保证我们的两步算法输出ML码字。我们还表明，在LTE Turbo码与短块长度，例如，132，228，我们的算法优于线性规划解码（LPD）。对于（132，40）LTE Turbo码，该算法比标准迭代Turbo码具有更好的纠错性能。
Maximum likelihood decoding (MLD) of LTE turbo codes can be formulated as an integer programming (IP) problem. Based on a novel IP formulation we propose a two step decoding algorithm. Under certain assumptions it can be guaranteed that our two step algorithm outputs the ML codeword. We also show that on LTE turbo codes with short block length, e.g., 132, 228, our algorithm outperforms linear programming decoding (LPD). For the (132,40) LTE turbo code it is also shown that the proposed algorithm has better error correcting performance than standard iterative turbo decoding.