Memory sub-banking scheme for high throughput turbo decoder
暂无分享,去创建一个
[1] Todd M. Austin,et al. SimpleScalar: An Infrastructure for Computer System Modeling , 2002, Computer.
[2] Branka Vucetic,et al. Turbo Codes: Principles and Applications , 2000 .
[3] Bing Xu,et al. Energy efficient turbo decoding for 3G mobile , 2001, ISLPED '01.
[4] Margaret Martonosi,et al. Wattch: a framework for architectural-level power analysis and optimizations , 2000, Proceedings of 27th International Symposium on Computer Architecture (IEEE Cat. No.RS00201).
[5] Wayne E. Stark,et al. Design and Implementation of a Low Complexity VLSI Turbo-Code Decoder Architecture for Low Energy Mobile Wireless Communications , 2000, J. VLSI Signal Process..
[6] Norbert Wehn,et al. A Scalable System Architecture for High-Throughput Turbo-Decoders , 2005, J. VLSI Signal Process..
[7] C. Shung,et al. Generalized trace back techniques for survivor memory management in the Viterbi algorithm , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.
[8] Francky Catthoor,et al. Memory optimization of MAP turbo decoder algorithms , 2001, IEEE Trans. Very Large Scale Integr. Syst..
[9] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[10] Naresh R. Shanbhag,et al. VLSI architectures for SISO-APP decoders , 2003, IEEE Trans. Very Large Scale Integr. Syst..
[11] Keshab K. Parhi,et al. Area-efficient high-speed decoding schemes for turbo decoders , 2002, IEEE Trans. Very Large Scale Integr. Syst..
[12] Mahmut T. Kandemir,et al. Compiler-directed array interleaving for reducing energy in multi-bank memories , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.
[13] Chaitali Chakrabarti,et al. Energy-efficient turbo decoder , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.