摘要
Log-MAP算法是Turbo码译码算法的一种简化算法,这类算法仍具有译码复杂度高,译码时延大的缺点。针对这一问题,提出了一种简化的对数最大后验概率译码算法。该算法基于逼近理论,用分段式最佳平方逼近多项式近似计算校正函数。仿真结果表明,简化算法具有低复杂度、译码时延少的优点,且译码性能与标准Log-MAP算法相近,较适合在实际工程中使用。
Log-MAP algorithm is a simplified decoding method of Turbo code.The algorithm has the defects of high complexity and decoding delay.This paper presented a simplified log maximum a posteriori（Log-MAP） algorithm based on approximation theory.In the simplified algorithm,adopted the sectional optimal square approximation polynomial to calculate the correction function.Compared with the standard Log-MAP algorithm,the simplified algorithm has the advantages of low complexity,low decoding delay.And the decoding performance is similar to the standard Log-MAP algorithm.So it is more suitable for using in practical engineering.
出处
《计算机应用研究》
CSCD
北大核心
2011年第6期2306-2309,共4页
Application Research of Computers
基金
湖南省高校创新平台基金资助项目(2009642527)
