scispace - formally typeset
Search or ask a question
Journal ArticleDOI

An MMSE Strategy at Relays With Partial CSI for a Multi-Layer Relay Network

TL;DR: A relay network with a single source-destination pair and multiple layers of relays between them is considered, and a sub-optimal closed-form precoder solution is obtained that approaches the bit-error-rate performance of this scheme, when μ is increased, even with partial CSI.
Abstract: We consider a relay network with a single source-destination pair and multiple layers of relays between them. We assume that these layers sequentially relay the signal transmitted by the source to the destination. Unlike existing work, we also assume that the destination and all the forward layers present between the transmitting layer and the destination receive signals during every transmission phase. We optimally combine these signals, say μ of them, using a precoder at each relay layer for onward transmission. We obtain this precoding matrix by minimizing the mean-squared error (MSE) at the relays, and do not require channel-state-information (CSI) of the forward channels at the relays unlike existing systems that minimize MSE at the destination and require CSI of the forward channels at the relays. Our closed-form solution for this matrix is valid for any K number of layers, whereas minimizing MSE at the destination does not have closed-form solution for K > 1. For K > 1, we enhance an existing scheme to obtain a sub-optimal closed-form precoder solution and use it for comparison. We show using simulations that our scheme approaches the bit-error-rate (BER) performance of this scheme, when μ is increased, even with partial CSI.

Summary (4 min read)

Introduction

  • They showed that this creates a distributed space-time code and achieves the same diversity as that of a MIMO system at high total transmitted power.
  • In some systems, the relays may be able to exchange information amongst themselves before transmission.
  • Unlike [18]–[23], which adopted MMSED, the authors minimize MSE at the relays and obtain relay precoder matrices.

A. Contribution

  • The contributions in this paper are: For the multi-layer relay network shown in Fig. 1, the authors propose a novel MMSER relaying strategy, which does not require forward CSI in the transmitting nodes.
  • The authors obtain closed form solutions for the optimumMMSER relay precoders for both cooperative and non-cooperative relays for arbitrary number of layers of relays while also including leaked signals.
  • The authors enhance theMMSED strategies (though these enhancements may not be optimal) proposed in [18], [19], and [21] to work in this multi-layer network for meaningful comparison with MMSER.
  • The authors show using simulations that combining more number of leaked signals improves the performance of MMSER, which outperforms/approaches that of MMSED schemes that use global CSI.

B. Notation and Organization

  • Denotes the identity matrix and is the vector of elements .
  • Represents a circularly symmetric complex Gaussian random variable with real and imaginary parts having mean 0 and variance .
  • Is a diagonal matrix with diagonal elements .
  • Thereafter, in Section III, the MMSER strategy is presented in detail and the precoders for the relay layers are derived.
  • Finally, in Section VII, the authors summarize and conclude the paper.

II. SYSTEM MODEL AND THE PROPOSED SCHEME

  • The authors use and to represent the links and the channel coefficients respectively, with the first two subscripts denoting the transmitter and the next two the receiver.
  • Let be the set of all links and be the set of links from to .
  • In the MMSER- strategy, S transmits in phase 0, and receive and store for later use; transmits in phase 1, and receive and store for later use and so on till phase , when D receives from .
  • Let us denote the transmitted, received, and noise signals by , and respectively with subscript and superscript on them denoting layer and phase respectively.
  • The cost function given in (2) is motivated by the following facts: Somewhat similar to the principle behind regenerative relaying (DF), the relays are desired to transmit a signal that is close to the source symbol or its scaled version.

III. MMSER PRECODER

  • Khajehnouri and Sayed [18] minimized the MSE at the destination and found the precoder matrix for when with no power constraint.
  • Krishna et al. [19] derived a non-diagonal precoder matrix for cooperative relays with average power constraint .
  • In both (3) and (4), the authors have changed symbol notation to be consistent with this paper.
  • Let us call these non-cooperative systems, which use (3) and (4), as MMSED-Khajehnouri/Krishna (MMSED-KK) and MMSED-Lee (MMSED-L) respectively.
  • In their strategy, the authors minimize the MSE at the relays resulting in precoders that do not depend on forward CSI, and use leaked signals to improve the performance.

IV. EXTENSION OF MMSED SCHEMES

  • Derivation of precoders for MMSED schemes, MMSED-KK and MMSED-L ((3) and (4) give the diagonal elements of the precoders of these schemes for ), is complicated when .
  • The system in [23] has two layers, i.e., , and the precoders are obtained iteratively.
  • The authors enhance the MMSED strategies (though these enhancements may not be optimal) proposed in [18], [19], and [21] to obtain closed-form solutions to precoders in a multi-layer network for meaningful comparison with the MMSER- system proposed in this paper.
  • The authors call these systems E-MMSED, for Enhanced-MMSED systems, and find their precoders to be dependent on global CSI as shown in (17) and (18).

A. E-MMSED Strategy

  • For a meaningful comparison, the authors consider the total number of phases as , and the total power transmitted as to be the same as that used by MMSER.
  • S transmits times in as many phases; all the relays average their received signals and transmit times in as many phases, also known as The authors assume.
  • Thus, Watts and Watts respectively, with , the total power available.
  • The authors also assume that the noise is uncorrelated, i.e., where when and when is the Kronecker delta function.
  • Therefore, the authors get and a diagonal element of the precoder of E-MMSED-KK as (17) 2) Precoder of E-MMSED-L: Similarly, to get the diagonal elements of the precoder of E-MMSED-L, they replace the signal power transmitted and noise variance as in E-MMSED-KK into (4) to get its diagonal element as (18).

B. Selection of

  • Let us now select the best and use it while comparing its performance with MMSER- system.
  • As it is hard to derive BER, the authors obtain SNR at D for any and attempt to select the value of that maximizes it.
  • Substituting (16) into (19), the authors get where (20) are respectively, the signal and noise components of the received signal in phase , without considering the noise that is added at D.
  • The authors do not take the noise added at D with these components, as it is not considered while deriving optimum precoder in MMSED.
  • This also reflects in the BER plots shown in Section VI in Fig. 4 that for different values of , BER does not change.

VI. SIMULATION RESULTS

  • The authors compare the BER performance of the proposed MMSER scheme with existing schemes and their enhanced E-MMSED schemes.
  • The authors run Monte-Carlo simulations for both the cooperative and non-cooperative relays cases.
  • First, the authors study the behavior of MMSER, E-MMSED-KK, and E-MMSED-L by varying the following parameters: total number of layers, , number of transmissions by S, and power allocated to S.
  • This is used to analyze the performance of MMSER and MMSED schemes and select the best values of and for E-MMSED in the simulations.

A. Simulation Parameters

  • The authors select from the Gray coded quadrature phase shift keying constellation with unit variance and use MMSE decoders at D, derived in Section V. Hence, the variance of the channel coefficient is given by .
  • In all the simulations, whenever the authors need to increase the number of layers , they do it by inserting them between S and D keeping the distance constant.
  • For , Jing and Hassibi [1] proved that Jing-Hassibi Scheme (JHS) achieves maximum SNR at D when power is equally divided between S and the relays; i.e., .
  • Extending this for any , the authors use in all simulations for EJHS.

B. Summary of Results

  • —Figs. 2 and 3 show respectively how the performance of MMSER-1 worsens and that of MMSER-2 improves as increases.
  • This is used to select the best and for comparison with MMSER- . — Fig. 6 shows a comparison of BERs of MMSER-1 and MMSER-2 with MMSED for the single-layer case , when the relays cooperate.
  • — Figs. 7 and 8 show that the BER performance of MMSER outperforms that of E-MMSED-KK and approaches that of E-MMSED-L when is increased from 1 to with and 4 respectively, when the relays do not cooperate.

C. Usefulness of Leaked Signals,

  • Fig. 2 shows SNR at D and BER plots of MMSER-1 when is varied.
  • It can be observed that as increases, the SNR at D decreases and BER of MMSER-1 increases.
  • Fig. 3 shows BER plots of MMSER-2 for varying .
  • Unlike MMSER-1, the performance of MMSER-2 improves as the number of layers increases.
  • This is because MMSER-2 uses leaked signals.

D. Selection of and for E-MMSED-KK and L

  • Fig. 4 shows the performance of E-MMSED-KK and E-MMSED-L, for various values of the number of transmissions of S. As was shown in (23) and (24), the BER plots also corroborate the fact that the performance does not vary with .
  • Hence, the authors use in all the simulations of E-MMSED.
  • Another parameter that needs to be fixed is the power allocated to S , and the relays .
  • The authors find these using simulations as shown in Fig. 5, where they have used and Watt.
  • For E-MMSED-KK, it can be seen that 20% of total power or achieves low BER for dB and almost same BER for dB than other power allocations.

E. Comparison: Single Layer Case

  • Fig. 6 shows plots of BER in a single layer network, when relays cooperate.
  • MMSED schemes use global CSI optimally while MMSER- schemes use backward CSI alone.
  • When there is only one relay , MMSER-1 performs exactly same as that of MMSED.
  • The performance of MMSER-2 and MMSED-K with leaked signals are also identical.
  • Total power used in simulations is Watts. and MMSED-K with leaked signals perform better than the MMSER-1 and MMSED-K schemes.

F. Comparison: Multi-Layer Case

  • Finally, the authors consider 3 and 4 layer systems with number of relays in each layer to be and a total transmitted power of Watt for comparing BER performance of the proposed system MMSER, with E-MMSED systems.
  • Ideally, the authors would like to compare theMMSER scheme with theMMSED scheme.
  • The authors MMSER- scheme performs better than E-MMSED-KK scheme even though the authors do not use forward CSI, and worse compared to the E-MMSED-L scheme.
  • The comparisons for the multi-layer case in Figs. 7 and 8 also show much more gain (than in the single-layer case) using global CSI in terms of the gap between MMSER-1 and the E-MMSED-L schemes.
  • Using more leaked signals reduces this gap significantly.

VII. SUMMARY AND CONCLUSION

  • The authors have considered the AF relaying protocol for a multi-layer cooperative system, and proposed a precoder design method MMSER which minimizes the MSE at each relay instead of the MSE at the destination that is considered in earlier works.
  • The authors believe that their MMSER schemes provide an interesting method for AF precoder design for multi-layer relay system.
  • The authors found the evaluation of the achieved MSE at the destination for their MMSER schemes challenging, and thus resorted to simulation based study.
  • Even when , i.e., when the unconstrained estimate has lower power, the authors amplify the estimate to use the full sum transmit power for each layer.
  • Here each of the sub-matrices shown in (1) are constrained to be diagonal.

Did you find this useful? Give us your feedback

Content maybe subject to copyright    Report

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 62, NO. 2, JANUARY 15, 2014 271
An MMSE Strategy at Relays With Partial CSI for a
Multi-Layer Relay Network
Pannir Selvam Elamvazhuthi, Student Member, IEEE,BikashKumarDey, Member, IEEE,and
Srikrishna Bhashyam, Senior Member, IEEE
Abstract—We consider a relay network with a single s
ource-des-
tination pair and multiple layers of relays between them. We as-
sume that these layers sequentially relay the signal transmitted by
the source to the destination. Unlike exist
ing work, we also assume
that the destination and all the forward layers present between the
transmitting layer and the destination receive signals during every
transmission phase. We optimally combin
e the se signals, say
of
them, using a precoder at each relay layer for onward transmis-
sion. We obtain this precoding matrix by minimizing the m ean-
squared error (MSE) at the relays,and
do not require channel-
state-information (CSI) of the forward channels at the relays unlike
existing system s that minimize MSE at the destination and require
CSI of the forward channels at th
e relays. Our closed-form solution
for this matrix is valid for any
number of layers, whereas mini-
mizing MSE at the destination does not have closed-form solution
for
.For , we enhance an
existing scheme to obtain
a sub-optimal closed-form precoder solution and use it for com-
parison. We show using simulations that our scheme approaches
the bit-error-rate (BER
) performance of this scheme, when
is in-
creased, even with partial C SI.
Index Terms—MMSE, channel-state-information, multi-layer
relay network, relay precoder, amplify-and-forward.
I. INTRODUCTION
J
ING and Hassibi [1] proved that a spatially distributed
network of single-antenna radio nodes can emulate a mul-
tiple-input multiple-output (MIMO) communication system.
They showed that this creates a distributed space-time code
and achieves the same diversity as that of a MIM O system at
high total transmi tted power. These au thors also extended it t o
include multiple-antenn a nodes in [2] and [3].
When multiple radio nodes a re present, the effectiveness
of cooperative communication [4], [ 5] can be increased by
Manuscript received March 17, 2013; revised August 05, 2013; accepted
September 24, 2013. Date of publication October 04, 2013; date of current ver-
sion December 23, 2013. The associate editor coordinating the review of t his
manuscript and approving it for publication was Prof. Samson Lasaulce. The
work of P. Selvam and B. K. Dey was supported in part by Bharti Centre for
Communication.
P. S. Elamvazhuthi is with Delphi Automotive S y ste ms Pvt. Ltd., Technical
Center I ndia, Kalyan i Platina, Whiteeld, Bengaluru 560066, India (e-mail:
pannir.selvam@delphi.com).
B. K. Dey is with the Ind ian Institute of Technology Bombay, Powai, Mumbai
400076, India (e-mail: bik ash@ee.iitb.ac.in).
S. Bhashyam is with the Indian Institute of Technology Madras, Chennai
600036, India (e-mail: skrishna@ee.iitm.ac.in).
Color versions of one or more of the gures in this paper are available online
at http://ieeexplore.ieee.org.
Dig
ital Object Identier 10.1109/TSP.2013.2284471
arranging t hese nodes into a layered architecture t
o relay in-
formation. Pottie and Kaiser [6] sho wed how a distr
ibuted and
layered signal processing architecture ca
n overcome the energy
and bandwidth constraints in many wireles
s sensor network
applications.
A relay can use a simple forwarding techniq
ue called
amplify-and-forward (AF) [7], in which it
amplies what is
received and transm its. Other well-know
n r elaying methods
include decode-and-forward (DF) (
e.g., [8]), coded coopera-
tion (e.g., [9]), c ompress-and-fo
rward(e.g.,[10],[11]),and
partial-decode-and-forward (PD
F) (e.g., [12]). Chiu et al.
[13] designed the precoder for no
t only the relay but also the
source, while using the PDF stra
tegy at the relays. They used
orthogonal space-time block c
oding [14] in b oth the source and
the relay transmissions. Thou
gh other relaying protocols can
perform better, the AF prot
ocol is widely considered interestin g
because of its simplicity
of implementation. In this paper, we
restrict our attention t
o the AF protocol. In an AF multi-layer
relay system, the perfo
rmance of the system depends on the
precoders used at the re
lays, and we consider the problem of
designing such p reco d
ers.
Our system model cons
ists of a set of single-antenna radio
nodes grouped into
layers of relays, , between
asourceandadestin
ation (we will call the source S o r
and
the destination D o
r
in the sequel) as show n in Fig. 1. Ear-
lier work involvi
ng multiple layers of relays use only the signal
reaching at a part
icular lay e r
from the preceding layer
to construct the
signals transmitted from
. On the contrary, in
this paper, we
construct th e transmit signals at
using signals
that have reac
hed from
, although the signal
from
reaches with lower power compared
to that from
. Thus, we take advantage of the broadcast na-
ture of the w
ireless medium by utilizing overheard signals. We
call these
low power overheard signals as leaked signals.
We will cal
l the channel states of the channels from
to
,availab
le at
,tobebackward CSI and the channel states
of the cha
nnels f rom
to as forward CSI.Here
.Forwar
d and backw ard CSI are together called the global
CSI,and
just the backward CSI is referred to as partial CSI.
We note
here that obtainin g forward CSI r equires either sending
the est
imated channels from the receiving nodes over reliable
feedb
ack channels, or direct estimation of these channels from
the b
ackward transmission (in a time-division duplex system).
The f
easibility of this de pend s on the application scenar io.
Ding
et al. [15] employed AF strategy at the r elays, designed
auni
tary precoder, and achieved maxim um diversity gain.
The
closed form expression of the precoder was extended to
1053-587X © 2013 IEEE

272 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 62, NO. 2, JANUARY 15, 2014
Fig. 1. A multi-layer relay network. Here S, ,D,and represent the
source,
th layer, th relay in , the destination, and the length of the corre -
sponding link respectively. The relays are assumed to be half-duplex.
-ary signals of larger constellation size in [16]. Gomadam
and Jafar [17] obtained relay precoders by maximizing the
receive signal-to-noise ratio (SNR) at t he destination. Many
authors [18]–[23] have considered minimizing the MSE at the
destination (MMSED) to obtain relay precoders using global
CSI. This global optimization is challenging, and authors of
[17] and [23] considered two layers of relays and obtained the
precoder by iterative techniques, w hile the authors of [18]–[22]
derived the optimal precoders in closed-form for a single layer
of relays. The disadvantage in an iterative technique is that
at any iteration, only an approximate solution is found. For
real-time co mputation at the relay s, the quality of the solution
then depends on the processing speed of the relays. Further, to
the best of our knowled ge, iterative so lutions are also available
only for upto two layers of relays, and their generalization
to more layers or incorporating leaked signals is challenging
under the MMSED criterion.
In some systems, the relays m ay be able to exchange informa-
tion amongst themselves before transmission. In such a system,
the relays are said to be co opera tive. O therwise, the precoder
matrix would be diagonal and the relays are said to b e non-co-
operative. All the literature discussed in the previous paragraph,
showed the efcacy of the derived precoders when the relays
are non-cooperative except [ 19], in which the authors derived
the p recoders for cooperative relays. For either cooperative and
non-cooperative relays, to our knowledge, existing literatu re
provides minimum MSE (MMSE) d esign of AF precod ers:
in closed form only when there is a single layer of relays,
and in the form of iterative numerical solution when there
are two layers,
assuming that global CSI is av ailab le with the relays, and
without considering leaked signals.
All the above concerns are addressed in this paper. Unlike
[18]–[23], which ado pted MMSED, we m in im ize MSE at the
relays (MMSER) and obtain relay precoder matrices. We show
that the MMSER strategy makes the optimal precoder design
a lay er- wise optimization as opposed to a global optimization.
This yields optimal precoders in closed form for arbitrary
number of relay l ayers even when leaked signals are used,
and it r equires partial CSI, i.e., only the backward CSI. In
the absence of optimum MMSED precoder solution for more
than two layers of relays, we have proposed som e suboptimal
MMSED precoding schemes, and we show using simulatio n
that despite the lack of forward CSI, our MMSER precoding
strategy outperform s/approaches the perfo rm ance of these
MMSED strategies by using more leaked signals.
A. Contribution
Our contributions in this paper are:
For the multi -layer relay network shown i n Fig. 1, we pro-
pose a novel MMSER relaying strategy, which do es not
require forward CSI in th e transm itting nodes.
We obtain closed form solutions for the optimum MMSER
relay precoders for both cooperative and no n-coop erative
relays for arbit rar y number of layers of relays while also
including leaked signals.
We enhance the MMSED s trateg ies (though these enhan ce-
ments may not be optimal) proposed in [18], [19], and [21]
to work in thi s mu lti-layer network for meani ngf ul com-
parisonwithMMSER.
We show using simulations that combining more number
of leaked signals improves t he performance of MMSER,
which outperforms/approaches that of MMSED schemes
that use global CSI.
B. Notation and Organization
denotes the identity matrix and is the vector of
elements .For denotes zero if
and if . represents a circularly sym-
metric complex G aussian random variable with real and imagi-
nary parts having mean 0 and variance
.
is a d iagonal matrix with diagonal elements .
The remainder of this paper is organized as follows. In
Section II, we state th e problem a nd introduce the MMS E R
strategy. Thereafter, in Section III, the MMSER strategy is
presented in detail and the precoders for the relay layers are de-
rived. Section IV gives details on how we extend and enhance
the MMSED strategy, so that the BER performance of MMSER
can be m eaningfully compared. In Section V, we describe
the equalizer that is used at de stin ation D for M M S ER an d
MMSED schemes to decode the received vector. In S ection VI,
we present simulation results. Finally, in Section VII, we
summarize and conclude the paper.
II. S
YSTEM MODEL AND THE PROPOSED SCHEM E
In our system model shown in Fig. 1, denotes the th
relayinthe
th layer and we assume that it is half-duplex,
.Weuse and to represen t the links an d the channel
coefcients respectively, with the rst two subscripts denoting
the transmitter and the next two the receiver. Therefore, the
channel coefcients of the links,
from
from ,and from
are denoted as ,and respectively. Let
and represent

ELAMVAZHUTHI et al.: MMSE STRATEGY AT RELAYS WITH PARTIAL CSI 273
TABLE I
R
ECEIVED AND TRANSMITTED VECTORS—RELAY L AY ERS
the vectors/matrices of channel coefcients from S to to
,and to D respectively. We assume that the channels are
Rayleigh fading and quasi static.
Let
be the set of all links and be the set
of links from
to .Asanexample,for
,thelinkset is given by
Let us dene the length of the link as ,or
simply by
when the l ayers are understood from the context.
All the lin ks in link set
havethesamelength .
Now, let L
be a class of subsets of with .
Clearly, L
L ,if .Asanexample,linkclassL is
given by
L
The Proposed MMSER- Strategy
Let us consider the
hopnetworkshowninFig.1.Inthe
MMSER-
strategy, S transm its in phase 0,
and
receive and store for later use; transmits
in phase 1 , and
receive and store for later use and
so on till phase
, when D receives from . To be specic, in
MMSER-
, the relays and D store all signals received through
the link s ets in L
for later use. For , MMSER-
would use more number of leaked signals, and thus is expected
to perform better than MMSER-
.
We assume synchronous reception and transmission at the
relay nodes and all noise signals added at the receiver front-ends
are complex zero-mean independent and identically distributed
(i.i.d.) Gaussian random variables with variance
.
Let us denote the transmitted, received, and noise signals by
,and respectively with subscript and superscript on them
denoting layer and phase respectively. Le t the signal transmitted
by S be
with an average pow er of Watts, where
is a unit variance constellation point. I n v arious phases,
the layer
would have r eceived vectors each of size
from previous transmissions, starting from phase till phase
,where . All these vectors are stacked together
as given in Table I to form the overall received vector
.
For example, let us take
and . Here,
for and for .
Hence,
and would have the overall received vectors
respectively. Also and .
The stacked received vector is transmitted by
relays, after
precoding with
in phase as shown in Table I. The precoder
matrix
at is given by
(1)
where
with and .The
precoder submatrices
can be selected to be non-diagonal or
diagonal depending upon whether th e relays would cooperate or
not respectively.
In phases
to , D receives
.If , then it receives
from S directly in phase 0.
Now, we dene the cost function at the relay layer
to be
the MSE
(2)
where
asgiveninTableI
and
is the expectation operator. The relays then transmit
a scaled version of the solution to meet the layer-wise power
constraint. The cost function given in (2) i s motivated by the
following facts:
Somewhat similar to the principle behind regenerative re-
laying (DF), the relays are desired to tr ansmi t a signal that
is close t o the source symbol or its scaled version.
The otherwise complex optim ization probl em (with
MMSED criterion) is replaced by a smaller layer-wise
optimization problem which, as we will see, yields a
solution in closed form.
The requirement of only backw ard CSI gives an added
practical advantage.
Now, our aim is to minimi ze
under the power constraint
and nd the precoder matrices .
III. MMSER P
RECODER
Khajehnouri and Sayed [18] minim ized the MSE
at the destination and found the precoder matr ix for when
with no power constraint. Here, and
.Krishnaet al. [19] derived a non-diagonal precoder
matrix for cooperative relays with average p ower constraint
.
To compare with their results, these authors modied the
th
diagonal element of the precoder matrix to restrain power in the
Khajehnouri-Sayed scheme [18] as
(3)
for non-cooperative relays in Khajehnouri–Sayed equation (24).
Lee et al. [20] obtained
using constrained optimization [24]
for non-cooperativ e relays as
(4)

274 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 62, NO. 2, JANUARY 15, 2014
where we have removed the uncertainty channel term s to match
the scope of this paper. In both (3) and (4), we have chang e d
symbol notation to be consisten t with this paper.
Let us call these non-cooperative systems, which use (3)
and (4), as MMSED-Khajehnouri/Krishna (MMSED-KK)
and MMSED-Lee (MMSED-L) respectively. We also call
the cooperative system proposed by Krishna et al. [19]
as MMSED-Krishna (MMSED-K). We note th at, both
MMSED-KK and MM SED-L require
or forward CSI at
the relay
from (3) and (4) respectively.
In our strategy, we minimize the MSE at the relays resulting
in precoders that do not depend on forward CSI, an d use leaked
signals to improve the performance. Let us now derive the pre-
coders for MMSER-
for any .
A. MMSER Precoder Matrix at
In our proposed MMSER scheme, each layer obtains an es-
timate of the signal vector
. This estimate or a scaled version
of this estimate can be transmitted, subject to the sum transmit
power constraint for each layer of relays. Expanding the expres-
sion of the M SE given in (2), we get
(5)
Now,theestimateisobtainedbynding the optimum
given by , subject to the constraint
. We write the constraint function as
(6)
and let
. This problem is an
MMSE estimation pro blem with a convex constraint on the esti-
mate. It is a convex optimization problem with a unique solution
as discussed in [25].
Now, given the optimization variable
,
the c ost function
and th e inequality
constraint function
,wedene the La-
grangian
as
(7)
where
is the Lagrange multiplier and the do main of
.
Claim 1: (1) When the relays cooperate, the optimum pre-
coder matrix
is given by
(8)
where
(2) When the relays do not cooperate, the o ptimum precoder
vector
is given by
(9)
where
(10)
(11)
and
.
.
.
.
.
.
.
.
.
(12)
Here
and represent the th diagonal elements
of
and re-
spectively.
Proof: See Appendix A.
We notice the similarity of (8) and (9), where and
are ana logous to and respectively, except for the extra
summing operator in the denominator in (9).
For the non-cooperative case, the optimum precoder
,is
made from the optimum vectors,
, by noting that these vec-
tors give the
th diagonal elements of all submatrices,
, that make up the p reco der.
The sum transm it power constraint at each layer allows for
optimal allocation o f power among the relays depending on the
quality of the estimate at each relay. Specializing (8) to layer 1,
we get
(13)
as
and from
Tab le I. F ro m (13), we can observe that the relays with better
backward channels are allocated more power.
B. Information Required for MMSER Precoders
From (8) and (9), we can see that the precoders of
MMSER depend on two co rrelation matrices
and
. From Table I, we see that, these matrices depend on
(if ,thenon ), and the
precoder matrices
for .Since (see (13 ))
depends only on backward CSI at
, the information req uir e d
to construct
at is also the backward CSI at . Therefore,
MMSER-
does n ot require forward CSI.
IV. E
XTENSION OF MMSED SCHEMES
Derivation of precoders for MMSED schemes, MMSED-KK
and MMSED-L ((3) and (4) give the diago nal e lem ents of t he
precoders of these schemes for
), is complicated when
. The sy stem in [23] has two layers, i.e., ,andthe
precoders are obtained iteratively. In this S ection, we enhance
the MMSED strategies (though these enhancements may not be
optimal) proposed in [ 18], [19], and [21] to obtain closed-form
solutions to precoders in a multi-lay er network for meaningful
comparison with the MMSER-
system proposed in this paper.
We call these systems E-MMSED, for Enhanced-MMSED sys-
tems, and nd their precoders to be dependent on global CSI as
shownin(17)and(18).

ELAMVAZHUTHI et al.: MMSE STRATEGY AT RELAYS WITH PARTIAL CSI 275
A. E-MMSED Strategy
For a meaningful comparison, we consider the total number
of phases as
, and the total power transmitted as to
bethesameasthatusedbyMMSER.Weassume:Stransmits
times in as many phases; all the relays average their received
signals and transmit
timesinasmanyphases.
Thus,Dwouldhaveavectorof
received signals.
Stransmits
repeatedly times from phase zero
to phase
, and the relays follow suit transmitting a signal
vector
, which is explained later, from p hase to . For each
of these transmissions, wh en S transmits or the relay s transm it,
the channel does not va ry as we assume a slow varying channel.
Hence, the average power
can be equally divided in various
phases when S transmits and
when the relays transmit. Thus,
Watts and Watts respectively, with
, t he total power available.
The relays in all the layers would receive in phase
, a vector given by
(14)
.
.
.
.
.
.
with .
We assume that all the relays transmit together in their trans-
mission phases, as though they are in a single layer. We also
assume that the noise is uncorrelated, i.e.,
where when and when is
the Kronecker delta function.
The relays average all the signals received and repeat trans-
mission of the sign al
in phases to ,where
(15)
from (14). As
is a di-
agonal precoder matrix, let us dene it as
where is the multiplying factor of the relay .
From (15),
becomes
(16)
which is transmitted
times, so that the total number of phases
would be
, the same as that of MMSER.
Now, we will derive precoders for enhanced MMSED-KK
(E-MMSED-KK) and enhanced MMSED-L (E-MMSED-L)
schemes.
1) Precoder of E-MMSED-KK: We take (3) and replace
,
the power t ransmitted by S , with
and , the power trans-
mitted by the relays, with
, as we allocate fractions of
powers to them due to their multiple transmissions. Further, the
noise variance
is replaced by ,sincethenoisevari-
ance at each of the relays
after
averaging over the
phases (in (15)) is . Therefore,
we get
and a diagonal element of
theprecoderofE-MMSED-KKas
(17)
2) Precoder of E-MMSED-L: Similarly, to get the diagonal
elements of the precoder of E-MMSED-L, we replace the signal
power transmitted and noise varian ce as in E-MMSED-KK into
(4) to get its diagonal element
as
(18)
We note that in both (17 ) and (18), we have a double summation
inthedenominatorinsteadofasinglesummation,when
is
greater than 1. Also, w e see that in both cases, the relay
needs forward CSI .
B. Selection of
Let us now select the best and use it while comparing
its performance with MMSER-
system. As it is hard to derive
BER, we obtain SNR at D for any
and attempt to select the
value of
that maximizes it.
In phase
, D receives a scalar
(19)
where
.Substi-
tuting (16) into ( 19), we get
where
(20)
are respectively, the signal and noise components of the received
signal in phase
, without considering the noise that is add ed
at D . We do not take the noise added at D with these compo -
nents, as it is not consid ered while derivin g optimum precoder in
MMSED. Now, we concatenate these components in D into vec-
tors as
and .
The signal and noise powers from these vectors a re d e
ned
as
(21)

Citations
More filters
Journal ArticleDOI
TL;DR: This paper develops a new joint relay-and-antenna selection procedure, which determines the best subset of the available antennas possibly belonging to different relays, and shows that the proposed design offers a significant performance gain, outperforming also other recently proposed relay/ant antenna selection schemes.
Abstract: This paper deals with the problem of jointly designing the source precoder, the relaying matrices, and the destination equalizer in a multiple-relay amplify-and-forward (AF) cooperative multiple-input multiple-output (MIMO) wireless network, when partial channel-state information (CSI) is available. Specifically, the considered approaches are based on the knowledge of instantaneous CSI of the first-hop channel matrix, whereas only statistical CSI of the second-hop channels is assumed. In such a scenario, with respect to the case when instantaneous CSI of both the first- and second-hop MIMO channel matrices is exploited, existing network designs exhibit a significant performance degradation. Relying on a relaxed minimum-mean-square-error (MMSE) criterion, we show that the design based on the potential activation of all possible antennas for all available AF relays leads to a mathematically intractable optimization problem. Therefore, we develop a joint relay-and-antenna selection procedure that determines the best subset of the available antennas possibly belonging to different relays. Monte Carlo simulations show that, compared to designs based on the selection of the best relay, the proposed strategy offers a significant performance gain, by also outperforming other recently proposed relay/antenna selection schemes.

1 citations


Cites background from "An MMSE Strategy at Relays With Par..."

  • ...These assumptions are justified since, in some systems, the relays may be able to exchange information among themselves before transmission [32]....

    [...]

References
More filters
Book
01 Mar 2004
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Abstract: Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subject, this book shows in detail how such problems can be solved numerically with great efficiency. The focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. The text contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

33,341 citations

Journal ArticleDOI
TL;DR: A generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas and it is shown that many of the codes presented here are optimal in this sense.
Abstract: We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.

7,348 citations

Journal ArticleDOI
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
Abstract: Mobile users' data rate and quality of service are limited by the fact that, within the duration of any given call, they experience severe variations in signal attenuation, thereby necessitating the use of some type of diversity. In this two-part paper, we propose a new form of spatial diversity, in which diversity gains are achieved via the cooperation of mobile users. Part I describes the user cooperation strategy, while Part II (see ibid., p.1939-48) focuses on implementation issues and performance analysis. Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.

6,621 citations

Journal ArticleDOI
TL;DR: This work develops and analyzes space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network and demonstrates that these protocols achieve full spatial diversity in the number of cooperating terminals, not just theNumber of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes.
Abstract: We develop and analyze space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a manner that the destination terminal can average the fading, even though it is unknown a priori which terminals will be involved. In particular, a source initiates transmission to its destination, and many relays potentially receive the transmission. Those terminals that can fully decode the transmission utilize a space-time code to cooperatively relay to the destination. We demonstrate that these protocols achieve full spatial diversity in the number of cooperating terminals, not just the number of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes. We discuss issues related to space-time code design for these protocols, emphasizing codes that readily allow for appealing distributed versions.

4,385 citations

Journal ArticleDOI
TL;DR: In this article, the capacity of the Gaussian relay channel was investigated, and a lower bound of the capacity was established for the general relay channel, where the dependence of the received symbols upon the inputs is given by p(y,y) to both x and y. In particular, the authors proved that if y is a degraded form of y, then C \: = \: \max \!p(x,y,x,2})} \min \,{I(X,y), I(X,Y,Y,X,Y
Abstract: A relay channel consists of an input x_{l} , a relay output y_{1} , a channel output y , and a relay sender x_{2} (whose transmission is allowed to depend on the past symbols y_{1} . The dependence of the received symbols upon the inputs is given by p(y,y_{1}|x_{1},x_{2}) . The channel is assumed to be memoryless. In this paper the following capacity theorems are proved. 1)If y is a degraded form of y_{1} , then C \: = \: \max \!_{p(x_{1},x_{2})} \min \,{I(X_{1},X_{2};Y), I(X_{1}; Y_{1}|X_{2})} . 2)If y_{1} is a degraded form of y , then C \: = \: \max \!_{p(x_{1})} \max_{x_{2}} I(X_{1};Y|x_{2}) . 3)If p(y,y_{1}|x_{1},x_{2}) is an arbitrary relay channel with feedback from (y,y_{1}) to both x_{1} \and x_{2} , then C\: = \: \max_{p(x_{1},x_{2})} \min \,{I(X_{1},X_{2};Y),I \,(X_{1};Y,Y_{1}|X_{2})} . 4)For a general relay channel, C \: \leq \: \max_{p(x_{1},x_{2})} \min \,{I \,(X_{1}, X_{2};Y),I(X_{1};Y,Y_{1}|X_{2}) . Superposition block Markov encoding is used to show achievability of C , and converses are established. The capacities of the Gaussian relay channel and certain discrete relay channels are evaluated. Finally, an achievable lower bound to the capacity of the general relay channel is established.

4,311 citations

Frequently Asked Questions (12)
Q1. What have the authors contributed in "An mmse strategy at relays with partial csi for a multi-layer relay network" ?

The authors consider a relay network with a single source-destination pair and multiple layers of relays between them. Unlike existing work, the authors also assume that the destination and all the forward layers present between the transmitting layer and the destination receive signals during every transmission phase. The authors show using simulations that their scheme approaches the bit-error-rate ( BER ) performance of this scheme, when is increased, even with partial CSI. 

Analytical performance evaluation remains a valuable future work. Also, and are given by respectively, which can be found using Table I. Now, expanding ( 6 ), the authors get ( A4 ) Substituting ( A1 ) and ( A4 ) into ( 7 ), they get ( A5 ) Now, they will derive for the case when the relays are cooperative. From ( A13 ) and ( A15 ), ( A5 ) becomes ( A16 ) Differentiating ( A16 ) w. r. t. the conjugate of the precoder matrix diagonal element, and simplifying, the authors get ( A17 ) From complementary slackness, they get or ( A18 ) Equation ( A17 ) can be written in matrix form as ( A19 ) where, and are as defined in ( 10 ), ( 11 ), and ( 12 ) respectively. APPENDIX PROOF OF CLAIM 2: SNR OF E-MMSED Using ( 20 ), in ( 21 ) can be expanded as ( A21 ) using the diagonal properties of and. 

In various phases, the layer would have received vectors each of size from previous transmissions, starting from phase till phase , where . 

For the non-cooperative case, the optimum precoder , is made from the optimum vectors, , by noting that these vectors give the th diagonal elements of all submatrices,, that make up the precoder. 

The sum transmit power constraint at each layer allows for optimal allocation of power among the relays depending on the quality of the estimate at each relay. 

In their strategy, the authors minimize the MSE at the relays resulting in precoders that do not depend on forward CSI, and use leaked signals to improve the performance. 

Jing and Hassibi [1] proved that Jing-Hassibi Scheme (JHS) achieves maximum SNR at D when power is equally divided between S and the relays; i.e., . 

the authors study the behavior of MMSER, E-MMSED-KK, and E-MMSED-L by varying the following parameters: total number of layers, , number of transmissions by S, and power allocated to S. 

The authors take (3) and replace , the power transmitted by S, with and , the power transmitted by the relays, with , as the authors allocate fractions of powers to them due to their multiple transmissions. 

When the relays do not cooperate, the optimum precoder vector is given by(9)where(10)(11) and... . . ....(12)Here and represent the th diagonal elements of and respectively. 

B. Information Required for MMSER Precoders From (8) and (9), the authors can see that the precoders of MMSER depend on two correlation matrices and . 

The optimum can be obtained as(27)where(28)... . . .... (29)The authors note that, prime is used over in correlation matrix to identify it to be a scalar unlike in (A2).