Distributed On-Off Power Control for Amplify-and-Forward Relays with Orthogonal Space-Time Block Code

Dai, Mingjun; Sung, Chi Wan; Wang, Yan

doi:10.1109/twc.2011.040511.101285

Cited by 15 publications

(21 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to Equations (7) and (8) of , all the individual terms within the summations are equal to zero (see also ). Removing the zero terms and using Equation (6) of , we obtain where h eq ≜ ( ξ 1 h A 1 h 1 B , ⋯ , ξ N h AN h NB ), and

MathClass-rel| MathClass-rel| MathClass-bin\cdot MathClass-rel| {MathClass-rel|}_{F}^{2}

represents the squared Frobenius norm. The last equality is due to because the magnitude of each entry in is equal to one.…”

Section: Gcod Combined With Aaf and Ofdmmentioning

confidence: 99%

“…Because it is difficult to minimise p out directly, we minimise

p_{out}^{UBD} MathClass-rel= Pr {{\underset{Γ}{falsemml-underline}}_{B} MathClass-rel< Γ_{thd}}

, which is an upper bound of p out , instead. Because

{\underset{Γ}{falsemml-underline}}_{B}

in Equation is identical to that in Equation (25) of , Lemma 6 and Theorem 7 in apply here, and we repeat it as: Lemma If Γ i < Γ thd for all

i MathClass-rel\in scriptN

, then

p_{out}^{UBD} MathClass-rel= 1

for all ξ i 's,

i MathClass-rel\in scriptN

. Theorem If not all Γ i 's are less than Γ thd , then the minimiser of

p_{out}^{UBD}

satisfies the following conditions: For

i MathClass-rel\in scriptN

({, \begin{matrix} falsenonefalsearray \\ arrayleft if Γ_{i} > Γ_{thd}, & arrayleft then ξ_{i}^{*} = ξ_{i}^{\max}, \\ arrayleft if Γ_{i} < Γ_{thd}, & arrayleft then ξ_{i}^{*} = 0, \\ arrayleft if Γ_{i} = Γ_{thd}, & arrayleft then ξ_{i}^{*} \in MathClass-open[0, ξ_{i}^{\max} MathClass-close] \end{matrix})

…”

Section: Optimization By Power Controlmentioning

confidence: 99%

“…In this section, we compare the DMT of our proposed scheme, OFDM‐DGCOD‐AAF, with the schemes proposed in . Because

{\underset{Γ}{falsemml-underline}}_{B}

in Equation of this paper has the same expression as that in Equation (25) of , the diversity performance of OFDM‐DGCOD‐AAF is the same as its counterpart in . The only difference is that there is a CP overhead, and we assume half‐duplex relays.…”

Section: Diversity‐multiplexing Tradeoffmentioning

confidence: 99%

See 2 more Smart Citations

Achieving high diversity and multiplexing gains in the asynchronous parallel relay network

Dai

Sung

2013

Trans. Emerging Tel. Tech.

Self Cite

View full text Add to dashboard Cite

A single source‐destination pair communicating via a layer of parallel relay nodes under quasi‐static slow fading environment is investigated. The time delays from the source to the destination via different relays are assumed to be different. For such an asynchronous environment, a new transmission scheme is constructed so as to achieve better diversity‐multiplexing tradeoff (DMT). More specifically, both the source and the destination adopts orthogonal frequency division multiplexing technique to solve the asynchronous problem; the relays cooperatively apply the distributed generalised complex orthogonal design, a form of orthogonal space–time coding, for high‐rate transmission. Each relay is assumed to use the adaptive amplify‐and‐forward relaying strategy. To optimise its outage performance, a distributed on‐off power control rule applied to the relays is analytically derived and is proved to yield full spatial diversity order. Compared with an existing protocol, our proposed scheme is shown to achieve the same DMT when there are four relay nodes and better DMT when there are more. Besides, the DMT gap between our scheme and the existing one increases with the number of relay nodes. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

MathClass-rel| MathClass-rel| MathClass-bin\cdot MathClass-rel| {MathClass-rel|}_{F}^{2}

represents the squared Frobenius norm. The last equality is due to because the magnitude of each entry in is equal to one.…”

Section: Gcod Combined With Aaf and Ofdmmentioning

confidence: 99%

“…Because it is difficult to minimise p out directly, we minimise

p_{out}^{UBD} MathClass-rel= Pr {{\underset{Γ}{falsemml-underline}}_{B} MathClass-rel< Γ_{thd}}

, which is an upper bound of p out , instead. Because

{\underset{Γ}{falsemml-underline}}_{B}

in Equation is identical to that in Equation (25) of , Lemma 6 and Theorem 7 in apply here, and we repeat it as: Lemma If Γ i < Γ thd for all

i MathClass-rel\in scriptN

, then

p_{out}^{UBD} MathClass-rel= 1

for all ξ i 's,

i MathClass-rel\in scriptN

. Theorem If not all Γ i 's are less than Γ thd , then the minimiser of

p_{out}^{UBD}

satisfies the following conditions: For

i MathClass-rel\in scriptN

({, \begin{matrix} falsenonefalsearray \\ arrayleft if Γ_{i} > Γ_{thd}, & arrayleft then ξ_{i}^{*} = ξ_{i}^{\max}, \\ arrayleft if Γ_{i} < Γ_{thd}, & arrayleft then ξ_{i}^{*} = 0, \\ arrayleft if Γ_{i} = Γ_{thd}, & arrayleft then ξ_{i}^{*} \in MathClass-open[0, ξ_{i}^{\max} MathClass-close] \end{matrix})

…”

Section: Optimization By Power Controlmentioning

confidence: 99%

“…In this section, we compare the DMT of our proposed scheme, OFDM‐DGCOD‐AAF, with the schemes proposed in . Because

{\underset{Γ}{falsemml-underline}}_{B}

Section: Diversity‐multiplexing Tradeoffmentioning

confidence: 99%

See 1 more Smart Citation

Achieving high diversity and multiplexing gains in the asynchronous parallel relay network

Dai

Sung

2013

Trans. Emerging Tel. Tech.

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, this requires feeding back CSI for all users together with centralized optimization [54], [55]. It is very costly in terms of computation and feedback bandwidth.…”

Section: Extension To Multi-user Systemsmentioning

confidence: 99%

Transmitter Design for Uplink MIMO Systems With Antenna Correlation

Wang

Zhang

et al. 2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

We study the uplink transmission in multiple-input multiple-output (MIMO) systems with antenna correlation. We focus on schemes that require only channel covariance information at the transmitter (CCIT), which involves lower cost than full channel state information at the transmitter (CSIT). We start from mutual information analysis and show that a simple CCIT-based scheme, referred to as statistical water-filling (SWF), can perform close to the optimal full CSIT-based one in MIMO systems with more receive antennas than transmit ones. We then focus on the implementation of SWF in practically coded systems. An iterative linear minimum mean squared error (LMMSE) receiver is assumed and an extrinsic information transfer (EXIT) chart type curve matching technique is developed based onHadamard precoding techniques. Simulation results show that the proposed scheme can obtain significant performance improvement compared to the conventional equal power transmission. Finally, we show that the proposed scheme is also very efficient in multi-user uplink MIMO systems with distributed channel information. Index Terms-Uplink MIMO, antenna correlation, channel covariance information.1536-1276 (c) (S'05-M'10) received the B. Eng. degree in telecommunication engineering and the M. Eng. degree in information engineering, from Xidian University,

show abstract

“…However, how to set the amplifying factor of an AAF relay node has yet to be specified. It is observed in that letting all the relays always transmit with full power achieves diversity order no more than one, while full diversity order is obtained by appropriate power control in . Asynchronisation assumption : When a feedback channel that carries CSI is not available, the use of STTC may be used , but its detection complexity is high. To reduce the complexity, some other transmission schemes have also been proposed in the literature, namely, time‐reversal DSTBC with DF relay nodes , orthogonal frequency‐division multiplexing‐DSTBC with FGAF relay nodes and shift‐orthogonal ST block codes with either DF or FGAF relay nodes .…”

Section: Cooperative Strategies For Wireless Relay Channelsmentioning

confidence: 99%

Survey on cooperative strategies for wireless relay channels

Dai

Wang

Zhang

et al. 2014

Trans. Emerging. Tel. Tech.

Self Cite

View full text Add to dashboard Cite

Cooperative communication has the potential of providing better throughput and reliability to wireless systems when compared with direct communication. To realise the potential gain, it is important to design cooperative strategies for some representative scenarios. This survey deals with three basic wireless relay channels, namely, the parallel relay channel, the multiple‐access relay channel and the broadcast relay channel. For the first channel, which models a single unicast connection, various forwarding strategies are studied. For the second and third channels, which model, respectively, the uplink and downlink scenarios with multiple unicast connections; network codes that exploit the possibility of coding among the connections are studied. The common aim pertaining to the studies of all these three channels is to use the limited radio resource in the most efficient way. Beside the aforementioned conventional works, studies that have state‐of‐the‐art assumptions for relay networks, including outdated channel state information at the transmitter, full duplex relay and practical rateless‐coded cooperation, are also extensively reviewed. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Distributed On-Off Power Control for Amplify-and-Forward Relays with Orthogonal Space-Time Block Code

Cited by 15 publications

References 33 publications

Achieving high diversity and multiplexing gains in the asynchronous parallel relay network

Achieving high diversity and multiplexing gains in the asynchronous parallel relay network

Transmitter Design for Uplink MIMO Systems With Antenna Correlation

Survey on cooperative strategies for wireless relay channels

Contact Info

Product

Resources

About