Michael T. Heideman
Michael T. Heideman
Consultant
Verified email at siembramobile.com
Title
Cited by
Cited by
Year
Real-valued fast Fourier transform algorithms
HV Sorensen, D Jones, M Heideman, C Burrus
IEEE Transactions on acoustics, speech, and signal processing 35 (6), 849-863, 1987
5491987
Gauss and the history of the fast Fourier transform
M Heideman, D Johnson, C Burrus
IEEE ASSP Magazine 1 (4), 14-21, 1984
4651984
On computing the discrete Hartley transform
H Sorensen, D Jones, C Burrus, M Heideman
IEEE Transactions on Acoustics, Speech, and Signal Processing 33 (5), 1231-1238, 1985
3591985
On computing the split-radix FFT
HV Sorensen, M Heideman, C Burrus
IEEE Transactions on Acoustics, Speech, and Signal Processing 34 (1), 152-156, 1986
2731986
Gauss and the history of the fast Fourier transform
MT Heideman, DH Johnson, CS Burrus
Archive for history of exact sciences, 265-277, 1985
2211985
Multiplicative complexity, convolution, and the DFT
MT Heideman, CS Burrus
Springer, 1988
1101988
On the number of multiplications necessary to compute a length-2nDFT
M Heideman, C Burrus
IEEE transactions on acoustics, speech, and signal processing 34 (1), 91-95, 1986
941986
Computation of an odd-length DCT from a real-valued DFT of the same length
MT Heideman
IEEE Transactions on signal processing 40 (1), 54-61, 1992
911992
A note on the convergence analysis of LMS adaptive filters with Gaussian data
JB Foley, FM Boland
IEEE Transactions on Acoustics, Speech, and Signal Processing 36 (7), 1087-1089, 1988
361988
Fast Fourier Transform: Database
HV Sorensen, CS Burrus, MT Heideman
PWS Publ., 1995
241995
Prime factor FFT algorithms for real-valued series
M Heideman, C Burrus, H Johnson
ICASSP'84. IEEE International Conference on Acoustics, Speech, and Signal …, 1984
211984
Multiply/Add tradeoffs in length-2nFFT algorithms
M Heideman, C Burrus
ICASSP'85. IEEE International Conference on Acoustics, Speech, and Signal …, 1985
91985
A split-radix real-valued fast Fourier transform
HV Sorensen, MT Heideman, CS Burrus
Proc. 3rd Eur. Signal Processing Conf., 287-290, 1986
51986
Building Digital Maps for Pathfinding
G Angwin, M Heideman
Surface Transportation: Mobility, Technology, and Society. Proceedings of …, 1993
21993
Data capture and quality control of digital map databases supporting pathfinding
MT Heideman, GT Angwin
GIS LIS-INTERNATIONAL CONFERENCE- 1, 314-314, 1992
21992
Convolution and Polynomial Multiplication
MT Heideman
Multiplicative Complexity, Convolution, and the DFT, 27-60, 1988
21988
Applications of multiplicative complexity theory to convolution and the discrete fourier transform (fast, computational, digital filtering, signal processing, algorithms)
MT Heideman
21986
T. Automated detection of naming errors in a street network database
M Heideman
ASPRS [ASP91], 724-729, 1991
11991
SUPPORTING PATHFINDING
MT Heideman
GIS/LIS Annual Conference and Exposition Proceedings 1, 314, 1990
1990
Multiplicative Complexity of Discrete Fourier Transform
MT Heideman
Multiplicative Complexity, Convolution, and the DFT, 76-107, 1988
1988
The system can't perform the operation now. Try again later.
Articles 1–20