On the performance of distributed space-time coding systems with one and two non-regenerative relays

Anghel, P.A.; Kaveh, M.

doi:10.1109/twc.2006.1611099

Cited by 93 publications

(33 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…None of the above pioneer work allow relays to adaptively adjust their transmit powers according to channel magnitude information, and this is exactly the concern of this paper. Several related work can be found in [13][14][15][16][17].…”

Section: Introductionmentioning

confidence: 99%

Network Beamforming using Relays with Perfect Channel Information

Jing

Jafarkhani

2007

2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07

214

294

View full text Add to dashboard Cite

This paper is on beamforming in wireless relay networks with perfect channel information at the receiver and relays. It is assumed that every node in the network has its own power constraint. An amplify-and-forward protocol is used. Relays use not only the channel direction information to form a beam at the receiver but also the channel strength information to adaptively adjust their transmit powers. Our results show that the optimal power used at a relay is not a binary function. It can take any value between zero and its maximal transmit power. Also, surprisingly, this value depends on the quality of all other channels in addition to the relay's own channels.Index Terim-Wireless relay network, power control, beamforming, amplify-and-forward

show abstract

Section: Introductionmentioning

confidence: 99%

Network Beamforming using Relays with Perfect Channel Information

Jing

Jafarkhani

2007

2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07

214

294

View full text Add to dashboard Cite

show abstract

“…The capacity of various TDMA-based relaying protocols in a system with one source, relay and destination was analyzed in [7]. A distributed space-time coding technique was proposed for a system with one or two assisting relays in [8,9]. It was shown that this design achieves a diversity gain over a point-to-point system with the same bandwidth.…”

Section: Introductionmentioning

confidence: 99%

Cooperative Subcarrier Allocation for an OFDM Relaying System with Grouped Users

Rasouli

Anpalagan

2010

Wireless Pers Commun

View full text Add to dashboard Cite

In this article, the problem of downlink subcarrier allocation in a cooperative wireless multiuser OFDM system is investigated. We consider a single-cell where all the users are paired in cooperative groups. The mobile users in each group amplify and forward their partner's data stream using a time division protocol. Based on the capacity contribution from the relaying terminal, a new parameter called cooperation coefficient is introduced as a function of the relaying subchannel. This parameter is used to modify the objective parameter of the subcarrier allocation procedure. Fairness-oriented and throughput-oriented algorithms are selected from the literature to test the proposed technique. Both algorithms are modified to employ the mean of cooperation coefficient in the objective parameter of the subcarrier allocation procedure and shown to have a better total throughput without any sacrifice. Using the mean of cooperation coefficient eliminates the need for the feedback of the relaying channel to the base station. It is shown that by using the mean value of the cooperation coefficient, instead of its instantaneous value, throughput of the system would still improve compared to the non-cooperative case. Using the mean of cooperation coefficient leads to an implementable cooperative subcarrier allocation algorithm.

show abstract

“…Those relays were called blind relays. As a result, the amplifying coefficients of the relays were fixed numbers and the amplifiers at the relays might go into saturation when the instantaneous gains of the first-hop channels were large [7]. In practical systems, it is more preferable to implement CSI-assisted relays which know the instantaneous channel gains of the first-hop channels.…”

Section: Introductionmentioning

confidence: 99%

“…Laneman et al have proposed an amplifying coefficient for the CSI-assisted relays [1]. It can successfully avoid saturations of the amplifiers [7] and has been used in many previous publications [8], [9]. It is practically very important to analyze distributed Alamouti's code in cooperative networks with CSIassisted relays.…”

Section: Introductionmentioning

confidence: 99%

BER and diversity order analysis of distributed Alamouti's code with CSI-assisted relays

Kim

2009

2009 11th Canadian Workshop on Information Theory

View full text Add to dashboard Cite

This paper focuses on average bit error rate (BER) and diversity order analysis of distributed Alamouti's code in dissimilar cooperative networks with channel state information (CSI)-assisted relays. We first assume that the relays adopt the amplifying coefficient proposed in [1]. A lower and an upper bounds of the average BER of the distributed Alamouti's code are derived. Then we show that the distributed Alamouti's code only achieves diversity order one when the relays use the amplifying coefficient proposed in [1]. Furthermore, in a general cooperative network with more than two relays, we show that the distributed space-time codes proposed in [2] only achieve diversity order one as well when the amplifying coefficient proposed in [1] is used at the relays. To resolve this problem, we propose a new amplifying coefficient and it makes the distributed Alamouti's code achieve the full diversity order two.

show abstract

On the performance of distributed space-time coding systems with one and two non-regenerative relays

Cited by 93 publications

References 18 publications

Network Beamforming using Relays with Perfect Channel Information

Network Beamforming using Relays with Perfect Channel Information

Cooperative Subcarrier Allocation for an OFDM Relaying System with Grouped Users

BER and diversity order analysis of distributed Alamouti's code with CSI-assisted relays

Contact Info

Product

Resources

About