To bite or not to bite-a study of tail bits versus tail-biting

Author

Wang, Yi-Pin Eric ; Ramésh, R.

Author_Institution

Ericsson Inc., NC, USA

Volume

2

fYear

1996

fDate

15-18 Oct 1996

Firstpage

317

Abstract

Tail bits and tail-biting are the two commonly used methods for terminating the trellis of convolutional codes. In this paper, we evaluate the relative performance of these two options by comparing their performance in a variety of cases. Suboptimal decoding algorithms for the tail-biting case are proposed. Puncturing is proposed as an alternative method to prevent the rate loss when tail bits are used. The performance of several puncturing schemes are evaluated. In addition, we explore the bit error rate of these schemes as a function of position of bits in a block

Keywords

Viterbi decoding; convolutional codes; digital communication; error statistics; maximum likelihood decoding; trellis codes; Viterbi algorithm; bit error rate; convolutional codes; maximum likelihood decoder; performance; puncturing; rate loss; relative performance; suboptimal decoding algorithms; tail bits; tail-biting; trellis termination; Bit error rate; Convolutional codes; Decoding; Digital communication; GSM; Gaussian channels; Propagation losses; Signal to noise ratio; Tail;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 1996. PIMRC'96., Seventh IEEE International Symposium on

Conference_Location

Taipei

Print_ISBN

0-7803-3692-5

Type

conf

DOI

10.1109/PIMRC.1996.567407

Filename

567407