Showing papers by "Russell M. Mersereau published in 1980"
01 Apr 1980
TL;DR: This paper presents a comparison of two-dimensional finite area impulse response (FIR) digital filters designed using three popular design methodologies - through the use of windows, through theUse of transformations of one-dimensional designs, and through theuse of optimal Chebyshev design techniques.
Abstract: This paper presents a comparison of two-dimensional finite area impulse response (FIR) digital filters designed using three popular design methodologies - through the use of windows, through the use of transformations of one-dimensional designs, and through the use of optimal Chebyshev design techniques. In addition the comparison includes filters designed for processing both rectangularly-sampled and hexagonally-sampled data. The filters are compared with respect to ease of design and the efficiency of the resulting implementation.
4 citations
01 Jan 1980
TL;DR: This paper will first derive a generalized discrete Fourier transform, then derive the general Cooley-Tukey algorithm, and conclude by interpreting existing multi-dimensional FFT algorithms in terms of the generalized one.
Abstract: In this paper the Cooley-Tukey fast Fourier transform (FFT) algorithm is generalized to the multi-dimensional case in a natural way that incorporates the standard row-column and vector-radix algorithms as special cases. It can be used for the evaluation of discrete Fourier transforms of rectangularly or hexagonally sampled signals or signals which are arbitrarily sampled in either the spatial or Fourier domain. These fast Fourier transform algorithms are shown to result from the factorization of an integer matrix; different algorithms correspond to different factorizations. This paper will first derive a generalized discrete Fourier transform, then derive the general Cooley-Tukey algorithm, and conclude by interpreting existing multi-dimensional FFT algorithms in terms of the generalized one.
1 citations