Power Allocation in Two-Hop Amplify-and-Forward MIMO Relay Systems With QoS Requirements

Sanguinetti, Luca; D’Amico, Antonio A.

doi:10.1109/tsp.2012.2187198

Cited by 35 publications

(30 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The major contribution of this work is to rigorously prove that the solution of (3) leads to the diagonalization of the source-relay-destination channel up to a unitary matrix. Differently from [11] and [15], the latter is found to be such that the individual MSEs are all equal to a quantity depending on the specif c Schur-convex function 1 . Once the solution of (3) is proven to be such that the source-relay-destination channel is diagonalized up to an unitary matrix, the power minimization problem in (3) reduces to properly allocating the available power over the established links.…”

Section: B Contributionmentioning

confidence: 94%

“…Once the solution of (3) is proven to be such that the source-relay-destination channel is diagonalized up to an unitary matrix, the power minimization problem in (3) reduces to properly allocating the available power over the established links. Solving such a problem is out of the scope of the submitted letter since its solution can be found with affordable complexity resorting for example to the power allocation algorithm developed in [15]. For simplicity, we focus only on a two-hop system in which a single relay is employed.…”

Section: B Contributionmentioning

confidence: 99%

“…Unfortunately, the computational complexity of both algorithms is relatively high so as to make them unsuited for practical implementation. For this reason, in [15] the authors develop an alternative solution in which the nonconvex power allocation problems in (16) is approximated with a convex one that can be solved exactly through a multi-step procedure of reduced complexity 4 .…”

Section: A Linear Transceiver Designmentioning

confidence: 99%

“…. , K still given by (15). In addition, the matrices Λ U and Λ F are diagonal with elements in decreasing order.…”

Section: B Non-linear Transceiver Designmentioning

confidence: 99%

“…Similar to [5] - [9], in [11] it is shown that the solution of (1) leads to the diagonalization of the sourcerelay-destination channel. The extension of the above problem to MIMO-OFDM relay systems is discussed in [14] (see also [11] and [15]) in which the following problem is considered…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

On the Design of Amplify-and-Forward MIMO-OFDM Relay Systems With QoS Requirements Specified as Schur-Convex Functions of the MSEs

Sanguinetti

D’Amico

Rong

2013

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

In this letter, we focus on the design of linear and non-linear architectures in amplify-and-forward multiple-input multiple-output orthogonal frequency-division multiplexing relay networks in which different types of services are supported. The goal is to jointly optimize the processing matrices so as to minimize the total power consumption while satisfying the quality-of-service requirements of each service specified as Schurconvex functions of the mean square errors over all assigned subcarriers. It turns out that the optimal solution leads to the diagonalization of the source-relay-destination channel up to a unitary matrix depending on the specific Schur-convex function.

show abstract

Section: B Contributionmentioning

confidence: 94%

Section: B Contributionmentioning

confidence: 99%

Section: A Linear Transceiver Designmentioning

confidence: 99%

“…. , K still given by (15). In addition, the matrices Λ U and Λ F are diagonal with elements in decreasing order.…”

Section: B Non-linear Transceiver Designmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On the Design of Amplify-and-Forward MIMO-OFDM Relay Systems With QoS Requirements Specified as Schur-Convex Functions of the MSEs

Sanguinetti

D’Amico

Rong

2013

IEEE Trans. Veh. Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

Algorithms for separable convex optimization with linear ascending constraints

Akhil

Sundaresan

2018

Sādhanā

View full text Add to dashboard Cite

The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a separable convex function over the bases of a polymatroid with a certain structure. The paper presents a survey of state-of-the-art algorithms that solve this optimization problem. The algorithms are applicable to the class of separable convex objective functions that need not be smooth or strictly convex. When the objective function is a so-called d -separable function, a simpler linear time algorithm solves the problem.

show abstract

Network utility maximization revisited: Three issues and their resolution

Akhil

Sundaresan

2019

Performance Evaluation

View full text Add to dashboard Cite

Power Allocation in Two-Hop Amplify-and-Forward MIMO Relay Systems With QoS Requirements

Cited by 35 publications

References 27 publications

On the Design of Amplify-and-Forward MIMO-OFDM Relay Systems With QoS Requirements Specified as Schur-Convex Functions of the MSEs

On the Design of Amplify-and-Forward MIMO-OFDM Relay Systems With QoS Requirements Specified as Schur-Convex Functions of the MSEs

Algorithms for separable convex optimization with linear ascending constraints

Network utility maximization revisited: Three issues and their resolution

Contact Info

Product

Resources

About