Scaling Law of Turbo Codes over the Binary Erasure Channel(Fundamental Theories for Communications)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, it is shown that the bit erasure probability of turbo codes with iterative decoding in the waterfall region is nonlinearly scaled by the information blocklength. This result can be used to predict efficiently the bit erasure probability of the finite-length turbo codes over the binary erasure channel.
- 社団法人電子情報通信学会の論文
- 2007-02-01
著者
-
Lee Jeong
School Of Electrical And Electronics Engineering Chung-ang University
-
Yu Sungwook
School Of Electrical And Electronics Engineering Chung-ang University
-
Lee Jeong
School Of Electrical And Electronics Eng. Chung-ang University
-
Yu Sungwook
School Of Electrical And Electronic Engineering Chung-ang Univ.
関連論文
- A Hybrid ARQ Using Double Binary Turbo Codes(Fundamental Theories for Communications)
- A Probabilistic Approach for the Determination of Sleep Interval in IEEE 802.16e
- Study of Turbo Codes and Decoding in Binary Erasure Channel Based on Stopping Set Analysis(Fundamental Theories for Communications)
- A Novel Turbo Coded Modulation Scheme for Deep Space Optical Communications
- Enhancement of Light Extraction from GaN-Based Light-Emitting Diodes by Coating Surface with Al2O3 Powder
- Scaling Law of Turbo Codes over the Binary Erasure Channel(Fundamental Theories for Communications)
- An Efficient Signal Detection Method for Uplink Multiuser Systems Based on Collaborative Spatial Multiplexing
- High-Speed and Low-Complexity Decoding Architecture for Double Binary Turbo Code
- 2×Nr MIMO ARQ Scheme Using Multi-Strata Space-Time Codes
- Nanoparticle Doped In-Cell Retarder for Low Operating Voltage in Transflective Liquid Crystal Displays
- Reliability Properties of Solderable Conductive Adhesives with Low-Melting-Point Alloy Fillers