Journal article
Bounds on the a priori index crossover probabilities for trellis-based channel codes
IEEE transactions on information theory, Vol.46(4), pp.1276-1291
07/2000
Handle:
https://hdl.handle.net/2376/100372
Abstract
This paper derives truncated union bounds on the a priori index crossover probabilities p(j|i) that result when an n-bit data index i is convolutionally encoded, transmitted over a noisy channel, and decoded with the Viterbi algorithm, giving received index j. The bounds are derived with a modified transfer function technique, using n-stage state transition matrices with symbolic labels. The technique is easily automated with commercial symbolic algebra packages. Bounds are obtained for convolutional and trellis-coded modulation (TCM) codes, over binary symmetric and additive white Gaussian noise (AWGN) channels. A joint source channel coding example demonstrates that the bounds on p(j|i) developed in this paper can give a 13-dB accuracy improvement in end-to-end signal-to-noise ratio (SNR) predictions, when compared to predictions based on bounds on the delivered bit error probability P/sub b/.
Metrics
12 Record Views
Details
- Title
- Bounds on the a priori index crossover probabilities for trellis-based channel codes
- Creators
- B Belzer - Dept. of Electr. Eng. & Comput. Sci., Washington State Univ., Pullman, WA, USA
- Publication Details
- IEEE transactions on information theory, Vol.46(4), pp.1276-1291
- Academic Unit
- Electrical Engineering and Computer Science, School of
- Publisher
- IEEE
- Identifiers
- 99900546699401842
- Language
- English
- Resource Type
- Journal article