检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]空军工程大学信息与导航学院,西安710077
出 处:《计算机应用》2015年第6期1541-1545,共5页journal of Computer Applications
基 金:国家自然科学基金资助项目(61472443;61302153)
摘 要:不规则重复累积码(IRA)的译码通常采用置信传播(BP)译码算法,然而BP译码算法需进行双曲正切函数计算,复杂度高,不利于硬件实现。为此,提出一种基于分段函数修正和预检测机制结合的译码算法,通过对折线近似译码算法进行非均匀误差补偿,使其性能接近BP算法;同时引入预检测机制对校验节点信息传递进行预检测,判断出对后续迭代影响微小的对数似然信息,并将其移出迭代循环,从而减少计算量。仿真结果表明,该算法通过分段函数修正近似双曲正切函数、引入预检测机制能大大降低运算复杂度,并且具有接近BP算法的译码性能。Irregular Repeat Accumulate (IRA) codes' decoding usually adopts Belief Propagation (BP) decoding algorithm, but BP decoding algorithm needs hyperbolic tangent calculation, so its hardware implementation is very difficult because of the high complexity. A decoding algorithm combining the early detection mechanism and offset polyline was put forward. Its performance would approach to BP algorithm via non-uniform error compensation for polyline approximation decoding algorithm. And the early detection method was introduced which observed the transmitted information of check nodes in advance, judged the lines' log-likelihood value which had negligible influence on the next iteration and moved it out of the iteration. So the computational complexity of next iterations was reduced. The simulation results show that the proposed algorithm greatly reduces the computational complexity through the offset polyline approximating the hyperbolic tangent, and the decoding performance is close to BP algorithm.
关 键 词:重复累计码 置信传播译码算法 折线近似译码算法 误差补偿 预检测机制
分 类 号:TN919[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.127