Optimum Power Allocation for Cooperative Systems with Orthogonal Space-Time Transmissions

We investigate the rate maximizing power allocation strategy for a system where the source and the decode-and-forward (DF) relays cooperate by utilizing a distributed space-time block coding strategy. Under the assumption that all transmitters have perfect knowledge of the link gains, we analyze two limit cases - the case of no-collaboration among relays and the case of ideal collaboration among relays - and we provide a polynomial-time algorithm that computes the maximum achievable rate for the distributed space-time coding system despite the fact that the optimization problem is not convex and it belongs to a class of problems with variational inequality constraints. Due to the orthogonal structure of the space-time block code designs, the proposed algorithm can also be used, with minor modifications, in the computation of the optimum power allocation for the case of DF relays with orthogonal transmissions

[1]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[2]  Ashutosh Sabharwal,et al.  Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints , 2003, IPSN.

[3]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[4]  Anders Høst-Madsen,et al.  Capacity bounds for Cooperative diversity , 2006, IEEE Transactions on Information Theory.

[5]  Abbas El Gamal,et al.  Capacity of a class of relay channels with orthogonal components , 2005, IEEE Transactions on Information Theory.

[6]  Zhi-Quan Luo,et al.  Optimal relayed power allocation in interference-free nonregenerative cooperative systems , 2004, IEEE 5th Workshop on Signal Processing Advances in Wireless Communications, 2004..

[7]  Arogyaswami Paulraj,et al.  Space-time block codes: a capacity perspective , 2000, IEEE Communications Letters.

[8]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

[9]  Sanjeev R. Kulkarni,et al.  Capacity and Optimal Resource Allocation in the Degraded Gaussian Relay Channel with Multiple Relays , 2002 .

[10]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[11]  Roy D. Yates,et al.  Forwarding strategies for Gaussian parallel-relay networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[12]  M. Vetterli,et al.  On the capacity of large Gaussian relay networks , 2005 .

[13]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[14]  Michael Gastpar,et al.  On the capacity of large Gaussian relay networks , 2005, IEEE Transactions on Information Theory.