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

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2001-05-01

著者

• Park Sin-chong

  Information And Communications University

• HYUN Sunghwan

  Information and Communications University

• LEE Gyongsu

  Information and Communications University

• Lee G

  Haenyang Univ. Seoul Kor

関連論文

• A New Tight Bound on the Bit Error Probability for Turbo Codes
• Modified Backoff Algorithm with Station Number Adaptiveness for IEEE 802.11 Wireless LANs(Wireless Communication Technology)
• Cut-Off Rate of Multiple Antenna Systems over Frequency-Flat, Fast Fading Channels(Wireless Communication Technologies)
• A Turbo Decoder with Reduced Number of Iterations Using Even Parity-Check Bits

スポンサーリンク