|
[1] A. V. Oppenheim, ”Applications of Digital Signal Processing.” Engle-wood Cliffs, NJ:Prentic-Hall, 1978.[2] ETS 300 401 “Radio broacasting system; Digital Audio Broadcasting(DAB) to mobile,portable and fixed receivers,”MAy 1997.[3] H. T. Kung, “Why systolic architectures?,” Computer, vol.15, pp.37-46, Jan. 1982.[4] L.-W Chang and M.-Y. Wu, “A new systolic array for discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 36, pp.1165—1167, Oct. 1988.[5] J. A. Beraldin, T. Aboulnasr, and W. Steenaart, “Efficient one-dimensional systolic array realization of discrete Fourier transform,” IEEE Trans. Circuits Syst., vol. 36, pp. 95—100, Jan. 1989.[6] N. R. Murphy and M. N. S. Swamy, “On the real-time computation of DFT and DCT through systolic architecture,” IEEE Trans. Signal Processing, vol. 42, pp. 988—991, Apr. 1993.[7] J. Choi and V.Boriakoff, “A new linear systolic array for FFT computation,”IEEE Trans. Circuits Syst. II, vol. 39, pp.236—239, Apr. 1992.[8] V.Boriakoff, “FFT computation with systolic arrays,a new architecture,” IEEE Trans. Circuits Syst. II, vol. 41, pp. 278—284, Apr.1994.[9] E.Bidet,D. Castelain,C. Joanblang, and P. Senn, “A fast single-chip implementation of 8192 complex point FFT,” IEEE Journal of Solid-State Circuits, Vol. 30,No.3,pp.300-305,March 1995.[10] S. He and M. Torkelson, “Design and implementation of a 1024-point pipeline FFT processor,” in Proc. IEEE Custom Intergrated Circuits Conference,pp.131-134,1998[11] S.R.Malladi, S.R. Myneni, P.V. Pothana, and M.A.Bayoumi, ”A High Speed Pipelined FFT Processor,” in Proc. International Conference on Acoustics,Speech,and Signal Processing, Vol 3 ,pp.1609-1612,1991.[12] S. F. Hsiao and C. Y. Yen, “Power, speed and area comparison of several new DFT architectures,”in Proc. IEEE Int. Symp. Circuits Syst., Hong Kong, June 1997, pp. 2577—2580.[13] B.M. Bass, ”A 9.5mW 330usec 1024-point FFT Processor,” in Proc. IEEE Custom Intergrated Circuits Conference, pp.127-130,1998.[14] C. Ediz,M.Richard,and C.S. Kale, ”A integrated 256-point complexFFT processor for real-time specturm analysis and measurement, ” in Proc.IEEE Instrumentation and Measurement Technology Conference, pp.96-101,1997.[15] Chang Ching-Hsien,Wang Chin-Liang,and Chang Yu-Tai, "Efficient VLSI Architectutres for Fast Computation of the Discrete Fourier Transform and Its Inverse," IEEE Trans on Signal Processing, vol. 48, NO.11, pp.3206-3216, Nov. 2000[16] N. Ahmed, T. Natarajan, and K. R. Rao, “Discrete cosine transform,” IEEE Trans. Comput., vol. C-23, pp. 90-93, Jan. 1974.[17] H. S. Hou, “A fast recursive algorithm for computing the discrete consine transform,” IEEE Trans. Acoust., Speech,Signal Processing, vol. ASSP35, pp.1455-1461,Mar. 1987.[18] Cvetkovic Z. and Popovic M. V., “New Fast Recursive Algorithm for Computation of Discrete Consine and Sine Transforms, ”IEEE Trans.Signal Processing, vol.40, No.5, pp.2083-2086, Aug. 1992.[19] Hsiao S.F.,Shiue W. R.and Tseng J.M., ”Design and implementationof a novel linear-array DCT/IDCT processor with complexity of order log2 N,” IEE Proceedings-Vision, Image and Signal Processing, vol.147, No.5, pp.400-408,Oct 2000. [20] Agostini, L.V.; Silva, I.S.; Bampi, S. “Pipelined fast 2D DCT architecture for JPEG image compression,” IEEE Ingegrated Circuits and Systems Design, pp.226-231, 2001 [21] Wolter, S.; Birreck, D.; Laur, R. ”Classification for 2D-DCTs and a new architecture with distributed arithmetic,” IEEE Circuits and Systems, vol.4, pp.2204-2207,1991.[22] Wolter, S.; Birreck, D.; Heine, M.; Laur, R. ”Parallel architectures for 8*8 discrete cosine transforms,” IEEE Circuits and Systems, vol.1, pp.149-152,1992.[23] Mohd-Yusof, Z.; Suleiman, I.; Aspar, Z.”Implementation of two dimensional forward DCT and inverse DCT using FPGA,” IEEE TENCON 2000. Proceedings, pp.242-245, vol.3,2000 [24] Hyesook Lim; Swartzlander, E.E., Jr. “A systolic array for 2-D DFT and 2-D DCT,“ IEEE Application Specific Array Processors, 1994. Proceedings. International Conference on ,pp.123-131,1994
|