A New Tight Bound on the Bit Error Probability for Turbo Codes

Sunghwan HYUN  Gyongsu LEE  Sin-Chong PARK  

Publication
IEICE TRANSACTIONS on Communications   Vol.E84-B   No.5   pp.1440-1442
Publication Date: 2001/05/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories
Keyword: 
turbo code,  bound,  sphere bound,  verdu theorem,  

Full Text: PDF>>
Buy this Article




Summary: 
A tight bound on the bit error probability for turbo codes is derived by refining the Sphere bound by means of the reduced value of the coefficients which apply Verdu theorem. This approach is simpler than other upper bound techniques and extends the reliable region of Eb/N0 for which the bound yields meaningful results.