Efficient multiplier structure for realization of the discrete cosine transform

Abstract This paper presents an efficient serial–parallel multiplier algorithm that realizes the input data bit-serially, for implementation of the discrete cosine transform (DCT), which realizes the input data bit-serially. First, the DCT equation is split into a few groups of equations by using some mathematical techniques, and index tables are constructed to facilitate efficient data permutations. A new formulation of the DCT is then derived. Second, we represent the cosine coefficient in binary form and realize multiplications using a new serial–parallel multiplier architecture that results in a simple structure for VLSI realization.

[1]  F.J. Taylor,et al.  Multiplier policies for digital signal processing , 1990, IEEE ASSP Magazine.

[2]  G.S. Moschytz,et al.  Practical fast 1-D DCT algorithms with 11 multiplications , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[3]  Lap-Pui Chau,et al.  Direct formulation for the realization of discrete cosine transform using recursive structure , 1995 .

[4]  S.A. White,et al.  Applications of distributed arithmetic to digital signal processing: a tutorial review , 1989, IEEE ASSP Magazine.

[5]  Chein-Wei Jen,et al.  The efficient memory-based VLSI array designs for DFT and DCT , 1992 .

[6]  Nam Ik Cho,et al.  DCT algorithms for VLSI parallel implementations , 1990, IEEE Trans. Acoust. Speech Signal Process..

[7]  Ting Chen,et al.  VLSI implementation of a 16*16 discrete cosine transform , 1989 .

[8]  Ja-Ling Wu,et al.  Convolution-based DCT algorithm , 1991 .

[9]  A. N. SltODRAS,et al.  Split-radix fast cosine transform algorithm , 1993 .

[10]  Graham A. Jullien,et al.  Recursive algorithms for the forward and inverse discrete cosine transform with arbitrary length , 1994, IEEE Signal Processing Letters.

[11]  S. Sunder,et al.  Two's-complement fast serial-parallel multiplier , 1995 .

[12]  P. Duhamel,et al.  New 2nDCT algorithms suitable for VLSI implementation , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[13]  Trac D. Tran,et al.  Fast multiplierless approximations of the DCT with the lifting scheme , 2001, IEEE Trans. Signal Process..

[14]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[15]  M. Liou,et al.  A concurrent architecture for VLSI implementation of discrete cosine transform , 1987, IEEE Transactions on Circuits and Systems.

[16]  W. Siu,et al.  On the realization of discrete cosine transform using the distributed arithmetic , 1992 .

[17]  Zoran Cvetkovic,et al.  New fast recursive algorithms for the computation of discrete cosine and sine transforms , 1992, IEEE Trans. Signal Process..

[18]  B. Lee.  A new algorithm to compute the discrete cosine Transform , 1984 .

[19]  Lap-Pui Chau,et al.  Efficient implementation of discrete cosine transform using recursive filter structure , 1994, IEEE Trans. Circuits Syst. Video Technol..