Non-recursive max* operator with reduced implementation complexity for turbo decoding.

IET Communications(2012)

引用 19|浏览3
暂无评分
摘要
In this study, the authors deal with the problem of how to effectively approximate the max* operator when having n >; 2 input values, with the aim of reducing implementation complexity of conventional Log-MAP turbo decoders. They show that, contrary to previous approaches, it is not necessary to apply the max* operator recursively over pairs of values. Instead, a simple, yet effective, solution fo...
更多
查看译文
关键词
approximation theory,decoding,error statistics,turbo codes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要