On A* Algorithms for Decoding Short Linear Block Codes

被引:3
作者
Chen, Tien-Hui [1 ]
Chen, Kuan-Chen [1 ]
Lin, Mao-Chao [2 ]
Chang, Chia-Fu [3 ]
机构
[1] Natl Taiwan Univ, Grad Inst Commun Engn, Taipei 106, Taiwan
[2] Natl Taiwan Univ, Dept Elect Engn, Taipei 106, Taiwan
[3] Natl Taiwan Univ, TheMEDIATEK NTU Adv Res Ctr, Taipei 106, Taiwan
关键词
Decoding; linear block code; heuristic function; A* algorithm; soft decoding of block codes; PRIORITY-1ST SEARCH; PERFORMANCE;
D O I
10.1109/TCOMM.2015.2466233
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The A* algorithm for decoding linear block codes is an efficient tree-search method for decoding short linear block codes. The information contained in the parity bits are potentially useful for reducing the edges needed in the tree search. We propose to extract the information embedded in the parity bits by considering sums of parity bits which can be decided by part of the message bits. Analysis for the number of required message bits for obtaining sums of parity bits is provided. The information contained in the parity bits can help to reduce the number of search tree edges.
引用
收藏
页码:3471 / 3481
页数:11
相关论文
共 25 条