Referenced Items are not available for this document.
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
)
Date of Publication: May 2001
- Page(s):
- 825 - 830
- ISSN :
- 0733-8716
- INSPEC Accession Number:
- 6945707
- Digital Object Identifier :
- 10.1109/49.924866
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 07 August 2002
- Issue Date :
- May 2001
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
