| 注册
首页|期刊导航|计算机应用与软件|采用近似 max*运算的 Log-MAP 译码算法

采用近似 max*运算的 Log-MAP 译码算法

孙增友 李欢欢 王蒙 王景芹

计算机应用与软件2016,Vol.33Issue(3):255-258,4.
计算机应用与软件2016,Vol.33Issue(3):255-258,4.DOI:10.3969/j.issn.1000-386x.2016.03.060

采用近似 max*运算的 Log-MAP 译码算法

LOG-MAP DECODING ALGORITHM USING APPROXIMATE MAX* OPERATION

孙增友 1李欢欢 1王蒙 2王景芹2

作者信息

  • 1. 东北电力大学信息工程学院 吉林 吉林 130012
  • 2. 河北工业大学电气工程学院 天津 300130
  • 折叠

摘要

Abstract

In order to effectively reduce the consumption of Turbo decoding hardware storage,in this paper we propose an improved Log-MAP algorithm which is based on approximate max* operation,and find out two maximum values in a set of data through designing an appropriate digital circuit and embed them into their correlated function terms,thus effectively implement the hardware architecture of Turbo decoder with low complexity.Experimental results show that the proposed architecture is simpler by 30% on average than the architecture of Constant Log-MAP,it reaches the BER performance almost the same as Log-MAP’s,reduces the decoding complexity,and is convenient for practical engineering application.

关键词

Turbo码/Log-MAP算法/Constant Log-MAP/复杂度

Key words

Turbo codes/Log-MAP algorithm/Constant Log-MAP/Complexity

分类

计算机与自动化

引用本文复制引用

孙增友,李欢欢,王蒙,王景芹..采用近似 max*运算的 Log-MAP 译码算法[J].计算机应用与软件,2016,33(3):255-258,4.

基金项目

国家自然科学基金项目 ()

计算机应用与软件

OACSTPCD

1000-386X

访问量0
|
下载量0
段落导航相关论文