Exploring General Memory Structures in Turbo Decoders Using Sliding-Window MAP Algorithm(Communication Devices/Circuits)
スポンサーリンク
概要
- 論文の詳細を見る
Turbo coding is a powerful coding technique that can provide highly reliable data transmission at extremely low signal-to-noise ratios. Owing to the computational complexity of the employed decoding algorithm, the realization of turbo decoders usually takes a large amount of memory space and potentially long decoding delay. Therefore, an efficient memory management strategy becomes one of the key factors toward successfully implementing turbo decoders. This paper focuses on the development of general structures for efficient memory management of turbo decoders employing the sliding-window (Log-) MAP algorithm. Three different structures and the associated mathematic representations are derived to evaluate the required memory size, average decoding rate, and latency based on the speed and the number of the adopted processors. Comparative results show the dependency of the resulting performance based on a set of parameters ; thus provide useful and general information on practical implementations of turbo decoders.
- 社団法人電子情報通信学会の論文
- 2003-11-01
著者
-
Wu Chien-hsing
Graduate School Of Engineering Science And Technology National Yunlin University Of Science And Tech
-
Shieh Ming-der
Faculty Of Electrical Engineering Department National Cheng Kung University
-
WU Chien-Ming
the Graduate School of Engineering Science and Technology, National YunLin University of Science and
-
SHIEH Ming-Der
the Faculty of Electrical Engineering Department, National Cheng Kung University
-
WU Chien-Hsing
the Faculty of Electrical Engineering Department, National Chung Cheng University
関連論文
- Exploring General Memory Structures in Turbo Decoders Using Sliding-Window MAP Algorithm(Communication Devices/Circuits)
- Exploring General Memory Structures in Turbo Decoders Using Sliding-Window MAP Algorithm
- Novel Algorithms and VLSI Design for Division over GF(2^m )