Michael T. Heideman

According to our database, Michael T. Heideman authored at least 9 papers between 1984 and 1992.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1992

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

Michael T. Heideman

IEEE Trans. Signal Process., 1992

1988

Multiplicative complexity, convolution, and the DFT.

Michael T. Heideman

PhD thesis, 1988

1987

Corrections to "Real-valued fast Fourier transform algorithms".

Henrik V. Sorensen, Douglas L. Jones, Michael T. Heideman, C. Sidney Burrus

IEEE Trans. Acoust. Speech Signal Process., 1987

Real-valued fast Fourier transform algorithms.

Henrik V. Sorensen, Douglas L. Jones, Michael T. Heideman, C. Sidney Burrus

IEEE Trans. Acoust. Speech Signal Process., 1987

1986

On computing the split-radix FFT.

Henrik V. Sorensen, Michael T. Heideman, C. Sidney Burrus

IEEE Trans. Acoust. Speech Signal Process., 1986

On the number of multiplications necessary to compute a length-2ⁿDFT.

Michael T. Heideman, C. Sidney Burrus

IEEE Trans. Acoust. Speech Signal Process., 1986

1985

On computing the discrete Hartley transform.

Henrik V. Sorensen, Douglas L. Jones, C. Sidney Burrus, Michael T. Heideman

IEEE Trans. Acoust. Speech Signal Process., 1985

Multiply/Add tradeoffs in length-2ⁿFFT algorithms.

Michael T. Heideman, C. Sidney Burrus

Proceedings of the IEEE International Conference on Acoustics, 1985

1984

Prime factor FFT algorithms for real-valued series.

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

Proceedings of the IEEE International Conference on Acoustics, 1984