[[abstract]]© 1995 Institute of Electrical and Electronics Engineers - The authors present an algorithm and its systolic implementation for computing the 1-D N-point inverse discrete cosine transform (IDCT), where N is a power of two. The architecture requires (N2 - 1)/3 multipliers and can evaluate one N-point IDCT every clock cycle. Owing to the features of regularity and modularity, the architecture is well suited to VLSI implementation. Compared with existing related arrays, the proposed algorithm has a better area-time performance. In addition, it can be extended to implementing the 2-D IDCT based on the row-column decomposition method.[[department]]電機工程學
Abstract—A reduced-complexity convolutional formulation is presented for systolic implementation of ...
[[abstract]]In this paper, we propose two new VLSI architectures for computing the N-point discrete ...
A fully parallel architecture for the computation of a two-dimensional (2-D) discrete cosine transfo...
[[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 presents a fast algorithm along with its systolic array implementation for computing the ...
[[abstract]]A new systolic array without matrix transposition hardware is proposed to compute the tw...
[[abstract]]© 1997 Institute of Electrical and Electronics Engineers - The authors present a new fas...
[[abstract]]© 1994 Institute of Electrical and Electronics Engineers - In this paper, we propose a l...
[[abstract]]This paper presents a linear systolic array and a 2-D systolic array for computing the 1...
In this paper a new algorithm for computing N-point DCT, where N=4r, r>1 is presented. A new algorit...
In the paper: an efficient VLSI architecture for a 8x 8 two-dimensional discrete cosine transform an...
AbstractIn this paper, a recursive algorithm and two linear systolic architectures for realizing the...
IDCT (Inverse Discrete Cosine Transform) is a common algorithm being used with image and sound decom...
Abstract—Recursive algorithms have been found very effective for realization using software and very...
Abstract—A reduced-complexity convolutional formulation is presented for systolic implementation of ...
[[abstract]]In this paper, we propose two new VLSI architectures for computing the N-point discrete ...
A fully parallel architecture for the computation of a two-dimensional (2-D) discrete cosine transfo...
[[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 presents a fast algorithm along with its systolic array implementation for computing the ...
[[abstract]]A new systolic array without matrix transposition hardware is proposed to compute the tw...
[[abstract]]© 1997 Institute of Electrical and Electronics Engineers - The authors present a new fas...
[[abstract]]© 1994 Institute of Electrical and Electronics Engineers - In this paper, we propose a l...
[[abstract]]This paper presents a linear systolic array and a 2-D systolic array for computing the 1...
In this paper a new algorithm for computing N-point DCT, where N=4r, r>1 is presented. A new algorit...
In the paper: an efficient VLSI architecture for a 8x 8 two-dimensional discrete cosine transform an...
AbstractIn this paper, a recursive algorithm and two linear systolic architectures for realizing the...
IDCT (Inverse Discrete Cosine Transform) is a common algorithm being used with image and sound decom...
Abstract—Recursive algorithms have been found very effective for realization using software and very...
Abstract—A reduced-complexity convolutional formulation is presented for systolic implementation of ...
[[abstract]]In this paper, we propose two new VLSI architectures for computing the N-point discrete ...
A fully parallel architecture for the computation of a two-dimensional (2-D) discrete cosine transfo...