Moment-based fast discrete sine transforms

This paper presents a novel approach to compute discrete sine transforms (DSTs). By using a modular mapping, DSTs are approximated by the sum of a finite sequence of discrete moments. Hence, by extending our earlier technique in computing moments with an adder network only, DSTs can also be implemented easily by a systolic array primarily involving additions. The method can be applied to multidimensional DSTs as well as their inverses.published_or_final_versio

A Novel Approach to Fast Discrete Fourier Transform

Discrete Fourier transform (DFT) is an important tool in digital signal processing. In the present paper, we propose a novel approach to performing DFT. We transform DFT into a form expressed in discrete moments via a modular mapping and truncating Taylor series expansion. From this, we extend the use of our systolic array for fast computation of moments without any multiplications to one that computes DFT with only a few multiplications and without any evaluations of exponential functions. The multiplication number used in our method isO(Nlog2N/ log2log2N) superior toO(Nlog2N) in FFT. The execution time of the systolic array is onlyO(Nlog2N/ log2log2N) for 1-D DFT andO(Nk) fork-D DFT (k≥2). The systolic implementation is a demonstration of the locality of dataflow in the algorithms and hence it implies an easy and potential hardware/VLSI realization. The approach is also applicable to DFT inverses. © 1998 Academic Press