A memory-based architecture for very-high-throughput variable length codec design
暂无分享,去创建一个
[1] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] V. K. Prasanna,et al. Area efficient VLSI architectures for Huffman coding , 1993 .
[3] Amar Mukherjee,et al. MARVLE: a VLSI chip for data compression using tree-based codes , 1993, IEEE Trans. Very Large Scale Integr. Syst..
[4] Keshab K. Parhi. High-speed Huffman decoder architectures , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.
[5] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[6] Mostafa A. Bassiouni,et al. Multibit decoding/encoding of binary codes using memory based architectures , 1991, [1991] Proceedings. Data Compression Conference.
[7] David G. Messerschmitt,et al. Designing a high-throughput VLC decoder. I. Parallel decoding methods , 1992, IEEE Trans. Circuits Syst. Video Technol..
[8] Shih-Fu Chang,et al. Designing high-throughput VLC decoder. I. Concurrent VLSI architectures , 1992, IEEE Trans. Circuits Syst. Video Technol..
[9] Mostafa A. Bassiouni,et al. Efficient VLSI designs for data transformation of tree-based codes , 1991 .
[10] N. Ranganathan,et al. A parallel architecture for data compression , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.