Please use this identifier to cite or link to this item: https://doi.org/10.1109/TSP.2011.2107906
DC FieldValue
dc.titleOn design of collaborative beamforming for two-way relay networks
dc.contributor.authorZeng, M.
dc.contributor.authorZhang, R.
dc.contributor.authorCui, S.
dc.date.accessioned2014-10-07T04:33:44Z
dc.date.available2014-10-07T04:33:44Z
dc.date.issued2011-05
dc.identifier.citationZeng, M., Zhang, R., Cui, S. (2011-05). On design of collaborative beamforming for two-way relay networks. IEEE Transactions on Signal Processing 59 (5) : 2284-2295. ScholarBank@NUS Repository. https://doi.org/10.1109/TSP.2011.2107906
dc.identifier.issn1053587X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/82807
dc.description.abstractThis paper studies the achievable rate region for an amplify-and-forward (AF)-based two-way relay network with collaborative beamforming. With different assumptions of channel reciprocity between the source-relay and relay-source channels, the achievable rate region is characterized under two setups. First, with reciprocal channels, we investigate the achievable rate regions when the relay cluster is subject to a sum-power constraint or individual-power constraints. We show that the optimal beamforming vectors obtained from solving the weighted sum inverse-SNR minimization (WSISMin) problems are sufficient to characterize the corresponding achievable rate region. Furthermore, we derive the closed-form solutions for those optimal beamforming vectors and consequently propose the partially distributed algorithms to implement the optimal beamforming, where each relay node only needs the local channel information and one global parameter. Second, with the nonreciprocal channels, the achievable rate regions are also characterized for both the sum-power constraint case and the individual-power constraint case. Although no closed-form solutions are available under this setup, we present efficient numerical algorithms by solving a sequence of semi-definite programming (SDP) problems after semi-definite relaxation(SDR), where the optimal beamformer can be obtained under the sum-power constraint and approximate optimal solutions can be obtained under the individual power constraints. © 2011 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TSP.2011.2107906
dc.sourceScopus
dc.subjectAchievable rate region
dc.subjectcollaborative beamforming
dc.subjectPareto optimal
dc.subjectsemi-definite programming (SDP)
dc.subjectsemi-definite relaxation (SDR)
dc.subjecttwo-way relay
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/TSP.2011.2107906
dc.description.sourcetitleIEEE Transactions on Signal Processing
dc.description.volume59
dc.description.issue5
dc.description.page2284-2295
dc.description.codenITPRE
dc.identifier.isiut000289475800029
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.