.png){kind=icon}
返回
Advanced Information of Parity Bits for Decoding Short Linear Block Codes Using the A* Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2013.020813.120216.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The A* algorithm for decoding linear block codes is known to be an efficient tree-search method for decoding short linear block codes. We propose to employ the early acquired information of some parity bits to speed up the tree search. Analysis for the number of required information bits for obtaining the parity bits is provided. In addition, two versions of the modified A* algorithm which take advantage of the advanced information of parity bits are provided. Simulation results show that there is advantage in reducing the number of search tree edges in each proposed version as compared with two existing A* algorithms which do not consider the early information of parity bits.
Keyword:
Decoding
linear block code
A* algorithm
soft decoding of block codes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Proliferative parameters of mammalian cell systems and their r�le in tumor growth and carcinogenesis
PREAI
分享收藏
查看更多内容