Title :
On MAP decoding for tail-biting convolutional codes
Author :
Wang, Yi-Pin ; Ramésh, R. ; Hassan, Amer ; Koorapaty, Havish
Author_Institution :
Ericsson Inc., Research Triangle Park, NC, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
An optimal and a sub-optimal MAP decoder for a tail-biting convolutional code are presented. Necessary conditions for the existence of a tail-biting circle for recursive systematic convolutional (RSC) codes are stated. The performance of a parallel-concatenated convolutional code (PCCC) with tail-biting RSC component codes and trellis terminated RSC component codes are compared
Keywords :
concatenated codes; convolutional codes; maximum likelihood decoding; maximum likelihood estimation; trellis codes; MAP decoding; RSC codes; necessary conditions; optimal MAP decoder; parallel-concatenated convolutional code; recursive systematic convolutional codes; sub-optimal MAP decoder; tail-biting RSC component codes; tail-biting circle; tail-biting convolutional codes; trellis terminated RSC component codes; Bandwidth; Bit error rate; Concatenated codes; Convolutional codes; Decoding; Feedback; Hamming weight; Shift registers; Tail; Turbo codes;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613140
