Show simple item record

dc.contributor.authorRong, Yue
dc.contributor.editorYi Hong
dc.date.accessioned2017-01-30T10:29:22Z
dc.date.available2017-01-30T10:29:22Z
dc.date.created2012-02-12T20:00:43Z
dc.date.issued2011
dc.identifier.citationRong, Yue. 2011. Optimal Multicarrier Multi-Hop Non-Regenerative MIMO Relays with QoS Constraints, in Australian Communications Theory Workshop (AusCTW), Jan 31 - Feb 03 2011. Melbourne: IEEE.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/3200
dc.identifier.doi10.1109/AUSCTW.2011.5728745
dc.description.abstract

In this paper, we derive the optimal source and relay matrices of a multicarrier multi-hop multiple-input multiple-output (MIMO) relay system that guarantee the predetermined quality-of-service (QoS) criteria be attained with the minimal total transmission power. We consider the linear minimal mean-squared error (MMSE) receiver at the destination node and show that the solution to the original optimization problem can be upper-bounded by using a successive geometric programming (GP) approach and lower-bounded by utilizing a dual decomposition technique. Simulation results show that both bounds are tight, and to obtain the same QoS, the proposed MIMO relay system requires substantially less power than that of the suboptimal relay scheme.

dc.publisherIEEE
dc.titleOptimal Multicarrier Multi-Hop Non-Regenerative MIMO Relays with QoS Constraints
dc.typeConference Paper
dcterms.source.startPage100
dcterms.source.endPage105
dcterms.source.titleProceedings of the 2011 Australian Communications Theory Workshop
dcterms.source.seriesProceedings of the 2011 Australian Communications Theory Workshop
dcterms.source.isbn978-1-4244-9715-7
dcterms.source.conferenceThe 2011 Australian Communications Theory Workshop
dcterms.source.conference-start-dateJan 31 2011
dcterms.source.conferencelocationMelbourne
dcterms.source.placePiscataway, NJ, USA
curtin.departmentDepartment of Electrical and Computer Engineering
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record