Approximate computation of DFT without performing any multiplications: application to radar signal processing
Date
2014
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
3
views
views
27
downloads
downloads
Citation Stats
Series
Abstract
In many radar problems it is not necessary to compute the ambiguity function in a perfect manner. In this article a new multiplication free algorithm for approximate computation of the ambiguity function is introduced. All multiplications (a × b) in the ambiguity function are replaced by an operator which computes sign(a × b)(a + b). The new transform is especially useful when the signal processing algorithm requires correlations. Ambiguity function in radar signal processing requires high number of correlations and DFT computations. This new additive operator enables an approximate computation of the ambiguity function without requiring any multiplications. Simulation examples involving passive radars are presented.
Source Title
Proceedings of the 22nd Signal Processing and Communications Applications Conference, SIU 2014
Publisher
IEEE
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
Turkish