Michael T. Heideman

Corrections to "Real-valued fast Fourier transform algorithms"

Douglas L. Jones, C. Sidney Burrus, Henrik V. Sorensen, 1987, IEEE Trans. Acoust. Speech Signal Process..

On the number of multiplications necessary to compute a length-2nDFT

C. Sidney Burrus, Michael T. Heideman, C. Burrus, 1986, IEEE Trans. Acoust. Speech Signal Process..

Multiplicative complexity, convolution, and the DFT

Michael T. Heideman, 1988 .

Real-valued fast Fourier transform algorithms

Douglas L. Jones, C. Sidney Burrus, Henrik V. Sorensen, 1987, IEEE Trans. Acoust. Speech Signal Process..

Prime factor FFT algorithms for real-valued series

C. Sidney Burrus, Howard W. Johnson, Michael T. Heideman, 1984, ICASSP.

Computation of an odd-length DCT from a real-valued DFT of the same length

Michael T. Heideman, M. Heideman, 1992, IEEE Trans. Signal Process..

On computing the discrete Hartley transform

Douglas L. Jones, C. Sidney Burrus, Henrik V. Sorensen, 1985, IEEE Trans. Acoust. Speech Signal Process..

On computing the split-radix FFT

C. Sidney Burrus, Henrik V. Sorensen, Michael T. Heideman, 1986, IEEE Trans. Acoust. Speech Signal Process..

Multiplicative Complexity of Linear and Bilinear Systems

Michael T. Heideman, 1988 .