File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On low complexity robust beamforming with positive semidefinite constraints

TitleOn low complexity robust beamforming with positive semidefinite constraints
Authors
KeywordsConvex optimization
Minimax
Positive semidefinite constraint
Robust beamforming
Issue Date2009
PublisherIEEE
Citation
Ieee Transactions On Signal Processing, 2009, v. 57 n. 12, p. 4942-4945 How to Cite?
AbstractThis paper addresses the problem of robust beamforming for general-rank signal models with norm bounded uncertainties in the desired and received signal covariance matrices as well as positive semidefinite constraints on the covariance matrices. Two novel minimum variance robust beamformers are derived in closed-form. The first one basically is the closed-form version of an existing iterative algorithm, while the second one offers even better performance with respect to the first one. Both of them have the advantage of low complexity. The effectiveness and performance improvement of the proposed beamformers are verified by simulation results. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/73912
ISSN
2021 Impact Factor: 4.875
2020 SCImago Journal Rankings: 1.638
ISI Accession Number ID
Funding AgencyGrant Number
General Research FundHKU 7181/07E
HKU Seed Funding Programme200711159056
Funding Information:

Manuscript received December 22, 2008; accepted May 19, 2009. First published June 23, 2009; current version published November 18, 2009. The work was supported in part by the General Research Fund, Project No. HKU 7181/07E and by the HKU Seed Funding Programme, Project No. 200711159056. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Andreas Jakobsson.

References
Grants

 

DC FieldValueLanguage
dc.contributor.authorXing, Cen_HK
dc.contributor.authorMa, Sen_HK
dc.contributor.authorWu, YCen_HK
dc.date.accessioned2010-09-06T06:55:58Z-
dc.date.available2010-09-06T06:55:58Z-
dc.date.issued2009en_HK
dc.identifier.citationIeee Transactions On Signal Processing, 2009, v. 57 n. 12, p. 4942-4945en_HK
dc.identifier.issn1053-587Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/73912-
dc.description.abstractThis paper addresses the problem of robust beamforming for general-rank signal models with norm bounded uncertainties in the desired and received signal covariance matrices as well as positive semidefinite constraints on the covariance matrices. Two novel minimum variance robust beamformers are derived in closed-form. The first one basically is the closed-form version of an existing iterative algorithm, while the second one offers even better performance with respect to the first one. Both of them have the advantage of low complexity. The effectiveness and performance improvement of the proposed beamformers are verified by simulation results. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEEen_HK
dc.relation.ispartofIEEE Transactions on Signal Processingen_HK
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectConvex optimizationen_HK
dc.subjectMinimaxen_HK
dc.subjectPositive semidefinite constrainten_HK
dc.subjectRobust beamformingen_HK
dc.titleOn low complexity robust beamforming with positive semidefinite constraintsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1053-587X&volume=57&issue=12&spage=4942&epage=4945&date=2009&atitle=On+low+complexity+robust+beamforming+with+positive+semidefinite+constraintsen_HK
dc.identifier.emailMa, S: sdma@eee.hku.hken_HK
dc.identifier.emailWu, YC: ycwu@hkucc.hku.hken_HK
dc.identifier.authorityMa, S=rp00153en_HK
dc.identifier.authorityWu, YC=rp00195en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/TSP.2009.2025823en_HK
dc.identifier.scopuseid_2-s2.0-70450228524en_HK
dc.identifier.hkuros183146en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70450228524&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume57en_HK
dc.identifier.issue12en_HK
dc.identifier.spage4942en_HK
dc.identifier.epage4945en_HK
dc.identifier.isiWOS:000271958600030-
dc.publisher.placeUnited Statesen_HK
dc.relation.projectBayesian approach for Carrier frequency offsets estimation in OFDMA systems-
dc.identifier.scopusauthoridXing, C=35184311300en_HK
dc.identifier.scopusauthoridMa, S=8553949000en_HK
dc.identifier.scopusauthoridWu, YC=7406894786en_HK
dc.identifier.issnl1053-587X-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats