Prime factor FFT algorithms for real-valued series. - Michael T. Heideman; C. Sidney Burrus; Howard W. Johnson (ICASSP, 1984)

Multiply/Add tradeoffs in length-2nFFT algorithms. - Michael T. Heideman; C. Sidney Burrus (ICASSP, 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)

On the number of multiplications necessary to compute a length-2nDFT. - Michael T. Heideman; C. Sidney Burrus (IEEE Trans. Acoust. Speech Signal Process., 1986)

On computing the split-radix FFT. - Henrik V. Sorensen; Michael T. Heideman; C. Sidney Burrus (IEEE Trans. Acoust. Speech Signal Process., 1986)

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)

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)

Multiplicative complexity, convolution, and the DFT. - Michael T. Heideman (Springer, 1988)

Computation of an odd-length DCT from a real-valued DFT of the same length. - Michael T. Heideman (IEEE Trans. Signal Process., 1992)