Show simple item record

dc.contributor.authorJardak, Seifallah
dc.contributor.authorAhmed, Sajid
dc.contributor.authorAlouini, Mohamed-Slim
dc.date.accessioned2017-10-02T12:40:26Z
dc.date.available2013-11-26T13:02:21Z
dc.date.available2017-10-02T12:40:26Z
dc.date.issued2017-06-16
dc.identifier.citationJardak S, Ahmed S, Alouini M-S (2017) Low Complexity Moving Target Parameter Estimation for MIMO Radar Using 2D-FFT. IEEE Transactions on Signal Processing 65: 4745–4755. Available: http://dx.doi.org/10.1109/TSP.2017.2716910.
dc.identifier.issn1053-587X
dc.identifier.issn1941-0476
dc.identifier.doi10.1109/TSP.2017.2716910
dc.identifier.urihttp://hdl.handle.net/10754/305796
dc.description.abstractIn multiple-input multiple-output radar, to localize a target and estimate its reflection coefficient, a given cost function is usually optimized over a grid of points. The performance of such algorithms is directly affected by the grid resolution. Increasing the number of grid points enhances the resolution of the estimator but also increases its computational complexity exponentially. In this work, two reduced complexity algorithms are derived based on Capon and amplitude and phase estimation (APES) to estimate the reflection coefficient, angular location and, Doppler shift of multiple moving targets. By exploiting the structure of the terms, the cost-function is brought into a form that allows us to apply the two-dimensional fast-Fourier-transform (2D-FFT) and reduce the computational complexity of estimation. Using low resolution 2D-FFT, the proposed algorithm identifies sub-optimal estimates and feeds them as initial points to the derived Newton gradient algorithm. In contrast to the grid-based search algorithms, the proposed algorithm can optimally estimate on- and off-the-grid targets in very low computational complexity. A new APES cost-function with better estimation performance is also discussed. Generalized expressions of the Cramér-Rao lower bound are derived to asses the performance of the proposed algorithm.
dc.description.sponsorshipThis paper is an extended version of the work presented in the International Radar Conference, Lille, France, Oct. 2014. This work was funded by a CRG grant from the KAUST Office of Competitive Research Fund (OCRF).
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttp://ieeexplore.ieee.org/document/7950963/
dc.rights(c) 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
dc.subjectComputational complexity
dc.subjectCramér-Rao lower bound
dc.subjectDoppler shift
dc.subjectDoppler shift
dc.subjectEstimation
dc.subjectFrequency estimation
dc.subjectMIMO radar
dc.subjectMIMO-radar
dc.subjectReflection coefficient
dc.subjectSignal processing algorithms
dc.subjectSpatial location
dc.subjecttwo-dimensional fast-Fourier-transform
dc.titleLow Complexity Moving Target Parameter Estimation for MIMO Radar using 2D-FFT
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.identifier.journalIEEE Transactions on Signal Processing
dc.eprint.versionPost-print
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)
kaust.personJardak, Seifallah
kaust.personAhmed, Sajid
kaust.personAlouini, Mohamed-Slim
refterms.dateFOA2018-06-13T20:14:23Z
dc.date.published-online2017-06-16
dc.date.published-print2017-09-15


Files in this item

Thumbnail
Name:
07950963.pdf
Size:
1.023Mb
Format:
PDF
Description:
Accepted manuscript

This item appears in the following Collection(s)

Show simple item record

VersionItemEditorDateSummary

*Selected version