Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms
- 712 Downloads
This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope of a recursive operation. When tackling the design level, the method shows suitable for developing a processor which achieves a satisfying trade-off between time delay, area costs, and stability. The method is particularly suitable for the mathematical transforms used in signal processing applications. A generic calculation scheme is developed for the discrete fast Fourier transform (DFT) and then applied to other integral transforms such as the discrete Hartley transform (DHT), the discrete cosine transform (DCT), and the discrete sine transform (DST). Some comparisons with other well-known proposals are also provided.
KeywordsFourier Transform Time Delay Information Technology Signal Processing Sine
- 11.Wang C-L, Chang C-H: A DHT-based FFT/IFFT processor for VDSL transceivers. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '01), May 2001, Salt Lake, Utah, USA 2: 1213–1216.Google Scholar
- 12.Fang W-H, Wu M-L: An efficient unified systolic architecture for the computation of discrete trigonometric transforms. Proceedings of IEEE International Symposium on Circuits and Systems (ISCAS '97), June 1997, Hong Kong 3: 2092–2095.Google Scholar
- 26.Pennebaker WB, Mitchell JL: JPEG Still Image Data Compression Standard. Van Nostrand Reinhold, New York, NY, USA; 1993.Google Scholar
- 27.Shi YQ, Sun H: Image and Video Compression for Multimedia Engineering. CRC Press, Boca Raton, Fla, USA; 2000.Google Scholar
- 28.Duhamel P, Guillemot C: Polynomial transform computation of the 2-D DCT. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '90), April 1990, Albuquerque, NM, USA 3: 1515–1518.Google Scholar
- 36.Chien-Chang L, Chih-Da Ch, Guo JI: A parameterized hardware design for the variable length discrete Fourier transform. Proceedings of the 15th International Conference on VLSI Design (VLSID '02), August 2002, Taiwan, ChinaGoogle Scholar
- 38.Fang W-H, Wu M-L: An efficient unified systolic architecture for the computation of discrete trigonometric transforms. Proceedings of IEEE International Symposium on Circuits and Systems (ISCAS '97), June 1997, Hong Kong 3: 2092–2095.Google Scholar
- 43.Wang JL, Wu CB, Liu D-B, Yang J-F: Recursive architecture for realizing modified discrete cosine transform and its inverse. Proceedings of IEEE Workshop on Signal Processing Systems (SIPS '99), October 1999, Taipei, Taiwan 120–130.Google Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://doi.org/creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.