Transceiver Designs For Relay-Aided MIMO Interference Systems

Transceiver Designs for Relay-Aided MIMO
Interference Systems
Vindheshwari P. Singh
July 13, 2018
Transceiver Designs in MIMO Relay IC July 13, 2018 1 / 43

Interference Channel with Relays
Interference channel (IC) can model many wireless communication

systems.
For example, interfering base stations in a cellular network, wireless

LANs, interfering secondary users in a cognitive radio etc.
Figure: The two user IC
MIMO and Relay assisted communication are are two promising

techniques for mitigating the limitations of fading and interference.
Interference Channel with Relays
Compared with other relaying strategies, Half-duplex AF relaying is
attractive because of its simple implementation and lower processing
delay.
A specific practical application scenario of the interference relay channel is
Figure: The downlink transmission in a macro cellular network

Presentation Outline
Transceiver Design with Perfect CSI (15 minutes)

System Model and Problem Formulation
Proposed Algorithms and Simulation Results
Statistically Robust Transceiver Design (15 minutes)

Channel Model and Problem Formulation
Worst-Case Robust Transceiver Design (15 minutes)

Channel Model and Problem Formulation

Transceiver Design with Perfect CSI: Signal Model
K users (K Tx-Rx pairs)

M Half Duplex AF Relays
2-Hop transmission in 2
distinct time slots
Ns,k antennas at Tx k
Nr,m antennas at Relay m
Nd,k antennas at Rx k
Hm,k is the channel matrix from Tx k to relay m, Gk,m is the channel

matrix from relay m to Rx k.

Signal Model: Precoding at Transmitter
(1) (dk ) T
Tx k transmits dk data streams sk = [sk , . . . , sk ] to receiver k.
where dk ≤ min{Ns,k , Nd,k }.
Tx k precodes its data streams using a precoder matrix

(1) (d )
Vk = [vk , . . . , vk k ] ∈ CNs,k ×dk as
dk
(l) (l)
X
xs,k = Vk sk = vk sk
l=1
The transmit power at kth transmitter (Assume E(sk sk H ) = Idk )

dk
(l) (l)
X
ps,k = tr(E{xs,k xs,k H }) = tr(Vk Vk H ) = (vk )H vk
l=1

Signal Model: Linear Processing at AF Relay
PK
Received signal at mth relay yr,m = j=1 Hm,j Vj sj + zr,m .
Relay m linearly precodes its received signal by a precoding matrix

Um ∈ CNr,m ×Nr,m .
Transmit signal at the mth relay

K
X
xr,m = Um yr,m = Um Hm,j Vj sj + Um zr,m
j=1
The transmit power at the mth relay (Assume E(zr,m zH 2

r,m ) = σr I)
pr,m = tr(E{xr,m xr,m H })

K
X
= tr(Um Hm,k Vk VH H H 2 H
k Hm,k Um ) + σr tr(Um Um )
k=1

Signal Model: Post-Processing at Receiver
Received Signal at kth Receiver

M
X K
X
yd,k = Gk,m Um Hm,j Vj sj + zr,m + zd,k
m=1 j=1
K
X M
X
= Tk,j Vj sj + Gk,m Um zr,m + zd,k
j=1 m=1
PM
Tk,j = m=1 Gk,m Um Hm,j is the effective channel between Tx j and Rx
k.
(1) (dk )
Rx k applies a linear receive filter Wk = [wk , ...., wk ] ∈ CNd,k ×dk .
Linearly processed received signal at receiver k is s̃k = WH

k yd,k .

Signal Model: Post-Processing at Receiver
The linearly processed lth spatial stream at kth receiver is given by

(l) (l)
s̃k = (wk )H yd,k
dk
(l) (l) (l) (l) (p) (p)
X
= (wk )H Tk,k vk sk + (wk )H Tk,k vk sk
| {z } p=1
desired signal p6=l
| {z }
inter stream interference
K X dj M
(l) (p) (p) (l) (l)
X X
+ (wk )H Tk,j vj sj + (wk )H Gk,m Um zr,m + (wk )H z
j=1 p=1 m=1
| {z
j6=k | {z } local receiver
| {z } relay enhanced noise
inter user interference

Performance Measures
(l)
The MSE of the data stream estimate s̃k can be written as
2
(l) (l) (l) (l)
MSEk,l = E{|s̃k − sk |2 } = 1 − (wk )H Tk,k vk + Bk,l

(l)
The SINR of the data stream estimate s̃k can be written as
A
SINRk,l = Bk,l
k,l
where
(l) (l)
Ak,l = |(wk )H Tk,k vk |2
dk dj
K X
(l) (p) (l) (p)
X X
Bk,l = |(wk )H Tk,k vk |2 + |(wk )H Tk,j vj |2
p=1 j=1 p=1
p6=l j6=k
(l) (l)
+ σr2 ||(wk )H G̃k Ũ||2 + σd2 ||(wk )||2

Problem Formulation
We formulate the following fairness based linear transceiver design
problems.
Max Per-stream MSE Minimization

min max MSEk,l
{V}, {U} l∈Dk
{W} k∈K
subject to ps,k ≤ Ps,k , ∀k ∈ K

pr,m ≤ Pr,m , ∀m ∈ M
Min Per-stream SINR maximization
max min SINRk,l

{V}, {U} l∈Dk
{W} k∈K
subject to ps,k ≤ Ps,k , k ∈ K
pr,m ≤ Pr,m , m ∈ M

Review of Conic Optimization
The two convex conic optimization problems are Second order cone
program (SOCP) and Semi-definite program (SDP).
The standard form of an SOCP is
minimize R{f H x}
x
subject to kAH H
i x + bi k ≤ ci x + di i = 1, . . . , N
where x is the optimization variable and fi , Ai , bi , ci , di , i = 1, . . . , N are

the data parameters.
The standard form of an SDP is
minimize R{f H x}
x
subject to A(x) 0
PN
where A(x) = A0 + i=1 xi Ai is the Hermitian matrix that depends
affinely on x. Ai , i = 0, . . . , N are the data parameters.
Max MSE minimization: Proposed Approach
The transceiver optimization problem is non-convex with matrix

variables, therefore, a globally optimal solution is not tractable.
Exploiting the block multi-convex structure of the MSE function, we

propose a quasi-optimal iterative algorithm based on a block coordinate
descent approach.
The basic idea is that design variables {V, W, U} are partitioned into
three blocks namely transmitter precoders {V}, receiver filters {W} and
relay precoding matrices {U}.

Max MSE minimization: Proposed Approach
Receiver Matrices Design: With fixed {V, U}, the receiver beamforming
vectors for each data stream can be determined separately as
(l)∗
wk = argmin MSEk,l
wk ∈CNd,k ×1
(l)
Transmitter Precoders Design: With fixed {W, U}, the following

optimization problem is formulated as an SOCP problem.
{V∗ } := argmin MSE

{V}
p
s.t. MSEk,l ≤ MSE , ∀l ∈ Dk , ∀k ∈ K
ps,k ≤ Ps,k , ∀k ∈ K
pr,m ≤ Pr,m , ∀m ∈ M
Relay Matrices Design: With fixed {W, V}, relay matrices design
problem is also formulated as an SOCP problem.
Simulation Results (1)
We consider only symmetric systems denoted as (Nd × Ns , d)K + Nr M .
where Ns,k = Ns ,Nd,k = Nd , dk = d ; k ∈ K and Nr,m = Nr ; m ∈ M.
Ps,k = P for k ∈ K, Pr,m = P for m ∈ M, σr = σd = σ = 1, SNR = σP2 .
Figure: Min-Max MSE Figure: Max-Min SINR
Convergence behavior for a random channel realization of the

(2 × 4, 1)4 + 24 system at SNR = 25 dB.
Figure: (2 × 4, 1)4 + 24 System Figure: (4 × 4, 2)3 + 43 System
End-to-End minimum user rate vs. SNR.
Sum-Rate,Min-Leakage [TroungHeath’13]

Figure: (2 × 2, 1)K + 2K System Figure: (2 × 2, 1)4 + 24 System
DF-Min Leakage, DF-Max SINR [GomadamJafar’11]

DF-Min-Max MSE [ChenChung’12], DF-Max-Min SINR [LiuLuo’13].

Transceiver design with perfect CSI: Limitations
In the transceiver design algorithms presented so far, perfect and

instantaneous CSI of all the links is assumed at a central node which
computes {V}, {U}, {W}.
The assumption of having perfect knowledge of channel is however often

unrealistic in practice.
The performance of the algorithms developed with perfect CSI

assumption will substantially degrade in the presence of the CSI
mismatch.

Statistically Robust Transceiver
Robust transceiver design algorithms, which could mitigate such

performance degradation by considering the CSI uncertainties are needed
for practical implementation.
Generally, there are two different ways to model CSI errors: the
stochastic model and the deterministic model.
First, we consider the stochastic model for the CSI uncertainty such that
the imperfect CSI consists of the first and second order statistics of the
actual channel.
The actual channel is modeled in the form of a Gaussian random matrix

with estimated channel matrix as the mean value and its estimation error
covariance as the channel covariance matrix.

Statistically Robust Transceiver: Channel Model
The channel matrices can be written using the Gaussian Kronecker model
as
1/2 T /2
Hm,k = H̄m,k + ΦHm,k Hwm,k ΘHm,k
1/2 T /2
Gk,m = Ḡk,m + ΦGk,m Gwk,m ΘGk,m
1/2 T /2
Fk,j = F̄k,j + ΦFk,j Fw
k,j ΘFk,j
H̄m,k , Ḡk,m and F̄k,j are the estimated channel matrices.
ΘHm,k and ΦHm,k are the covariance matrices of the channel estimation
error seen from the Tx and Rx side respectively of the corresponding link.
Hw w w
m,k , Gk,m and Fk,j are Gaussian random matrices with i.i.d elements
distributed as CN (0, 1).

Statistically Robust Transceiver: Channel Model
A random matrix has a matrix variate Gaussian distribution

Z ∼ CN (X̄, Θ ⊗ Φ) if
vec(Z) ∼ CN (vec(X̄), Θ ⊗ Φ)
The resulting distributions of the channel matrices can be written as

Hm,k ∼ CN H̄m,k , ΘHm,k ⊗ ΦHm,k

Gk,m ∼ CN Ḡk,m , ΘGk,m ⊗ ΦGk,m

Fk,j ∼ CN F̄k,j , ΘFk,j ⊗ ΦFk,j

Statistically Robust Transceiver
The MSE matrix of received signal at kth receiver is
Ek (Wk , {Vk }, {Um })

= E{(s̃k − sk )(s̃k − sk )H }
We know only statistical information of the channel, averaged system

performance is considered.
We consider the statistical expectation of Ek respect to the channel of all

the links EF,G,H {Ek }.
We consider the averaged transmit power at the mth relay nodes as

EH [pr,m ]

Statistically Robust Transceiver: Problem Formulation
Statistically robust Sum MSE Minimization

K
X
min tr EF,G,H {Ek (Wk , {Vk }, {Um })}
{V},{U},{W}
k=1
EH [pr,m ] ≤ Pr,m , m ∈ M
Statistically robust Max MSE Minimization

min max tr EF,G,H {Ek (Wk , {Vk }, {Um })}
{V},{U},{W} k∈K
EH [pr,m ] ≤ Pr,m , m ∈ M

Statistically Robust Transceiver: Proposed Approach
We first derive a closed form expression for averaged MSE and averaged
relay power.
Exploiting the block multi-convex structure of resulting averaged MSE

expression, we develop sub-optimal iterative algorithms based on block
coordinate descent approach.
In each iteration we solve three convex subproblems for updating

transmitters, receivers and relays.

Simulation Parameters
We assume the same SNR for all the source-relay and relay-destination
links as SNR1 .
SNR for the source-destination links is SNR1 − ∆SNR , where ∆SNR is the
attenuation of the direct links due to a larger path loss.
The channel estimation error at the transmitter side is uncorrelated i.e.

ΘHm,k = ΘFk,j = σe2 INs and ΘGk,m = σe2 INr .
The exponential model is used to represent the covariance matrix of the

channel estimation error at the receiver side.
|p−q| |p−q|
[ΦHm,k ]p,q = ρh , [ΦGk,m ]p,q = ρg , and
|p−q|
[ΦFk,j ]p,q = ρf ,p, q ∈ {1, 2, 3} and ρh = ρg = ρf = 0.30.

Convergence behavior of the proposed robust algorithms for

(3 × 3, 2)4 + 35 system at SNR = 15dB.

Comparison of proposed robust algorithms vs SNR for (3 × 3, 2)4 + 35

system at ∆SNR = 10dB and different σe2 .
Figure: Averaged MSE performance Figure: Averaged MSE distribution

Comparison with Nonrobust designs for (3 × 3, 2)4 + 35 system at ∆SNR

= 10dB and different σe2 .
Figure: σe2 = 0.01 Figure: σe2 = 0.001

Worst-case Robust Transceiver Design
The disadvantage of the statistally robust transceiver design is that it is

unable to guarantee a fixed level of performance for any channel
realization.
In some scenarios, it may not be possible to provide an accurate

statistical model for the CSI error.
Another approach to model channel uncertainty is to consider a bounded

model for the CSI error.
The actual channel is assumed to be located within the bounded

uncertainty region around the estimated channel.

Worst-case Robust Transceiver Design: Channel Model
We assume that the CSI error belongs to a spherical uncertainty region.
The channel uncertainty set of each link can be expressed as
Hm,k = {Hm,k | Hm,k = H̄m,k + ∆Hm,k , k∆Hm,k kF ≤ δHm,k }

Gk,m = {Gk,m | Gk,m = Ḡk,m + ∆Gk,m , k∆Gk,m kF ≤ δGk,m }
Fk,j = {Fk,j | Fk,j = F̄k,j + ∆Fk,j , k∆Fk,j kF ≤ δFk,j }
Worst case design approach is adopted to find the best transceiver for the
least favorable channel in the uncertainty region.

Worst-case Robust Transceiver: Problem Formulation
Sum-MSE minimization
K
X
min t(k)
{V},{U},{W},t(K)
k=1
subject to MSEk ≤ t(k), k ∈ K
Hm,k ∈ Hm.k , Gk,m ∈ Gk,m , Fk,j ∈ Fk,j ∀m, j, k
ps,k ≤ Ps,k , k ∈ K
pr,m ≤ Pr,m , Hm,k ∈ Hm,k ∀m ∈ M
Max-MSE Minimization
min τ
{V},{U},{W},t(K)
subject to MSEk ≤ τ, k ∈ K
Hm,j ∈ Hm,k , Gk,m ∈ Gk,m , Fk,j ∈ Fk,j ∀m, j, k
ps,k ≤ Ps,k , ∀k ∈ K
pr,m ≤ Pr,m , Hm,k ∈ Hm,k ∀m ∈ M

Worst-case Robust Transceiver: Problem Formulation
Total Power Minimization

K
X M
X
min kVk k2F + t(m)
{V},{U},{W},t(M )
k=1 m=1
subject to MSEk ≤ µk , k ∈ K
Hm,k ∈ Hm.k , Gk,m ∈ Gk,m , Fk,j ∈ Fk,j ∀m, j, k
pr,m ≤ t(m) , Hm,k ∈ Hm,k ∀m ∈ M, k ∈ K
The transceiver-design problems are nonconvex.
They are semi-infinite because there are infinite number of constraints.
Two approaches: SDP based algorithms, Cutting-set Method based

algorithms.

Worst case Robust: SDP based Algorithms
The MSE of received signal at kth receiver is
MSEk = E{ks̃k − sk k22 }

M M
X 2 X
H
σr2 kWH 2

=
Wk Gk,m Um Hm,k Vk − Idk
+ k Gk,m Um kF
m=1 F m=1
K X
X M 2
H 2 2

+ + σd kWk kF
Wk Gk,m Um Hm,j Vj

j=1 m=1 F
j6=k
Writing in vector form, we have MSEk = kmk k22
Using Schur complement lemma, MSE constraints kmk k22 ≤ tk are

rewritten as
tk mH

k 0
mk I

Worst case Robust: SDP based Algorithms
The generalized s-lemma (s-procedure) [GharavolLarson 13] is written as

N
X
A (PH H H
k Xk Qk + Qk Xk Pk ) ∀k, Xk : kXk k ≤ δk holds
k=1
If and only if there exist nonnegative real numbers 1 , . . . , N such that

PN
A − k=1 k QH −δ1 PH . . . −δN PH
 
k Qk 1 N
 δ1 P1 1 I ... 0 
0
 

 .
.. .
.. . .. .
.. 
δ N P1 0 ... N I
Using s-lemma, we can convert the set of infinite constraints into a linear
matrix inequality.
Each subproblem is reformulated as an SDP problem, which can be
efficiently solved using interior point methods.

Worst case Robust: Cutting-Set based Algorithms
Cutting Set Method for Robust Transceiver Design
S1: Given a set S of initial channel matrices S = {{H̄m,k }, {Ḡk,m }}.
S2: Optimization: Solve the transceiver design problem with S and

return {V}, {U}, {W}.
S3: Pessimization:
Find worst-case violating channels at the current {V}, {U}, {W}.
Append them to the set S.
S3: Termination: If maximum constraint violation is below stopping

tolerance, quit else go to S2.

Worst case Robust: Cutting-Set based Algorithms
Worst-case Analysis:
Given {V}, {U}, {W} , find the worst case channels that maximize the
constraint functions in the bounded uncertainty region.
MSE constraints: For each k ∈ K

maximize MSEk
{Hm,j },{Gk,m },{Fk,j }
subject to Hm,j ∈ Hm,j , m ∈ M, j ∈ K

Gk,m ∈ Gk,m , m ∈ M
Fk,j ∈ Fk,j , j ∈ K
Relay Power Constraints: For each m ∈ M
maximize pr,m
{Hm,k }
subject to Hm,k ∈ Hm,k , k ∈ K

Simulation Parameters
We assume the same SNR for all the source-relay and relay-destination
links as SNR1 .
SNR for the source-destination links is SNR1 − ∆SNR , where ∆SNR is the
attenuation of the direct links due to a larger path loss.
Let the size of the bounded uncertainty regions are related to the quality
of the channel i.e.
δHm,j = skH̄m,j kF m ∈ M, j ∈ K
δGk,m = skḠk,m kF k ∈ K, m ∈ M
δFk,j = skF̄k,j kF k ∈ K, j ∈ K
where s ∈ [0, 1].
To solve the SDP and SOCP problems, we have used CVX, a package for
specifying and solving convex optimization problems.
Convergence behavior of the SDP based Worst-case robust algorithms for

(2 × 2, 2)2 + 22 system
Figure: Sum MSE Figure: Max MSE Figure: Total Power

Minimization (SNR = Minimization (SNR = Minimization (Target
20dB) 20dB) MSE = 0.30)

Convergence behavior of the Cutting-Set Method based Worst-case robust

algorithms for (2 × 2, 2)2 + 22 system
Figure: Sum MSE Figure: Max MSE Figure: Total Power

Minimization (SNR = Minimization (SNR = Minimization (Target
20dB) 20dB) MSE = 0.30)

Comparison with Nonrobust designs for (2 × 2, 2)2 + 22 system at ∆SNR

= 10dB and different s.
Figure: Sum MSE Minimization Figure: Max MSE Minimization

Related Publications
Journal Papers (Published):
Vindheshwari P. Singh and A. K. Chaturvedi, “Minmax mean squared
error-based linear transceiver design for multiple-inputmultiple-output
interference relay channel”, IET Communications,vol.9, no.6, pp.853-861, 2015.
Vindheshwari P. Singh and A. K. Chaturvedi: “Max-min fairness based linear

transceiver-relay design for MIMO interference relay channel”, IET
Communications, vol 11, no. 7, pp. 1485-1496, 2017.
Vindheshwari P. Singh and A. K. Chaturvedi, “Statistically Robust Transceiver

Design Algorithms for Relay aided MIMO Interference Systems”, IET Signal
Processing, vol. 12, no. 1, pp. 51-63, 2 2018.
Journal Papers (Under Review):
Vindheshwari P. Singh and A. K. Chaturvedi, “Worst-case Robust Transceiver
designs for MIMO Interference AF relay systems,”. submitted to IEEE
transaction on Vehicular Technology.
Vindheshwari P. Singh “Robust Weighted Sum Rate maximization for 2-hop

Interference channel: Centralized and Distributed Algorithms”, submitted to
IEEE transaction on Wireless Communication.
Current work and future directions
Energy efficient resource allocation for Relay aided Interference systems.
Transceiver optimization for Multi-user relay systems with full-duplex

massive MIMO relays.
Milimeter-wave multi-user MIMO transceiver design
Information theoretic analysis of 2-hop interference channel.
Building prototype wireless testbeds to investigate these algorithms in

realistic wireless environment.

End of Talk

Transceiver Designs For Relay-Aided MIMO Interference Systems

Diunggah oleh

Informasi Dokumen

Deskripsi Asli:

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

Transceiver Designs For Relay-Aided MIMO Interference Systems

Diunggah oleh

Hak Cipta:

Format Tersedia

Transceiver Designs for Relay-Aided MIMO

July 13, 2018

Transceiver Designs in MIMO Relay IC July 13, 2018 1 / 43

Interference channel (IC) can model many wireless communication

For example, interfering base stations in a cellular network, wireless

Figure: The two user IC

MIMO and Relay assisted communication are are two promising

A specific practical application scenario of the interference relay channel is

Figure: The downlink transmission in a macro cellular network

Transceiver Designs in MIMO Relay IC July 13, 2018 3 / 43

Transceiver Design with Perfect CSI (15 minutes)

Statistically Robust Transceiver Design (15 minutes)

Worst-Case Robust Transceiver Design (15 minutes)

Transceiver Designs in MIMO Relay IC July 13, 2018 4 / 43

K users (K Tx-Rx pairs)

Hm,k is the channel matrix from Tx k to relay m, Gk,m is the channel

Transceiver Designs in MIMO Relay IC July 13, 2018 5 / 43

Tx k precodes its data streams using a precoder matrix

The transmit power at kth transmitter (Assume E(sk sk H ) = Idk )

Transceiver Designs in MIMO Relay IC July 13, 2018 6 / 43

Relay m linearly precodes its received signal by a precoding matrix

Transmit signal at the mth relay

The transmit power at the mth relay (Assume E(zr,m zH 2

pr,m = tr(E{xr,m xr,m H })

Transceiver Designs in MIMO Relay IC July 13, 2018 7 / 43

Received Signal at kth Receiver

Linearly processed received signal at receiver k is s̃k = WH

Transceiver Designs in MIMO Relay IC July 13, 2018 8 / 43

The linearly processed lth spatial stream at kth receiver is given by

Transceiver Designs in MIMO Relay IC July 13, 2018 9 / 43

Transceiver Designs in MIMO Relay IC July 13, 2018 10 / 43

Max Per-stream MSE Minimization

subject to ps,k ≤ Ps,k , ∀k ∈ K

Min Per-stream SINR maximization

max min SINRk,l

Transceiver Designs in MIMO Relay IC July 13, 2018 11 / 43

The standard form of an SOCP is

where x is the optimization variable and fi , Ai , bi , ci , di , i = 1, . . . , N are

The transceiver optimization problem is non-convex with matrix

Exploiting the block multi-convex structure of the MSE function, we

Transceiver Designs in MIMO Relay IC July 13, 2018 13 / 43

Transmitter Precoders Design: With fixed {W, U}, the following

{V∗ } := argmin MSE

Figure: Min-Max MSE Figure: Max-Min SINR

Convergence behavior for a random channel realization of the

Figure: (2 × 4, 1)4 + 24 System Figure: (4 × 4, 2)3 + 43 System

End-to-End minimum user rate vs. SNR.

Transceiver Designs in MIMO Relay IC July 13, 2018 16 / 43

Figure: (2 × 2, 1)K + 2K System Figure: (2 × 2, 1)4 + 24 System

DF-Min Leakage, DF-Max SINR [GomadamJafar’11]

Transceiver Designs in MIMO Relay IC July 13, 2018 17 / 43

In the transceiver design algorithms presented so far, perfect and

The assumption of having perfect knowledge of channel is however often

The performance of the algorithms developed with perfect CSI

Transceiver Designs in MIMO Relay IC July 13, 2018 18 / 43

Robust transceiver design algorithms, which could mitigate such

The actual channel is modeled in the form of a Gaussian random matrix

Transceiver Designs in MIMO Relay IC July 13, 2018 19 / 43

H̄m,k , Ḡk,m and F̄k,j are the estimated channel matrices.

Transceiver Designs in MIMO Relay IC July 13, 2018 20 / 43

A random matrix has a matrix variate Gaussian distribution

The resulting distributions of the channel matrices can be written as

If and only if there exist nonnegative real numbers 1 , . . . , N such that