2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers 2009
DOI: 10.1109/acssc.2009.5470108
|View full text |Cite
|
Sign up to set email alerts
|

Distributed gain matrix optimization in non-regenerative MIMO relay networks

Abstract: We consider a half-duplex multiple-input multipleoutput relay network with multiple source and relay nodes and a set of collocated destination antennas. Each relay is equipped with multiple antennas and is constrained to map its receive signal linearly to its transmit signal. We devise a gradient based scheme that enables each relay to locally optimize its gain matrix with respect to the achievable sum-rate without requiring explicit knowledge of all fading coefficients characterizing the channel state. In par… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 5 publications
0
9
0
Order By: Relevance
“…We obtain a solution by applying a modified version of the gradient based algorithm presented in [10], where decentralized relay gain allocation has been employed in a communications context. We can accordingly calculate the complex gradient of the norm in (10) Here, 0* denotes the complex conjugate, OR is the Henni tian transposition, and Ek is a matrix with all zeros except for a one on the kth diagonal position.…”
Section: Iterative Gain Allocation With Reduced Feedbackmentioning
confidence: 99%
“…We obtain a solution by applying a modified version of the gradient based algorithm presented in [10], where decentralized relay gain allocation has been employed in a communications context. We can accordingly calculate the complex gradient of the norm in (10) Here, 0* denotes the complex conjugate, OR is the Henni tian transposition, and Ek is a matrix with all zeros except for a one on the kth diagonal position.…”
Section: Iterative Gain Allocation With Reduced Feedbackmentioning
confidence: 99%
“…The optimization problem can be stated formally as: For solving the optimization problem in (19), we use a gradient-search algorithm similar to the one in [15]. Due to the different power constraint, the Jacobian matrix in [15] is modified to incorporate (15).…”
Section: Af Relayingmentioning
confidence: 99%
“…7, the antenna separation distances at the relay and at the destination are 0.1λ. For reference, we plotted the rates given that the relay uses spatially white transmission, i.e.Ĝ = cI NS , where c is selected to satisfy the relay power constraint in (15).…”
Section: Effect Of Ignoring Noise Correlationmentioning
confidence: 99%
See 2 more Smart Citations