.png){kind=icon}
Return
A* Based Algorithm for Reduced Complexity ML Decoding of Tailbiting Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2010.072310.100295.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The A* algorithm is a graph search algorithm which has shown good results in terms of computational complexity for Maximum Likelihood (ML) decoding of tailbiting convolutional codes. The decoding of tailbiting codes with this algorithm is performed in two phases. In the first phase, a typical Viterbi decoding is employed to collect information regarding the trellis. The A* algorithm is then applied in the second phase, using the information obtained in the first one to calculate the heuristic function. The improvements proposed in this work decrease the computational complexity of the A* algorithm using further information from the first phase of the algorithm. This information is used for obtaining a more accurate heuristic function and finding early terminating conditions for the A* algorithm. Simulation results show that the proposed modifications decrease the complexity of ML decoding with the A* algorithm in terms of the performed number of operations.
Keywords:
Convolutional codes
decoding
tailbiting
A* algorithm
IA* algorithm
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
.png){kind=icon}
