On $A^{\\ast }$ Algorithms for Decoding Short Linear Block Codes

Author

Tien-Hui Chen ; Kuan-Chen Chen ; Mao-Chao Lin ; Chia-Fu Chang

Author_Institution

Grad. Inst. of Commun. Eng., Nat. Taiwan Univ., Taipei, Taiwan

Volume

63

Issue

10

fYear

2015

Firstpage

3471

Lastpage

3481

Abstract

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.

Keywords

block codes; decoding; linear codes; search problems; A* algorithm; decoding linear block codes; decoding short linear block codes; message bits; parity bits; search tree edges; tree search; tree search method; Algorithm design and analysis; Block codes; Decoding; Generators; Iterative decoding; Magnetic resonance imaging; Measurement; $A^ast$ algorithm; A algorithm; Decoding; decoding; heuristic function; linear block code; soft decoding of block codes;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2015.2466233

Filename

7182759

On Algorithms for Decoding Short Linear Block Codes

Tien-Hui Chen ; Kuan-Chen Chen ; Mao-Chao Lin ; Chia-Fu Chang

jour

On $A^{\\ast }$ Algorithms for Decoding Short Linear Block Codes