Improved tangential sphere bound on the bit-error probability of concatenated codes

Author

Zangl, Johannes ; Herzog, Rupert

Author_Institution

Inst. of Commun. Eng., Munich Univ. of Technol., Germany

Volume

19

Issue

5

fYear

2001

fDate

5/1/2001 12:00:00 AM

Firstpage

825

Lastpage

830

Abstract

The tangential sphere bound (TSB) of Poltyrev (1994) is a tight upper bound on the word error probability P_w of linear codes with maximum likelihood decoding and is based on the code´s distance spectrum. An extension of the TSB to a bound on the bit-error probability P_b is given by Sason/Shitz (see IEEE Trans. Inform. Theory, vol.46, p.24-47, 2000). We improve the tangential sphere bound on P_b and apply the new method to some examples. Our comparison to other bounds as well as to simulation results shows an improved tightness, particularly for signal-to-noise ratios below the value corresponding to the computational cutoff rate R_o

Keywords

concatenated codes; error statistics; linear codes; maximum likelihood decoding; noise; turbo codes; SNR; bit-error probability; code distance spectrum; computational cutoff rate; concatenated codes; linear codes; maximum likelihood decoding; signal-to-noise ratio; simulation results; tangential sphere bound; tight upper bound; turbo codes; word error probability; AWGN; Additive white noise; Bit error rate; Concatenated codes; Gaussian noise; Maximum likelihood decoding; Modulation coding; Phase modulation; Signal to noise ratio; Upper bound;

fLanguage

English

Journal_Title

Selected Areas in Communications, IEEE Journal on

Publisher

ieee

ISSN

0733-8716

Type

jour

DOI

10.1109/49.924866

Filename

924866