A fast algorithm for computing a complex-number theoretic transform for long sequences

DOI10.1109/TASSP.1981.1163514zbMATH Open0523.65096OpenAlexW2155740548MaRDI QIDQ3674015FDOQ3674015

Authors: Boonsieng Benjauthrit, Chialin Wu, I. S. Reed, Trieu-Kien Truong 

Publication date: 1981

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tassp.1981.1163514

zbMATH Keywords

discrete Fourier transformlong sequencescomplex-number theoretic transformconvolution of two sequencesfast Fourier-like transformmatched-filter correlation of raw radar-echo data

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)

This page was built for publication: A fast algorithm for computing a complex-number theoretic transform for long sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674015)