By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zangl, J. ; Inst. of Commun. Eng., Munich Univ. of Technol., Germany ; Herzog, R.

The tangential sphere bound (TSB) of Poltyrev (1994) is a tight upper bound on the word error probability Pw 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 Pb is given by Sason/Shitz (see IEEE Trans. Inform. Theory, vol.46, p.24-47, 2000). We improve the tangential sphere bound on Pb 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 Ro

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:19 ,  Issue: 5 )