PROCESAMIENTO DE SEÑAL

EN SISTEMAS
INALÁMBRICOS
MAESTRIA EN INGENIERÍA
ÁREA TELECOMUNICACIONES
Universidad Pontificia Bolivariana

Leonardo Betancur Agudelo

leonardo.betancur@upb.edu.co 1
Contenido

Sistemas MIMO
z Modelado de canales MIMO
z Desvanecimiento rápido en canales MIMO
z Desvanecimiento lento en canales MIMO
z Arquitecturas de receptores
z Arquitectura V-BLAST
z Arquitectura D-BLAST
z Multiplexación y diversidad
z Enlaces en sistemas MIMO
z Evaluación de capacidad en sistemas MIMO

2
Suposiciones Generales

z Canal con desvanecimiento plano

(Bcoh>> 1/ Tsymb)
z Canal con slow fading (Tcoh>> Tsymb)
z nr receptores y nt transmisores (antenas)
z Sistema de ruido limitado (no CCI)
z Los receptores estiman perfectamente el
canal
z Solo se considera diversidad espacial

3
Sistema MIMO en General

4
Sistema MIMO en General
h11
s1 y1
h12

s2 . y2
User data stream User data stream
. .
. .
. Channel
. .
sM Matrix H yM

s y
y = Hs + n
Transmitted vector Received vector
MT
h11 h21 …….. hM1 hij is a Complex Gaussian
h12 h22 …….. hM2 random variable that models
Where H = M fading gain between the ith
R
. . …….. . transmit and jth receive
h1M h2M …….. hMM antenna

5
Sistema MIMO en General

z Ambiente de Radio propagación

6
Ventajas de Sistemas MIMO

z Incrementa la eficiencia espectral de un

sistema inalámbrico significativamente.
z Permite generar diversidad de ganancia para
mitigar los efectos de desvanecimiento del
canal.
z Codificación de Canal puede incorporar un
mejor desempeño del sistema

7
Diversidad en recepción típica

H11

H21

⎡ PT *⎤
C = log 2 det ⎢I + 2 HH ⎥
⎣ σ nt ⎦

= log2[1+(PT/σ2)·|H|2] [bit/(Hz·s)]
Capacity increases logarithmically
H = [ H11 H21]
with number of receive antennas...

8
Diversidad de transmisión /
Beamforming
H11

H12

Cdiversity = log2(1+(PT/2σ2)·|H|2) [bit/(Hz·s)]

Cbeamforming = log2(1 +(PT/σ2 )·|H|2) [bit/(Hz·s)]

• 3 dB SNR increase if transmitter knows H

• Capacity increases logarithmically with nt

9
Multiple Input Multiple Output
⎡H H12 ⎤
H11 H = ⎢ 11
⎣ H 21 H 22 ⎥⎦
H21
H12

H22
Where the λi are the
Cdiversity = log2det[I +(PT/2σ2 )·HH†]= eigenvalues to HH†

⎡ PT ⎤ ⎡ PT ⎤
= log 2 ⎢1 + λ1⎥ + log 2⎢1 + λ 2⎥
⎣ 2σ ⎦ ⎣ 2σ ⎦
2 2

Interpretation:
λ1
Transmitter Receiver
λ2
m=min(nr, nt) parallel channels, equal power allocated to each ”pipe”

10
Tipos de Canal

11
Canales con Desvanecimiento
z Fading refers to changes in signal amplitude and phase caused by the
channel as it makes its way to the receiver
z Define Tspread to be the time at which the last reflection arrives and Tsym to
be the symbol time period Time-spread of signal
Frequency-selective Frequency-flat
Tspread Tspread

time time
Tsym Tsym

freq freq
1/Tsym 1/Tsym
Occurs for wideband signals (small Tsym) Occurs for narrowband signals (large Tsym)
EASIER! Fading gain is complex Gaussian
TOUGH TO DEAL IT!
Multipaths NOT resolvable

12
Matriz del Canal H
z In addition, assume slow fading
z MIMO Channel Response

Channel Time-variance

Time-spread
z Taking into account slow fading, the MIMO channel impulse response is constructed as,
a and b are transmit and
receive array factor vectors
z Because of flat fading, it becomes, respectively. S is the
complex gain that is
dependant on direction and
delay. g(t) is the transmit
and receive pulse shaping
• With suitable choices of array geometry and antenna element patterns, impulse response
H( ) = H which is an MR x MT matrix with complex Gaussian i. i. d random variables
• Accurate for NLOS rich-scattering environments, with sufficient antenna spacing at
transmitter and receiver with all elements identically polarized

13
Valores propios del Canal
Orthogonal channels HH† =I, λ1= λ2= …= λm= 1

m
⎡ P ⎤
Cdiversity = ∑ log 2 ⎢1 + 2T λi ⎥ = min(nt , nr ) ⋅ log 2 (1 + PT / σ 2 nt )
i =1 ⎣ σ nt ⎦

• Capacity increases linearly with min( nr , nt )

• An equal amount of power PT/nt is allocated
to each ”pipe”

Transmitter Receiver

14
Capacidad de Canales MIMO
H unknown at TX H known at TX

⎡ PT *⎤
m
⎡ pi λi ⎤
C = log 2 det ⎢ I + 2 HH ⎥ = C = ∑ log 2 ⎢1 + 2 ⎥
⎣ σ nt ⎦ i =1 ⎣ σ ⎦
m
⎡ PT ⎤
= ∑ log 2 ⎢1 + 2 λi ⎥ Where the power distribution over
⎣ σ nt ⎦
”pipes” are given by a water filling
i =1
solution
+
m = min(nr , nt )
m m
⎛ 1⎞
PT = ∑ pi = ∑ ⎜⎜ν − ⎟⎟
i =1 i =1 ⎝ λi ⎠
p1 λ1
p2 λ2
p3 λ3
p4 λ4
15
Capacidad de Canales MIMO
y = Hs + n
z Let the transmitted vector s be a random vector to be very general and n is normalized noise.
Let the total transmitted power available per symbol period be P. Then,

C = log 2 (IM + HQHH) b/s/Hz

where Q = E{ssH} and trace(Q) < P according to our power constraint

z Consider specific case when we have users transmitting at equal power over the channel and
the users are uncorrelated (no feedback available). Then,

CEP = log 2 [IM + (P/MT)HHH] b/s/Hz

Telatar showed that this is the optimal choice for blind transmission

z Foschini and Telatar both demonstrated that as MT and MR grow,

CEP = min (MT,MR) log 2 (P/MT) + constant b/s/Hz

Note: When feedback is available, the Waterfilling solution is yields maximum capacity but converges to equal power capacity at
high SNRs

16
Capacidad (continuacion)
z The capacity expression presented was over one realization of the channel.
Capacity is a random variable and has to be averaged over infinite realizations to
obtain the true ergodic capacity. Outage capacity is another metric that is used to
capture this

z So MIMO promises enormous rates theoretically! Can we exploit this

practically?

17
Modelos de Canal y limitaciones por
Retardo
• In stochastic channels,
the channel capacity becomes a random
variable

Define : Outage probability Pout = Pr{ C < R }

Define : Outage capacity R0 given a outage
probability Pout = Pr{ C < R0 }, this is the delay
limited capacity.

Outage probability approximates the

Word error probability for coding blocks of approx length100

18
Ejemplo : Canal Rayleigh
Hij∝ CN (0,1)
Ordered eigenvalue
distribution for
nr= nt = 4 case.

nr=1 nr= nt

19
Criterios de Diseño
z MIMO Systems can provide two types of gain

Spatial Multiplexing Gain Diversity Gain

• Maximize transmission rate • Minimize Pe (conservative

(optimistic approach) approach)
• Use rich scattering/fading to • Go for Reliability / QoS etc
your advantage
• Combat fading

z If only I could have both! As expected, there is a tradeoff

z System designs are based on trying to achieve either goal or a

little of both

20
Diversidad
z Each pair of transmit-receive antennas provides a signal path
from transmitter to receiver. By sending the SAME
information through different paths, multiple independently-
faded replicas of the data symbol can be obtained at the
receiver end. Hence, more reliable reception is achieved
z A diversity gain d implies that in the high SNR region, my Pe
decays at a rate of 1/SNRd as opposed to 1/SNR for a SISO
system
z The maximal diversity gain dmax is the total number of
independent signal paths that exist between the transmitter
and receiver
z For an (MR,MT) system, the total number of signal paths is
MRMT
1 ≤ d ≤ dmax= MRMT
z The higher my diversity gain, the lower my Pe

21
Multiplexación Espacial
y = Hs + n Æ y’ = Ds’ + n’ (through SVD on H)
where D is a diagonal matrix that contains the eigenvalues of HHH

z Viewing the MIMO received vector in a different but equivalent

way,
CEP = log 2 [IM + (P/MT)DDH] = m log 2 [1 + (P/MT)‫ג‬i] b/s/Hz
∑
i =1

z Equivalent form tells us that an (MT,MR) MIMO channel opens

up
m = min (MT,MR) independent SISO channels between the
transmitter and the receiver

z So, intuitively, I can send a maximum of m different information

symbols over the channel at any given time
22
Sistemas Prácticos
1 rs : number of different
R bits/symbol 2 symbols N transmitted
Space-
in T symbol periods
Channel Symbol .
coding mapping Time
Coding . rs = N/T
MT
Redundancy in time
Coding rate = rc Space- time redundancy over T Non-redundant
symbol periods portion of symbols
Spatial multiplexing gain = rs
Spectral efficiency = (R*rc info bits/symbol)(rs)(Rs symbols/sec)
w
= Rrcrs bits/s/Hz assuming Rs = w
rs is the parameter that we are concerned about: 0 ≤ rs ≤ MT

** If rs = MT, we are in spatial multiplexing mode (max transmission

rate)
**If rs ≤ 1, we are in diversity mode

23
Aprovechando un Canal MIMO

Bell Labs Layered

Space Time Architecture

• nr ≥ nt required
• Symbol by symbol detection.
Time
Using nulling and symbol
cancellation
Antenna

s1 s1 s1 s1 s1 s1
s2 s2 s2 s2 s2 s2 V-BLAST • V-BLAST implemented -98
s3 s3 s3 s3 s3 s3
by Bell Labs (40 bps/Hz)
s0 s1 s2 s0 s1 s2
s0 s1 s2 s0 s1 D-BLAST • If one ”pipe” is bad in BLAST
s0 s1 s2 s0 we get errors ...

24
 V-BLAST
z This is the only architecture that goes all out for maximum rate.

s1 y1

User data s2 y2 V-BLAST User data

. H .
stream . .
Processing stream
. .
. sM yM .

MT ≤ MR
s y
z Split data into MT streams Æ maps to symbols Æ send
z Assume receiver knows H
z Uses old technique of ordered successive cancellation to recover
signals
z Sensitive to estimation errors in H
z rs = MT because in one symbol period, you are sending MT different
symbols

25
V-BLAST
z The prototype in an indoor environment was operated at a carrier frequency of
1.9 GHz, and a symbol rate of 24.3 ksymbols/sec, in a bandwidth of 30 kHz with
MT = 8 and MR = 12
z Results shown on Block-Error-Rate Vs average SNR (at one received antenna
element); Block = 100 symbols ; 20 symbols for training

• Each of the eight substreams utilized uncoded

16-QAM, i.e. 4 b/symb/trans

• Spec eff = (8 xmtr) ( 4 b/sym/xmtr )(24.3 ksym/s)

30 kHz
= 25. 9 bps/Hz

z In 30 kHz of bandwidth, I can push across 621Kbps of data!! Wireless

spectral efficiencies of this magnitude are unprecedented, and are
furthermore unattainable using traditional techniques
26
Receptores Alternantes
z Can replace OSUC by other front-ends; MMSE, SUC,
ML for instance

OSUC

ML

27
D-BLAST
z In D-BLAST, the input data stream is divided into sub streams which
are coded, each of which is transmitted on different antennas time
slots in a diagonal fashion
z For example, in a (2,2) system

• receiver first estimates x2(1) and then

estimates x1(1) by treating x2(1) as
interference and nulling it out

• The estimates of x2(1) and x1(1) are fed to a

joint decoder to decode the first substream
MT ≤ MR

• After decoding the first substream, the receiver cancels

the contribution of this substream from the received signals
and starts to decode the next substream, etc.
• Here, an overhead is required to start the detection process;
corresponding to the 0 symbol in the above example
• Receiver complexity high

28
Alamouti
z Transmission/reception scheme easy to implement
z Space diversity because of antenna transmission. Time diversity
because of transmission over 2 symbol periods
z Consider (2, MR) system

z Receiver uses combining and ML detection

z rs = 1

V-BLAST SUC
• If you are working with a (2,2)
system, stick with Alamouti!
Alamouti
• Widely used scheme: CDMA
2000, WCDMA and IEEE 802.16-
2004 OFDM-256

29
Comparaciones

Scheme Spectral Pe Implementation

Efficiency Complexity
V-BLAST HIGH HIGH LOW

D-BLAST MODERATE MODERATE HIGH

ALAMOUTI LOW LOW LOW

30
MIMO y Beamforming

Requires that channel H is known at the transmitter

Is the capacity-optimal transmission strategy if
1 1
− ≥ SNR
λ2 λ1
Which is often true for line of sight (LOS) channels

Only one ”pipe” is used

Cbeamforming = log2(1+SNR·λ1) [bit/(Hz·s)]

31
Capacidad de Sistemas MIMO

z La capacidad con Energía constante:

⎛ ρ H ⎞
⎜
C = E H log 2 det⎜ I N R + HH ⎟⎟
⎝ NT ⎠

H is the complex channel matrix

ρ is the signal/noise at each RX antenna
N T is the number of TX antennas
N R is the number of RX antennas

32
Receptor BLAST

z Las antenas detectan por turnos, usando

cancelación de interferencia donde sea posible.

33
Turbo Codificación y Diseño de
Receptores
Log likelihood ratio (LLR)

Pr (x = +1)
Λ ( x) = log
Pr( x = −1)
Combining LLR’s

Λ MAP = Λ EXT + Λ A + Λ S
= extrinsic + a priori + soft output

34
Combinación Mutua de Información

z Combining LLR’s
Λ EXT = Λ MAP − ( Λ A + Λ S )
⎡Λ ⎤
= Λ MAP − [wA wS ] ⎢ A ⎥
⎣ ΛS ⎦
= Λ MAP − wT Λ
= Λ MAP − wT (λ + ε )

z Optimum weights
(
w opt ,i = arg max I wT Λ i , λ i
w
)

35
Ejemplo MIMO en HSPDA
4x4 MIMO radio link

z Objective: Increase DL user data-rates through a combination of code re-use

across transmit antennas and high-order modulation schemes.
z Code re-use results in high levels of interference, even in non-dispersive
channel conditions. This can be particularly disruptive when using high-
order modulation schemes such as 16- and 64-QAM.

36
Receptor No Iterativo para MIMO

z No iterations occur between the detector and decoder.

z Both the detector and decoder can be iterative or non-iterative.
z Space-Time channel equalization for orthogonalization of the received signatures in
dispersive channel conditions is optional.

37
Receptores Iterativos para MIMO

z Iterations occur between the detector and decoder (and possibly equalizer).
z Both the detector and decoder can be iterative or non-iterative.
z The more reliable decoder soft-outputs (LLRs or Extrinsic Information) are used to
improve the detection (or optionally also the equalization) in an iterative process.
z Space-Time channel equalization is again optional for dispersive channels.

38
Receptores Iterativos

♦ The complex APP detector is replaced by a low-complexity Successive Interference

Canceller based on matched filter (rake) detection units (MF-SIC). High performance is
achieved via iterations with a turbo-decoder in conjunction with soft-output combining.
♦ With soft-output combining, soft-outputs computed in the current iteration are combined
with those from the previous iteration. This suppresses convergence instabilities
caused by incorrect cancellations. Combining weights are computed off-line in order to
maximize the Mutual Information [Cla-03a] [Cla-03c] after each combining operation.
[Cla-02] H.Claussen, H.R.Karimi, B.Mulgrew, “A Low Complexity Iterative Receiver based on Successive Cancellation for MIMO”,
Personal Wireless Communications 2002, October 2002, Singapore.
[Cla-03a] H.Claussen, H.R.Karimi, B.Mulgrew, “Layered Encoding for 16- and 64-QAM iterative MIMO Receivers”,
5th European Personal Mobile Communications Conference, April 2003, Glasgow, UK
[Cla-03c] H.Claussen, H.R.Karimi, B.Mulgrew, “Improved Max-Log MAP Turbo-Decoding using Maximum Mutual Information Combining”,
September 2003, PIMRC 2003, Bejing, 2003
39
Receptore Iterativos
♦ The received signal observed over the tth symbol epoch may be
written as
NT K
r (t ) = ∑∑ a k (t ) xkn (t ) + ISI + v(t )
n
∈ C N R (Q +W −1)×1
n =1 k =1

Iteration−1:
♦ Order symbols according to highest reliability (e.g. signature energies) at each symbol
epoch.
♦ Perform symbol-level MF-SIC at each symbol epoch:
• Use rake to derive hard- and soft-estimates for most reliable symbol.
n
ykn (t ) = a k (t ) H r (t )
• Subtract its contribution from the received signal.

{ }
r (t ) = r (t ) − a k (t ) sgn {Re[ ykn (t )]} + j sgn {Im[ ykn (t )]}
n

• Repeat for next most reliable symbol.

♦ De-interleave MF-SIC soft-outputs (LLRs), decode, re-interleave and finally re-apply to
MF-SIC for next iteration.
40
Receptores Iterativos
♦ Order bits according to highest reliability (decoder LLRs from
previous iteration) at each symbol epoch.
♦ Perform bit-level MF-SIC at each symbol epoch:
• Use rake to derive hard- and soft-estimates for most reliable bit.

ykn,i (t ) =
4 1
N0 2 ji
a {
n
k (t ) H
r (t ) + ( −1) i
r (t ) H
a
n
}
k (t ) i ∈ {0,1}

• Subtract its influence (based on decoder LLR from previous iteration) from
received signal.

r (t ) = r (t ) − j i a k (t ) sgn {Λ nk ,i (t )}
n

where i = 0 or 1, dependent on whether the bit of interest forms the real or

imaginary part of the 4-QAM symbol
• Repeat for next most reliable bit.
♦ Combine MF-SIC soft-outputs (LLRs) according to the Maximum Mutual Information
(MMI) principle, de-interleave, decode, combine decoder soft-outputs (MMI principle), re-
interleave and finally re-apply to MF-SIC for next iteration (q+1).

ykn,i (t ) [q ] := α ykn,i (t ) [q ] + (1 − α ) ykn,i (t ) [q − 1]

Λ nk ,i (t ) [q] := β Λ nk ,i (t ) [q] + (1 − β ) Λ nk ,i (t ) [q − 1] 41
Receptor APP

♦ Full APP joint-detection implies search over a trellis of states for 2M-QAM
and ISI extending over L symbols. For no dispersion (L=0) and re-use of K orthogonal
codes, number of states reduces to a more manageable .
♦ As a result, space-time equalization is performed first to eliminate dispersion.
The equalizer output is then de-spread for each of the codes c1… cK , resulting in
sufficient statistics z1… zK for each symbol epoch.
♦ The pre-whitened APP algorithm is applied to zk at each symbol epoch, for
joint-detection of bits transmitted from all antennas via the kth spreading code.
This is repeated for k=1…K.

42
Receptor APP
Space-Time Equalization:
♦ The received signal over N symbol epochs can be written as
K
r = H ∑ C k x k + v = HC x + v
k =1
where s=Cx is the vector of spread symbols, H is the channel matrix and v is a vector
of iid complex Gaussian variables, E{vvH}=Rv=NoI.

♦ A MMSE space-time equalizer represents a matrix V which minimizes the term

E{|| s – V r||2}. The solution to this problem is given by
V = Rs H H ( HRs H H + Rv )
−1

where Rs=E{ssH}=2CCH, since E{xxH}=2I.

♦ The equalizer attempts to eliminate the effects of the channel matrix H.

The equalizer output is then de-spread for the kth code as follows

z k = C kHV r = Tk r ≈ c k x k + Tk v ∈ C NT N ×1 k = 1...K
2
and

43
Receptor APP
Pre-whitened APP detection:
♦ Considering only the NT rows of the equalized and de-spread signal zk which
correspond to the tth symbol epoch, we have
z k (t ) = c k x k (t ) + T ∈ C NT ×1 k = 1...K
2
Nk (t )v and
u k (t )
♦ The optimum maximum a posteriori probability (MAP) soft outputs in the form of
log-likelihood ratios for each transmitted bit bk,in(t) with n=1…NT and i∈{0,1}

∑ exp
⎧ −1 −21
⎨
⎩ N0
(
Ruk (t ) z k (t ) − c k
2
) ⎫
x k (t ) + ln P{x k (t )}⎬
⎭
y ( bkn,i (t ) )
x k ( t )|bkn,i ( t ) =+1
= ln
∑
x k ( t )|bkn,i ( t ) =−1
exp
⎧ −1 −21
⎨
⎩ N0
(
Ruk (t ) z k (t ) − c k
2
) ⎫
x k (t ) + ln P{x k (t )}⎬
⎭

where uk(t)=Tk(t)v and Ruk(t)=E{uk(t)uk(t)H}=N0Tk(t)Tk(t)H.

44
Receptor APP
♦ The a posteriori probability (APP) detector, is derived by using the max-log
approximation to give

y ( b (t ) )
⎧ −21
( ) ⎫
2
≅ min − − ln P{x k (t )}⎬
n 2
k ,i ⎨ Ruk ( t ) z k (t ) c k x k (t )
x k ( t )|bk ,i ( t ) =−1 ⎩
n
⎭
⎧ −21
( ) ⎫
2
− min − − ln P{x k (t )}⎬
2
R
⎨ uk ( t ) kz ( t ) c k x k (t )
x k ( t )|bkn,i ( t ) =+1 ⎩ ⎭

♦ The approximation makes the APP detector sub-optimal. While the performance
difference may be insignificant at high SNRs, for low SNRs (range of interest) this
can no longer be ignored

45
Receptor M PIC
♦ Proposed receiver (Option 1):

♦ As in the reference receiver, space-time equalization is performed first to eliminate

dispersion. The equalizer output is then de-spread for each of the codes c1… cK ,
resulting in sufficient statistics z1… zK for each symbol epoch.
♦ The de-spread symbol outputs are processed by a pre-whitened MS-PPIC detector
(=Recursive Neural Network) in order to suppress the interference from the other
transmitter antennas [Cla-03b].

[Cla-03b] H.Claussen, H.R.Karimi, B. Mulgrew, “High Performance MIMO Receivers based on Multi-Stage Partial
Parallel Interference Cancellation”. VTC 2003 Fall, 2003

46
Receptor M PIC
Iterative Calculation of MS-PPIC (NNet) outputs:
♦ Considering only the the NT rows of the equalized and despread signal zk
corresponding to the tth symbol epoch, we have

z k (t ) = c k x k (t ) + T ∈ C NT ×1 k = 1...K
2
Nk (t )v and
u k (t )

♦ Deriving a pre-whitened statistic

− 12
wk (t ) = R z k (t ) = R x k (t ) + η k (t ) ∈ C NT ×1 where Ruk ( t ) = E{u k (t )u k (t )}
H
uk ( t )

E{η k (t )η k (t )} = I
H
and

♦ The derived statistic wk(t) will be used as input to the MS-PPIC, which is equivalent
to the bias of the Neural Network and may be written as wk,[0](t).

47
Receptor Multistage Partial PIC

z Prewhitened statistic
w = Rx +η
= (R − Δ)x + Δ x + η
z Difference equation

−1
x+Δ η = Δ −1
{w − (R − Δ)x}
48
 Receptor Multistage Partial PIC
♦ The detector shown is a multi-stage
partial parallel interference cancellation
with decision feedback within each stage
[Mos-96].
♦ The detector is equivalent to a Recursive
Neural Network as proposed for CDMA
multi-user detection in [Kho-99]. The
architecture presented here includes soft
output generation.
♦ Model for a non-linear Neuron:

[Kho-99] H.Khoshbin-Ghomash, “Low Complexity Neural Network Structure for Implementing the Optimum ML Multi-User
Receiver in a DS-CDMA Communication System”, pp. 643-647, VTC-99, The Netherlands.
[Mos-96] S. Moshavi, “Multi-User Detection for DS-CDMA Communications”, IEEE Comms Magazine, pp. 124-136, October 1996.
49
Receptor Multistage Partial PIC
♦ The detector iterations may be described as follows, where wnk,[m](t) is the nth
element of wk,[m](t) at iteration m:
for m = 1 ... M (Iterations)
u = wk ,[ m −1] (t )
for n = 1 ... NT (Antennas)
{ }
wkn,[ m ] (t ) = wkn,[0] (t ) − Rn′,: tanh (α Δ−1 Re[u ]) + j tanh (α Δ−1 Im[u ])
u n = wkn,[ m ] (t )
end
end
where Δ = diag( R) R′ = R − Δ

Soft output calculation:

♦ After sufficient iterations the detector converges and the soft outputs
can be derived:
4 Rn , n
y ( bkn,i (t ) ) = i
{wkn (t )+ (−1)i wkn (t )}
2j
50
Simulaciones
♦ 4x4 MIMO link (NT =NR=4).
♦ Spreading factor Q=16.
♦ K=16 orthogonal spreading codes, reused across all transmit antennas.
♦ Interleaving & coding block size: 1000 blocks x 5114 information bits.
♦ Rayleigh propagations channels:
♦ Flat fading at 3km/h.
♦ Dispersive fading (3 chip-spaced equal-power taps) at 3km/h.
♦ 1/3 rate, 8-state turbo encoder (HSDPA specs).
♦ Max-log MAP (soft-input, soft-output) decoding algorithm.
♦ 6 iterations of the turbo decoder.
♦ 6 iterations between MF-SIC and turbo-decoder.
♦ 6 iterations of the MS-PPIC (NNet) detector.
♦ Detector has perfect knowledge of the average channel conditions during each
transmitted block.

51
4-QAM (Flat Fading)
0
Performance comparison for 4-QAM and flat fading
10

10
-1 Target
(info-bits)

FER
Bit/Frame-Error Rate

-2
10

-3
10
standard APP - BER
standard APP - FER
MS-PPIC - BER
MS-PPIC - FER
MF-SIC - BER
-4
MF-SIC - FER
10
-6 -5 -4 -3 -2 -1 0 1
Eb/No [dB] (Eb=TX-energy/info-bits)

52
4-QAM (Dispersive Fading)
0 Performance comparison for 4-QAM and dispersive channel
10

-1 Target
10
(info-bits)

FER
Bit/Frame-Error Rate

-2
10

standard APP - BER

-3 standard APP - FER
10
MS-PPIC - BER
MS-PPIC - FER
MS-PPIC (full) - BER
MS-PPIC (full) - FER
MF-SIC - BER
-4
MF-SIC - FER
10
-6 -5 -4 -3 -2 -1 0 1
Eb/No [dB] (Eb=TX-energy/info-bits)

53
Bibliografía Sugerida
z Mobile Fading Channels. Patzöl, Matthias. Wiley. 2002. ISBN
0471495492
z Space-time Coding. Theory and Practice. Jafarkhani, Hamid. Camridge
University press. 2005. isbn 978-0-521-84291-4
z Digital Communications over Fading Channels, K. Simon, Marvin;
Alovini Mohamed-slim. Wiley. Isbn 0-471-64953-8
z Wireless Communications – Principles and Practice. Rappaport, T.
Prentice Hall
z Theory and Applications of OFDM and CDMA wideband wireless
communications. Schulce, Henrik; Luders, Christian.
z Space time processing for MIMO communications. Gershman, A.B;
Sidiropoulos N.D. Wiley
z OFDM and MC CDMA for broadband Multi User communications
WLANs and Broadcasting. Hanzo, L et al. Wiley.
z Digital Beam forming in Wireless Communications. Litva, J.

54
Preguntas

Preguntas y Sugerencias

Contacto:
leonardo.betancur@upb.edu.co
leonardobetancuragudelo@yahoo.es

55