摘要: On presente un algorithme de calcul d’une transformation Fourier discrete adaptee aux signaux reels. Cet permet sur place la transformee et sa structure a base 4 ne necessite pas reordonnancement chaque etage. De plus, il se prete bien l’analyse spectrale (calcul periodogramme) ponderes par des fenetres type Hamming.
springer.com
sci-hub.se 参考文章(6)
R.N. Bracewell, The fast Hartley transform Proceedings of the IEEE. ,vol. 72, pp. 1010- 1018 ,(1984) , 10.1109/PROC.1984.12968
R. N. Bracewell, Discrete Hartley transform Journal of the Optical Society of America. ,vol. 73, pp. 1832- 1835 ,(1983) , 10.1364/JOSA.73.001832
Martin Vetterli, member Eurasip, Henri J. Nussbaumer, Simple FFT and DCT algorithms with reduced number of operations Signal Processing. ,vol. 6, pp. 267- 278 ,(1984) , 10.1016/0165-1684(84)90059-8
P. Duhamel, H. Hollmann, `Split radix' FFT algorithm Electronics Letters. ,vol. 20, pp. 14- 16 ,(1984) , 10.1049/EL:19840012
J.-B. Martens, Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 32, pp. 750- 761 ,(1984) , 10.1109/TASSP.1984.1164395
P. Duhamel, H. Hollmann, Implementation of "Split-radix" FFT algorithms for complex, real, and real symmetric data international conference on acoustics, speech, and signal processing. ,vol. 10, pp. 784- 787 ,(1985) , 10.1109/ICASSP.1985.1168332