Michael T. Heideman
Michael T. Heideman
Consultant
Zweryfikowany adres z siembramobile.com
Tytuł
Cytowane przez
Cytowane przez
Rok
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
6031987
Gauss and the history of the fast Fourier transform
M Heideman, D Johnson, C Burrus
IEEE ASSP Magazine 1 (4), 14-21, 1984
5611984
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
3691985
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
2981986
Gauss and the history of the fast Fourier transform
MT Heideman, DH Johnson, CS Burrus
Archive for history of exact sciences 34 (3), 265-277, 1985
2621985
Multiplicative complexity, convolution, and the DFT
MT Heideman, CS Burrus
Springer, 1988
1221988
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
981986
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
931992
Fast Fourier Transform: Database
HV Sorensen, CS Burrus, MT Heideman
PWS Publ., 1995
261995
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
191984
Multiply/Add tradeoffs in length-2nFFT algorithms
M Heideman, C Burrus
ICASSP'85. IEEE International Conference on Acoustics, Speech, and Signal …, 1985
101985
Multiplicative complexity of linear and bilinear systems
MT Heideman
Multiplicative Complexity, Convolution, and the DFT, 5-26, 1988
41988
A split-radix real-valued fast Fourier transform
HV Sorensen, MT Heideman, CS Burrus
Proc. 3rd Eur. Signal Processing Conf., 287-290, 1986
41986
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
T. Automated detection of naming errors in a street network database
M Heideman
ASPRS [ASP91], 724-729, 1991
11991
Applications of multiplicative complexity theory to convolution and the discrete fourier transform (fast, computational, digital filtering, signal processing, algorithms)
MT Heideman
Rice University, 1986
11986
Multiplicative Complexity of Discrete Fourier Transform
MT Heideman
Multiplicative Complexity, Convolution, and the DFT, 76-107, 1988
1988
Restricted and Constrained DFTs
MT Heideman
Multiplicative Complexity, Convolution, and the DFT, 108-118, 1988
1988
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20