The Experts below are selected from a list of 51759 Experts worldwide ranked by ideXlab platform
L. Wanhammar - One of the best experts on this subject based on the ideXlab platform.
-
High speed pipelined parallel Huffman decoding
1997 IEEE International Symposium on Circuits and Systems (ISCAS), 1997Co-Authors: M.k. Rudberg, L. WanhammarAbstract:This paper introduces a new class of Huffman decoders which is a development of the parallel Huffman decoder model. With pipelining and partitioning, a regular architecture with an arbitrary degree of pipelining is developed. The proposed architecture dramatically reduces the symbol decoder requirements compared to previous results, and still is the actual implementation of the symbol decoder not treated. The proposed architectures also have a potential of realizing high speed, low power Huffman decoders.
T.h.-y. Meng - One of the best experts on this subject based on the ideXlab platform.
-
A parallel decoder of programmable Huffman codes
IEEE Transactions on Circuits and Systems for Video Technology, 1995Co-Authors: T.h.-y. MengAbstract:Huffman coding, a variable-length entropy coding scheme, is an integral component of international standards on image and video compression including high-definition television (HDTV). The high-bandwidth HDTV systems of data rate in excess of 100 Mpixels/s presents a challenge for designing a fast and economic circuit for intrinsically sequential Huffman decoding operations. This paper presents an algorithm and a circuit implementation for parallel decoding of programmable Huffman codes by using the numerical properties of Huffman codes. The 1.2 /spl mu/m CMOS implementation for a single JPEG AC table of 256 codewords of up to 16-b codeword lengths is estimated to run at 10 MHz with a chip area of 11 mm/sup 2/, decoding one codeword per cycle. The design can be pipelined to deliver a throughput of 80 MHz for decoding input streams of consecutive Huffman codes. Furthermore, our programmable scheme can be easily integrated into data paths of video processors to support different Huffman tables used in image/video applications.
-
A programmable parallel Huffman decoder
Proceedings of 1st International Conference on Image Processing, 1994Co-Authors: T.h.-y. MengAbstract:Huffman coding is an integral component of international standards on image and video compression including high-definition television (HDTV). The high-bandwidth HDTV systems of data rate in excess of 100 Mpixels/sec presents a challenge for designing a fast and economic circuit for intrinsically sequential Huffman decoding operations. The paper presents an algorithm and a circuit implementation for parallel decoding of programmable Huffman codes by using the numerical properties of Huffman codes. The 1.2 /spl mu/m CMOS implementation for a single JPEG AC table of 256 codewords of up to 16-bit codeword lengths is estimated to run at 40 MHz with a chip area of 11 mm/sup 2/, decoding one codeword per cycle. The design can be pipelined to deliver a throughput of 80 MHz for decoding input streams of consecutive Huffman codes. Furthermore, the programmable scheme can be easily integrated into data paths of video processors to support different Huffman tables used in image/video applications.
K. Saito - One of the best experts on this subject based on the ideXlab platform.
-
CAM-based VLSI architecture for Huffman coding with real-time optimization of the code word table [image coding example]
2005 IEEE International Symposium on Circuits and Systems, 2005Co-Authors: T. Kumaki, Y. Kuroda, T. Koide, H.j. Mattausch, H. Noda, K. Dosaka, K. Arimoto, K. SaitoAbstract:Huffman coding is probably the best known and most widely used data compression technique. Nevertheless, the task of further decreased compression ratio through Huffman code up-dating in real-time is still a largely unsolved problem. In this paper, a novel architecture for CAM (content addressable memory)-based Huffman coding with real-time optimization of the code word table, called CHRC, is proposed. A CAM is exploited to implement fast Huffman encoding, and simultaneously the code word table is reconstructed and up-dated in realtime. The effectiveness of the proposed architecture is verified by structure, encoding flow and simulation results. The example of a JPEG application shows that our proposed CHRC method is able to achieve up to 40% smaller encoded picture sizes, and 6 times smaller clock cycle number for the encoding hardware than conventional Huffman coding methods.
M.k. Rudberg - One of the best experts on this subject based on the ideXlab platform.
-
High speed pipelined parallel Huffman decoding
1997 IEEE International Symposium on Circuits and Systems (ISCAS), 1997Co-Authors: M.k. Rudberg, L. WanhammarAbstract:This paper introduces a new class of Huffman decoders which is a development of the parallel Huffman decoder model. With pipelining and partitioning, a regular architecture with an arbitrary degree of pipelining is developed. The proposed architecture dramatically reduces the symbol decoder requirements compared to previous results, and still is the actual implementation of the symbol decoder not treated. The proposed architectures also have a potential of realizing high speed, low power Huffman decoders.
R. Hashemian - One of the best experts on this subject based on the ideXlab platform.
-
Condensed table of Huffman coding, a new approach to efficient decoding
IEEE Transactions on Communications, 2004Co-Authors: R. HashemianAbstract:This letter introduces a new technique for designing and decoding Huffman codes. The key idea is to define a condensed Huffman table (CHT) that is smaller than the ordinary Huffman table and which leads to fast decoding. For example, the new approach has been shown to reduce the memory consumption by a factor of eight, compared with the single-side grown Huffman table.
-
Direct Huffman coding and decoding using the table of code-lengths
Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing, 2003Co-Authors: R. HashemianAbstract:A new Huffman coding and decoding technique is presented. There is no need to construct a full size Huffman table in this technique; instead, the symbols are encoded directly from the table of code-lengths. For decoding purposes a new Condensed Huffman Table (CHT) is also introduced. It is shown that by employing this technique both encoding and decoding operations become significantly faster, and the memory consumption also becomes much smaller compared to the normal Huffman coding/decoding.
-
Condensed Huffman coding, a new efficient decoding technique
The 2002 45th Midwest Symposium on Circuits and Systems 2002. MWSCAS-2002., 2002Co-Authors: R. HashemianAbstract:A new technique is proposed for decoding Huffman codes. In this technique a Condensed Huffman Table (CHT) for decoding purposes replaces a typical Huffman table. It is shown that a CHT is much smaller in size and the decoding becomes significantly faster. In an example with a typical Huffman table containing 108 codewords, it is shown that a CHT with only 14 codewords is sufficient to perform the decoding.
-
Reduced code transmission and high speed reconstruction of Huffman tables
2001 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (IEEE Cat. No.01CH37233), 2001Co-Authors: R. Hashemian, M. AhmadiAbstract:A Huffman (1952) code reconstruction technique is presented. It is shown that, based on some unique properties of a particular Huffman coding scheme, called single-side grown Huffman table, only certain codes need to be transmitted to the decoder to reconstruct the entire Huffman table.
