DocumentCode :
52867
Title :
An Efficient ML Decoder for Tail-Biting Codes Based on Circular Trap Detection
Author :
Xiaotao Wang ; Hua Qian ; Weidong Xiang ; Jing Xu ; Hao Huang
Author_Institution :
Shanghai Inst. of Microsyst. & Inf. Technol., Grad. Univ. of Chinese Acad. of Sci., Shanghai, China
Volume :
61
Issue :
4
fYear :
2013
fDate :
Apr-13
Firstpage :
1212
Lastpage :
1221
Abstract :
Tail-biting codes are efficient coding techniques to eliminate the rate loss in conventional known-tail convolutional codes at a cost of increased complexity in decoders. In addition, tail-biting trellis representation of block codes makes the trellis-based maximum likelihood (ML) decoder desirable for implementation. Circular Viterbi algorithm (CVA) is introduced to decode the tail-biting codes for its decoding efficiency. However, its decoding process suffers from circular traps, which degrade the decoding efficiency. In this paper, we propose an efficient checking rule for the detection of circular traps. Based on this rule, a novel maximum likelihood (ML) decoding algorithm for tail-biting codes is presented. On tail-biting trellis, computational complexity and memory consumption of this decoder are significantly reduced comparing to other available ML decoders, such as the two-phase ML decoder. To further reduce the decoding complexity, we propose a new near-optimal decoding algorithm based on a simplified trap detection strategy. The performance of the above algorithms is validated with simulation.
Keywords :
Viterbi decoding; block codes; computational complexity; convolutional codes; maximum likelihood decoding; maximum likelihood detection; trellis codes; CVA; ML decoder algorithm; block codes; circular Viterbi algorithm; circular trap detection strategy; coding techniques; computational complexity; decoding process; efficient checking rule; memory consumption; near-optimal decoding algorithm; rate loss; tail convolutional codes; tail-biting codes; tail-biting trellis; tail-biting trellis representation; trellis-based maximum likelihood decoder; Algorithm design and analysis; Decoding; Equations; Iterative decoding; Measurement; Silicon; Viterbi algorithm; Tail-biting trellis; circular Viterbi algorithm; circular trap; convolutional code; optimal decoder;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.2013.020813.120275
Filename :
6461031
Link To Document :
بازگشت