This paper describes the implementation of a multiplierless 1-D DCT which is also applicable to 2-D computation. The key idea is based on the binary DCT of which multipliers are replaced by lifting parameters that essentially are shifts and adds. For low power applications and smaller hardware size, a bit-serial architecture was invoked in the implementation of such an algorithm. Varying data word length, MSE obtained from our approach and some. similar algorithms are also investigated and reported
103 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.A new architecture for a carr...
The discrete cosine transform (DCT) is a key step in many image and video-coding applications, and i...
Low power consumption in computing systems is a key requirement for devices such as cell phones and ...
This paper describes the implementation of a multiplierless 1-D DCT which is also applicable to a 2-...
This paper presents an efficient serial-parallel multiplier algorithm that realizes the input data b...
An implementation of a fully pipelined bit serial architecture to compute the 2-D Discrete Cosine Tr...
Digit-serial architectures obtained using traditional unfolding techniques cannot be pipelined beyon...
. This paper shows an efficient design for 2D-DCT on dynamically configurable coarse-grained archite...
[[abstract]]© 1996 Institute of Electrical and Electronics Engineers - This paper presents a fast al...
[[abstract]]A new systolic array without matrix transposition hardware is proposed to compute the tw...
This paper investigates a number of issues having an impact on the performance of an approximated mu...
The discrete cosine transform (DCT) is widely used in the area of signal and image processing. The 2...
This paper presents a fast algorithm along with its systolic array implementation for computing the ...
Traditional bit-serial multipliers present one or more clock cycles of data latency. When combined w...
In this paper, a recursive algorithm for the computation of 2-D DCT using Ramanujan Numbers is propo...
103 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.A new architecture for a carr...
The discrete cosine transform (DCT) is a key step in many image and video-coding applications, and i...
Low power consumption in computing systems is a key requirement for devices such as cell phones and ...
This paper describes the implementation of a multiplierless 1-D DCT which is also applicable to a 2-...
This paper presents an efficient serial-parallel multiplier algorithm that realizes the input data b...
An implementation of a fully pipelined bit serial architecture to compute the 2-D Discrete Cosine Tr...
Digit-serial architectures obtained using traditional unfolding techniques cannot be pipelined beyon...
. This paper shows an efficient design for 2D-DCT on dynamically configurable coarse-grained archite...
[[abstract]]© 1996 Institute of Electrical and Electronics Engineers - This paper presents a fast al...
[[abstract]]A new systolic array without matrix transposition hardware is proposed to compute the tw...
This paper investigates a number of issues having an impact on the performance of an approximated mu...
The discrete cosine transform (DCT) is widely used in the area of signal and image processing. The 2...
This paper presents a fast algorithm along with its systolic array implementation for computing the ...
Traditional bit-serial multipliers present one or more clock cycles of data latency. When combined w...
In this paper, a recursive algorithm for the computation of 2-D DCT using Ramanujan Numbers is propo...
103 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.A new architecture for a carr...
The discrete cosine transform (DCT) is a key step in many image and video-coding applications, and i...
Low power consumption in computing systems is a key requirement for devices such as cell phones and ...