Show simple item record

dc.contributor.authorAli, Hussain
dc.contributor.authorAhmed, S.
dc.contributor.authorSharawi, Mohammad S.
dc.contributor.authorAlouini, Mohamed-Slim
dc.contributor.authorAl-Naffouri, Tareq Y.
dc.date.accessioned2019-10-03T07:42:04Z
dc.date.available2019-10-03T07:42:04Z
dc.date.issued2019-09-02
dc.identifier.citationAli, H., Ahmed, S., Sharawi, M. S., Alouini, M.-S., & Al-Naffouri, T. Y. (2020). Reduced complexity DOA and DOD estimation for a single moving target in bistatic MIMO radar. Signal Processing, 166, 107276. doi:10.1016/j.sigpro.2019.107276
dc.identifier.doi10.1016/j.sigpro.2019.107276
dc.identifier.urihttp://hdl.handle.net/10754/656849
dc.description.abstractIn this work, we propose a reduced dimension and low complexity algorithm to estimate the direction-of-arrival (DOA), direction-of-departure (DOD) and the Doppler shift of a moving target for a multiple-input-multiple-output (MIMO) radar. We derive two cost functions based on two different objective functions. We solve each of the derived cost function with a low complexity fast-Fourier-transform (FFT)-based solution in three dimensions. We further carry out a derivation to reduce the three-dimensional search to two-dimensional (2D) search and solve it with a 2D-FFT. Another reduced dimension algorithm is derived using the generalized eigenvalue method which finds the estimate of unknown parameters in one dimension with less memory constraints. This way, we propose three algorithms based on the first cost function and another three algorithms based on the second. Simulation results are used to validate the proposed algorithms. We compare the mean-square-error (MSE) performance and computational complexity of our proposed algorithms with existing ones as well. We show that our proposed algorithms have better MSE performance than existing ones and achieves the Cramér-Rao lower bound (CRLB) for all unknown target parameters. The proposed algorithms exhibit lower computational complexity than the existing ones and also provide an estimate for the Doppler shift.
dc.description.sponsorshipThe authors would like to acknowledge the support of this work by KAUST's Office of Sponsored Research under Award No. OSR-2016-KKI-2899.
dc.publisherElsevier BV
dc.relation.urlhttps://linkinghub.elsevier.com/retrieve/pii/S0165168419303305
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Signal Processing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Signal Processing, [[Volume], [Issue], (2019-09-02)] DOI: 10.1016/j.sigpro.2019.107276 . © 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectBistatic MIMO radar
dc.subjectDirection-of-arrival (DOA)
dc.subjectDirection-of-departure (DOD)
dc.subjectDoppler shift
dc.titleReduced complexity DOA and DOD estimation for a single moving target in bistatic MIMO radar
dc.typeArticle
dc.contributor.departmentElectrical Engineering Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalSignal Processing
dc.rights.embargodate2021-09-02
dc.eprint.versionPost-print
dc.contributor.institutionDepartment of Electrical Engineering, College of Signals, National University of Sciences and Technology, Rawalpindi, Pakistan
dc.contributor.institutionElectrical Engineering Department, Information Technology University, Lahore, Pakistan
dc.contributor.institutionElectrical Engineering Department and Poly-Grames Research Center, Polytechnique Montréal, Montréal QC H3T 1J4, Canada
kaust.personAlouini, Mohamed-Slim
kaust.personAl-Naffouri, Tareq Y.
kaust.grant.numberOSR-2016-KKI-2899.
kaust.acknowledged.supportUnitOffice of Sponsored Research
dc.date.published-online2019-09-02
dc.date.published-print2020-01


This item appears in the following Collection(s)

Show simple item record