For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A New Tight Bound on the Bit Error Probability for Turbo Codes
Sunghwan HYUN Gyongsu LEE Sin-Chong PARK
IEICE TRANSACTIONS on Communications
Publication Date: 2001/05/01
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories
turbo code, bound, sphere bound, verdu theorem,
Full Text: PDF(426.8KB)>>
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.