Notch fourier transform

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 35, Issue 9, 1987, Pages 1282-1288

  Tadokoro, Yoshiaki ^a   Abe, Kenichi ^a  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES; MATHEMATICAL TRANSFORMATIONS - FOURIER TRANSFORMS;

COMPUTATIONAL ACCURACY; NOTCH FOURIER TRANSFORM (NFT);

SIGNAL PROCESSING;

EID: 0023421706     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1987.1165281     Document Type: Article

References (7)

1. A. V. Oppenheim and R. W. Schafer, Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
2. L. R. Rabinier and B. Gold, Theory and Application of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
3. D. F. Elliot and K. R. Rao, Fast Transform Algorithm. Analysis, Applications. New York: Academic, 1982.
4. G. H. Hostetter, “Recursive discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-23, pp. 184–190, Apr. 1980.
5. R. Sudhakar, R. C. Agarwal, and S. C. D. Roy, “Fast computation of Fourier transform at arbitrary frequencies,” IEEE Trans. Circuits Syst., vol. CAS-28, pp. 972–980, Oct. 1981.
6. F. Q. Braun, “Nonrecursive digital filters for detecting multifrequency code signals,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-23, pp. 250–256, June 1975.
7. H. Togawa, Calculation Methods. Japan: Corona, 1981, p. 123.