File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Robust beamforming with magnitude response constraints using iterative second-order cone programming

TitleRobust beamforming with magnitude response constraints using iterative second-order cone programming
Authors
KeywordsAdaptive Beamforming
Linear And Arbitrary Arrays
Magnitude Response
Second-Order Cone Programming (SOCP)
Worst-Case Optimization
Issue Date2011
PublisherIEEE
Citation
IEEE Transactions on Antennas and Propagation, 2011, v. 59 n. 9, p. 3477-3482 How to Cite?
AbstractThe problem of robust beamforming for antenna arrays with arbitrary geometry and magnitude response constraints is one of considerable importance. Due to the presence of the non-convex magnitude response constraints, conventional convex optimization techniques cannot be applied directly. A new approach based on iteratively linearizing the non-convex constraints is then proposed to reformulate the non-convex problem to a series of convex subproblems, each of which can be optimally solved using second-order cone programming (SOCP). Moreover, in order to obtain a more robust beamformer against array imperfections, the proposed method is further extended by optimizing its worst-case performance using again SOCP. Different from some conventional methods which are restricted to linear arrays, the proposed method is applicable to arbitrary array geometries since the weight vector, rather than its autocorrelation sequence, is used as the variable. Simulation results show that the performance of the proposed method is comparable to the optimal solution previously proposed for uniform linear arrays, and it also gives satisfactory results under different array specifications and geometries tested. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/155654
ISSN
2015 Impact Factor: 2.053
2015 SCImago Journal Rankings: 2.130
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLiao, Ben_US
dc.contributor.authorTsui, KMen_US
dc.contributor.authorChan, SCen_US
dc.date.accessioned2012-08-08T08:34:41Z-
dc.date.available2012-08-08T08:34:41Z-
dc.date.issued2011en_US
dc.identifier.citationIEEE Transactions on Antennas and Propagation, 2011, v. 59 n. 9, p. 3477-3482en_US
dc.identifier.issn0018-926Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/155654-
dc.description.abstractThe problem of robust beamforming for antenna arrays with arbitrary geometry and magnitude response constraints is one of considerable importance. Due to the presence of the non-convex magnitude response constraints, conventional convex optimization techniques cannot be applied directly. A new approach based on iteratively linearizing the non-convex constraints is then proposed to reformulate the non-convex problem to a series of convex subproblems, each of which can be optimally solved using second-order cone programming (SOCP). Moreover, in order to obtain a more robust beamformer against array imperfections, the proposed method is further extended by optimizing its worst-case performance using again SOCP. Different from some conventional methods which are restricted to linear arrays, the proposed method is applicable to arbitrary array geometries since the weight vector, rather than its autocorrelation sequence, is used as the variable. Simulation results show that the performance of the proposed method is comparable to the optimal solution previously proposed for uniform linear arrays, and it also gives satisfactory results under different array specifications and geometries tested. © 2006 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE-
dc.relation.ispartofIEEE Transactions on Antennas and Propagationen_US
dc.rightsIEEE Transactions on Antennas and Propagation. Copyright © IEEE-
dc.rights©2011 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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectAdaptive Beamformingen_US
dc.subjectLinear And Arbitrary Arraysen_US
dc.subjectMagnitude Responseen_US
dc.subjectSecond-Order Cone Programming (SOCP)en_US
dc.subjectWorst-Case Optimizationen_US
dc.titleRobust beamforming with magnitude response constraints using iterative second-order cone programmingen_US
dc.typeArticleen_US
dc.identifier.emailTsui, KM:kmtsui@eee.hku.hken_US
dc.identifier.emailChan, SC:scchan@eee.hku.hken_US
dc.identifier.authorityTsui, KM=rp00181en_US
dc.identifier.authorityChan, SC=rp00094en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/TAP.2011.2161445en_US
dc.identifier.scopuseid_2-s2.0-80052611764en_US
dc.identifier.hkuros208536-
dc.identifier.hkuros193026-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80052611764&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume59en_US
dc.identifier.issue9en_US
dc.identifier.spage3477en_US
dc.identifier.epage3482en_US
dc.identifier.isiWOS:000294846300046-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLiao, B=44661377800en_US
dc.identifier.scopusauthoridTsui, KM=7101671591en_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats