A new tight bound on the bit error probability for turbo codes

Abstract

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 E-b/N-0 for which the bound yields meaningful results.