Approximate Computation of DFT without Performing Any Multiplications: Applications to Radar Signal Processing
Computational Complexity
2014-02-05 v1
Abstract
In many practical problems it is not necessary to compute the DFT in a perfect manner including some radar problems. In this article a new multiplication free algorithm for approximate computation of the DFT is introduced. All multiplications in DFT are replaced by an operator which computes . The new transform is especially useful when the signal processing algorithm requires correlations. Ambiguity function in radar signal processing requires high number of multiplications to compute the correlations. This new additive operator is used to decrease the number of multiplications. Simulation examples involving passive radars are presented.
Cite
@article{arxiv.1402.0532,
title = {Approximate Computation of DFT without Performing Any Multiplications: Applications to Radar Signal Processing},
author = {Alican Bozkurt and Musa Tunç Arslan and Rasim Akin Sevimli and Cem Emre Akbas and A. Enis Çetin},
journal= {arXiv preprint arXiv:1402.0532},
year = {2014}
}