2009 IEEE International Conference on Acoustics, Speech and Signal Processing 2009
DOI: 10.1109/icassp.2009.4960074
|View full text |Cite
|
Sign up to set email alerts
|

Optimal network beamforming for bi-directional relay networks

Abstract: We consider a relay network which consists of two transceivers and r relay nodes. We study a half-duplex two-way relaying scheme. First, the two transceivers transmit their information symbols simultaneously and the relays receive a noisy mixture of the two transceiver signals. Then each relay adjusts the phase and the amplitude of its received signal by multiplying it with a complex beamforming coefficient and transmits the so-obtained signal. Aiming at optimally calculating the beamforming weight vector as w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
6
1

Relationship

4
3

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 8 publications
(6 reference statements)
0
9
0
Order By: Relevance
“…In (35), α (k) and κ are the value of α at the kth iteration and the convergence-stability trade-off parameter, respectively. It follows from (20) and (34) that obtaining the matrix D(α) and the gradient vectorg(α) requires the calculation of four terms, namely α T D1α, α T D2α, α T α, and (8). It has been shown in [8] that as the SNR constraints in (36) are symmetric, the relay transmit power is half of the P min T =P at the optimum and the proof is complete.…”
Section: Lemma 1: the Optimization Problem (19) Does Not Have Any Locmentioning
confidence: 95%
See 3 more Smart Citations
“…In (35), α (k) and κ are the value of α at the kth iteration and the convergence-stability trade-off parameter, respectively. It follows from (20) and (34) that obtaining the matrix D(α) and the gradient vectorg(α) requires the calculation of four terms, namely α T D1α, α T D2α, α T α, and (8). It has been shown in [8] that as the SNR constraints in (36) are symmetric, the relay transmit power is half of the P min T =P at the optimum and the proof is complete.…”
Section: Lemma 1: the Optimization Problem (19) Does Not Have Any Locmentioning
confidence: 95%
“…It follows from (20) and (34) that obtaining the matrix D(α) and the gradient vectorg(α) requires the calculation of four terms, namely α T D1α, α T D2α, α T α, and (8). It has been shown in [8] that as the SNR constraints in (36) are symmetric, the relay transmit power is half of the P min T =P at the optimum and the proof is complete. Note that we assume that the two transceivers use the iterative algorithm in (35) to calculate the optimal value of α, say αo.…”
Section: Lemma 1: the Optimization Problem (19) Does Not Have Any Locmentioning
confidence: 95%
See 2 more Smart Citations
“…We also assume that information symbols have unit power, i.e., Efjs 1 j 2 g = Efjs 2 j 2 g = 1. Total Transmit Power Minimization: We now summarize the total power minimization approach as studied in [1] and [13]. In this approach, the beamforming weights w and the transceivers' transmit powers p 1 and p 2 are obtained such that the total transmit power consumed in the whole network (denoted as P T ) is minimized while maintaining the received SNRs at both transceivers above certain levels 1 > 0 and 2 > 0, respectively.…”
Section: Preliminariesmentioning
confidence: 99%