A REPORT OF V-BLAST TECHINIQUE UTILIZATION

FOR DETECTING SIGNAL UNDER RICH SCATTERING

ENVIRONMENT


I. Introduction why using V-BLAST?
Multipath is a phenomenon in wireless communication that causes
Intersymbol Interference (ISI). A new idea have been investigate for
a long time is that we employ it instead of mitigating it. This idea had
a base on MIMO wireless channel while there are many paths to
transmit data signal between M transmitters and N receivers.
In this system, channel is complex and all channels contribute a
channel matrix:
[

]

Where

is the a complex path between transmitter j to

receiver i
Note that, for simplicity, the channel we only consider here is the
time-invariant channel.
The problem is how to detect received symbols under ISI in addition
with noise in MIMO channel. One approach is utilizing V-BLAST. This
technique brings out spectral efficiency of 20 40 bps/Hz under rich-
scattering wireless channel. This result is unattainable using
traditional techniques.

II. System Overview

VBLAST is a detection technique based on BLAST (Bell Laboratories
Layered Space-Time) architecture and the older version of V-BLAST
is D-BLAST (Diagonally-Layered Space Time Architecture). D-BLAST
utilizes multi-element antenna arrays at both transmitter and
receiver and an elegant diagonally-layered coding structure in which
code blocks are dispersed across diagonals in space-time. In an
independent Rayleigh scattering environment, this processing
structure leads to theoretical rates which grow linearly with the
number of antennas (assuming equal numbers of transmit and
receive antennas) with these rates approaching 90% of Shannon
capacity.
However, the diagonal approach suffers from certain implementation
complexities which make it inappropriate for initial implementation.
Therefore, in this report we describe a simplified version of BLAST
known as vertical BLAST or V-BLAST.

A high-level block diagram of a BLAST system is shown in this figure
below.


Figure 1: V-BLAST high level system diagram
A single data stream is demultiplexed into M substreams, and each
substream is then encoded into symbols and fed to its respective
transmitter. (The encoding process is discussed in more detail
below). Transmitter 1 M operate co-channel at symbol rate 1/T
symbols/sec, with synchronized symbol timing. Each transmitter is
itself an ordinary QAM transmitter. The collection of transmitters
comprises a vector-valued transmitter, where components of each
transmitter M-vector are symbols drawn from a QAM constellation.
We assume that the same constellation is used for each substream
and that the transmission are organized into burst of L symbols. The
power launched by each transmitter is proportional to 1/M so that
the total radiated power is constant and independent of M
Receivers 1 N are, individually, conventional QAM receivers. These
receivers also operate co-channel, each receiving the signals radiated
from all M transmit antennas.
For simplicity, flat fading is assume and matrix channel between M
transmitters and N receivers is defined

III. VBLAST Detection
We take a discrete-time baseband view of detection process for a
single transmitted vector symbol, assuming symbol-synchronous
receiver sampling and ideal timing.
Let transmit symbol vector is:
a =

The received N-vector is:

Where H is channel matrix ; v is n=Gauss noise vector
In general, we can employ some technique to perform detection of
the receive symbol vector such as Maximum Likelihood decoding (ML),
Zero-Forcing algorithm (ZF) and Minimum Mean Square Error algorithm
(MMSE)
For considering here, we use ZF-VBLAST algorithm to detect the received
signal. ZF-VBLAST based on ZF criterions those are:
The information about channel is exactly know at receiver
Linear combinatorial nulling
Conceptually, in linear combination nulling, each substream in turn is
considered to be the desired signal, and the remainder are considered as
interferers.
Nulling is perform by linearly weighting the received signals so as to satisfy
zero-forcing criterion:

{
if i j
otherises

Decision statistic of the i-th substream is:

(1)
(2)
This nulling vector is required to orthogonal to M-1 columns of H at each
state. Since this is the constrained condition to obtain and the complexity is
high.
Another approach is ZF-VBLAST algorithm. It exploits the timing
synchronism inherent in the system model and use symbol cancellation as
well as linear nulling to perform detection. Using symbol cancellation,
interference effect from already-detect components of a is subtracted out
from the received symbol vector resulting in a modified received vector.

The detection process proceeds generally as figure below:


Figure: VBLAST decoder block diagram

Assume the ordered set {

} is a permutation of the
integers 2M. S is the ordering set tht symbols of a is detected.
Step 1: using nulling vector

, form decision statistic

Step 2: Slide

to obtain

Step 3: Assuming that

, cancel

from the received vector

, resulting in modified received vector

Where

denotes the

-th column of H
(3)
(4)
(5)
[

] [

[
h

]
[

] [

] [

]
Assumed here

is detected accurately.
This mens tht the chnnel mtrix becomes deflted:
[

]

The deflted version of H is helpful in eliminate the interference effect of
detected component

of a and reduces constrained condition in choosing

nulling vector. In other words, minimize the complexity of overall system
performance.
Step 1 3 are then performs for components

by operating in
turn on the progession of modified received vectors

The specifically of ZF-VBLAST is we have to choose the nulling vector to
satisfy:

{




The unique nulling vector satisfying (6) is the

-th row of

, where the
notation

denotes the matrix obtained by zeroing column

of
H. This zeroing is perform in step3: symbol cancellation.

denotes the
Moore-Penrose pseudoinverse of H.
(6)
Because [

] is MIMO channel matrix, has M<N and

Each column vector of H stands for all the channel radiated from one
transmitter to all receiver. Because each transmitter is independent to
others so, the column vectors of matrix H is independent.
Follow [6], Moore-Penrose pseudoinverse matrix

can be decomposed
into:

Where:

is the conjugate transpose of comple matrix H

We have the post-detection SNR formulation for the

-th detected element

of a is obtain by:

Where the expectation in the numerator is taken over the
constellation set
Since different choosing nulling vector

make different post-detection

SNR. Therefore we need to choose a optimum ordering that we get the
locally maximization of SNR

at each stage, then make the optimum

overall system performance.

IV. Optimum Detector Ordering
Because of using vector cancellation, the order of element of transmit
vector a is detected becoming more important to the overall system
performance than the utilization of pure nulling. In particular, if pure
nulling is used at each stage, the nulling vector

is required to be
orthogonal to M-1 columns of channel matrix H. However, when symbol
cancellation is in addition to nulling,

is only required to be orthogonal

only to the M-i columns of channel matrix H.
As a consequence of the Cauchy-Schwartz inequality is that the more
columns of H that a particular

is constrained to be orthogonal to, the

larger its norm and according to (7) the smaller it post-detection SNR.
(7)
An approach for obtaining the optimum ordering is at each stage, pick the
symbol that provides the maximum SNR. The sequence of locally optimized
symbols is identical to the globally optimized sequence. Therefore the
optimum ordering set S

is obtain
The full ZF VBLAST detection algorithm can be described as a recursive
procedure, including determination of the optimal ordering, as follow:
Intialization:
i 1

(8b)
k

rgmin

c
Recursion

d
y

(y

) f

(8h)
k

rgmin

j k

i
i i j
Where:

is the j-th row of

(8c),(8i) determine the elements of optimum ordering set S

(8d-f) compute respectively the ZF-nulling vector, decision
statistic, and the estimated component of a
(8g) performs cancellation of the detected component from the
received vector
(8h) computes the new pseudoinverse is based on a deflated
version of H, in which column k

have been zeroed.