EFFECTIVE INTERFERENCE CANCELLATION TECHNIQUE WITH ORDERINGS IN RAYLEIGH FADING

CHANNEL FOR MIMO SYSTEMS

1

Chandika Mohan Babu,IEEE Member

Assistant Professor, Wireless Communication Domain (D3)
School of Electronic and Communication Engineering,
Lovely Professional University, Punjab, India.
chandika.14736@lpu.co.in

Abstract: In this research paper we simulated a method to

enhance the performance of the MIMO systems by
interference cancellation technique. We applied the
mechanism for MIMO spatial multiplexing channels with in
the Rayleigh fading environment, followed by system model,
and planned interference cancellation strategy using effective
estimation depending on ordering patterns, then transient
discussion regarding results and conclusion were presented
with comparison. The proposed algorithm perform
interference cancellation on each parallel branch of the
receiver that already prepared with distinct orderings pattern,
it results in different branches and generates distinctive
symbol approximate vector, so at the end of the branches,
detector achieves higher detection diversity to pick the best
performed branch with proposed selection rules, during this
we use MMSE for selection, because it performs higher and it
has low complexness. Our simulation results shows that our
detector approaches performance of the best optimal detector
and complexness is low.
Keywords MIMO SYSTEMS;Raylieghfading;ordering
pattern; interference cancellation;selection rule.
I.

Suresh Kumar Megajolla

Student (M.Tech), Wireless Communication Domain (D3)
School of Electronic and Communication Engineering,
Lovely Professional University, Punjab, India.
suresh.megaja@gmail.com
and its similar versions are ordered SIC, GDFE, Decision and
linear feedback detector and PIC [8] [9].
In this paper simulations are performed with different
MIMO structure and nullifying the effect of interference in
spatial multiplexing systems for MIMO in Rayleigh fading
environment, we introduced the interference canceler on each
parallel branch that produces unique designs, thus every branch
gives distinctive symbol approximate vector, thus at the multi
branch receiver there will be a gaggle of symbol estimate
vectors. By exploiting one among the choice rule, we tend to
extract the appropriate branch which yields the best estimated
vector, we take MMSE because it has low complexity and
higher performance.
Simply, the principle is to take the advantage of the
orderings of the symbol after interference cancellation, then
detector produces group of estimate vectors, and we choose the
best branch by estimators. The produced results shows that this
work reduces error propagation and approaches optimal ML
detector. Paper compiled and shared in different sections, in II
we describe MIMO spatial multiplexing system model in
briefly. We present planned Interference cancellation Detector
in section III and discussions in IV and conclusions is
followed.

INTRODUCTION

II. MIMO SPATIAL MULTIPLEXING SYSTEM

In our literature survey, MIMO system which is recently

adapted in most of the transmission schemes with antenna
configuration to achieve gain and maximum capacity with data
rate. Recent research shown us that by using multiple input and
multiple output antennas at receiver and transmitter side we are
able to raise the capacity of the communication network.
Multiplexing gain, diversity gains will be achieved effectively.
By multiplexing gains we can get high spectral efficiency and
with diversity gains, we merge some concepts to build links
additionally more genuine and low misconception in error rates
over channel [1]-[2].
By spatial multiplexing network structure, network acquires
better data rate. In order to separate the information in the
collective side, From the designed detection techniques with
variation of application we use ML,MMSE,C.M in the system
model[3][4].We can design optimal ML detector by exploiting
sphere decoding algorithm, however complexness will be high
based on the SNR and signal constellations. DBLAST
transmission is the primary BLAST structure proposed by
Foschini [5]-[7]. Its simplified version referred as VBLAST,

Fig. 1 MIMO Spatial Multiplexing System.

First, we contemplate a MIMO spatial multiplexing system
as shown within the Fig.1 Which accompanied NT
transmission antennas and
be N R

N R receiving antennas, there should

NT .At every time instant t , it transmits NT symbol

representations,

as

NT 1 vector.

X t [ X 1 t , X 2 t , X 3 t ,......, X NT [t]]T Based

modulation constellation
the transpose. The

on

{a1 , a2 ,....., an } where . denotes

T

X t vector denotes the symbol transmits

in the flat fading channel, then at the receiver end, signals are
demodulated by N R receiving antennas and sampled. Received
signal

denoted

by

consecutive

cancellation

we

tend

to

calculate

T
%
%
%
z%
l (t ) [ z l ,1[t ], z l ,2 [t ],...., z l , NT [t ]] ,for detection of the
transmitted signal, here z%
l (t ) is NT 1 symbol approximate
th
vector for l branch, we use ordering transformation matrix Tl
,where l is branches from 1 to L.

N R 1 vector

the

Y t [Y1 t , Y2 t , Y3 t ,....., YN R t ] given as

T

Y t HX t N t
Where N

t is the

(1)

N R 1 vector with the mean zero and

symmetric Gaussian noise and its covariance matrix is

var[ N t N H t ] 2 N I , here var[.] stands for expected

[.]H for Hermitian operator, n 2 is noise variance and

I denotes the unitary matrix. X [t ] Is the symbol vector, with
H
2
mean zero and covariance matrix var[ X (t ) X (t )] X I
value,

where

2 X is power of the signal, the elements hnR , nT of the

N R NT matrix H corresponds to response from the NT th

transmission antenna to

th

N R receiving antenna.

Fig. 3 Inner procedure of the Interference Canceler.

The method in the l th interference canceler is shown in the
fig 3 and mathematically as,
H
z%
l , n [t ] wl , n [t ]rl , n [t ],

III. PROPOSED INTERFERENCE CANCELLATER

In this we tend to describe our projected interference
cancellater for MIMO spatial multiplexing systems. Initially
we follow the overall principles and structure of the detector
such that research enhancement can done
for better
enhancement of results, then discussion regarding selection
rules and ordering schemes Proposed.

Here

(2)

rl ,n [t ] r[t ], n 1,
H l' Tl H ,
n 1

rl ,n [t ] r[t ] ( H ' )k s$l , n [t ], n 2,

A. Proposed Detector

(3)

k 1

In the projected detector, we introduced interference

cancellater on each collateral branch, which are characterized
with unique orderings, then every branch gives a unique
symbol approximate vector with its ordering format. As at the
receiver there will be a cluster of symbol approximate vectors.
By using MMSE estimation, we will select the best performed
branch at the receiver end.

Wl ,n ( H l ,n H l ,n

v2 1
I ) ( H l )n ,
s2

l ,n [t ]),
s$l ,n [t ] Q( Z
H l is arranged channel matrix for l th branch, ( H l ) n
is nth column for H l , H l ,n is
matrix formed with the
'
r
(
t
)
columns n to NT of H , l ,n
is the receive vector obtained
by the cancelling of previous ( n 1) symbols that were
detected, so rl ,1[t ] r[t ] .Here initial signal n 1 detected
Here

Fig. 2 Block diagram of the detector.

Fig.2 shows the overall diagram of the our detecter.By
victimization of MMSE interference nulling and symbol

initially, and interferences by the initial stream is regenerates

and subtracts before n 2 is detects and this procedure
repeats until all streams are detected then the symbol
approximate vector arranged as

 [t ]
Z l [t ] TlT Z
l

(4)

oNT s ,s

B. choice rules
The detector chooses the best branch by optimal justification
as

lopt arg min j ( Z l [i ]),

s (l 2) NT / L , 2 l NT

s$f (t ) Q( Z lopt [t ])
By requirement, different choice rules are taken to select the
best performed branch

2) Frequently selected branches

d E of the all
potential branches, no of experiments as N e . Lo Is the
By taking Euclidian distance

optimal

codebook for optimum ordering pattern computed by

permutations NT , the branch which has minimum

(7)

euclian distance stored in Lidx .finally LFSB built by

most frequently selected branch L by the histogram of
Lidx as

While channel info is available it provides best

performance in the rules. Channel estimation is
complexness for the ML but it performance is good
when we use ML criterion.

Lopt NT !
d E [l ] r[i ] H sl [i ]

2) Minimum mean square error criterion (MMSE):

when the info about channel is not obtainable tend to
choose MMSE, because it slashes mean square error
for the transmit symbols. optimal justification can be
written as,

jMMSE s$[t ] z[t ]

Lidx (ne ) MININDEX (d E )

(12)

LFSB SELECT ( HIST ( Lidx ))

(8)
3) Listing pattern approach

s$[t ] is the symbol estimate.

By victimization of the initial L orderings that

minimizes the optimum function, we update as LLPA
given below

3) Constant modulus criterion : it is used for the blind

detection, and easy to implement, it minimizes the
optimal function as

jCM E Z n [t ]2 1

LLPA SELECT (d E )

LLPA LENGTH ( LLPA )

(9)

C .Ordering Schemes
In this section we focused to discuss about optimal
ordering pattern and proposed orderings for our scheme. For
the L parallel branches at the receiver end, optimum ordering
scheme conducts a complete search for L NT ! here, ! is the
factorial, so complexness can be high.
To design the transformation matrices
three optimum schemes.

(11)

Here L is the no of branches.

(6)

jML r[t ] H s$[t ]

(10)

Then final detected symbol given as

1) Maximum likelihood criterion(ML):

function for the ML can be written as

oS , NT s
, 2 l NT
[ I s ]

Here, om ,n is an mxn matrix with totally zeros, .

rotates the argument matrix column wise and
specified as reverse diagonal identity matrix. The
algorithm totally shifts the ordering as,

(5)

1l L

Here

IS

Tl

Tl , here we discuss

SIMULATIONS

We calculate Bit error rate achievement for the

designed structure and with basic MIMO detection strategies
ML, MMSE, Vblast, PIC and our algorithm. For simulation
we tend to consider 3GPP spatial model which that is used for
outdoor environments at a frequency of 2GHZ and
information measure of 5MHZ,then our SNR is outlined as

10 log10

NT s 2
2
,here s is variance for the transmit
2
n

symbol, n is noise variance.

2

1) Prestored pattern:
The ordering patterns can be taken as

IV.

(13)

Tl , given by

We will compare BER and SNR in projected detector

by choice rules as shown within the figure3. The ML

estimation performs better while channel information is

known .so, here we use ML estimation rule.

Fig. 6 BER vs. No.of antennas for algorithms.

Fig. 4 BER vs. SNR for selection rules.
Then we tend to compare BER with SNR for MIMO
spatial multiplexing systems with antennas NT N R 12
.Here projected algorithm and optimum ordering are
compared, we also jointly compare the detector with totally
different schemes against MMSE, VBLAST, MMSEPIC, and
ML detectors. For PSP, the most L is set to NT , for FSB and
LPA schemes
L=4
and
11in
the
comparison.

In next figure we compare BSR performance with the

SNR as MIMO system with NT N R 4 antennas. This
result shows similar result to that of figure 5 .The efficiency
for the projected scheme with orderings achieves the optimum
ML performance and frequently selected scheme is higher
than Listing pattern approach.

Fig. 5 BER vs. SNR for different algorithms.

We tend to set L=11 by considering complexity. It
shows that performance of the projected detector performance
better than MMSE detector, VBLAST and MMSEPIC
detector. The results shows that performance of the detector
gets the optimum ML performance, and projected schemes
gives efficiency as optimum scheme.

Fig. 7 BER vs. SNR for Rayleigh fading.

VI. REFERENCES
[1]. Nazeya

and Venkateswarlu, Multipath Interference Cancellation

in MIMO Mobile Cellular system, IJDPS, Vol.3, No.3, pp.35-40,
May 2012.
[2]. Yun Wang and Xie, Ordered Successive Interference
Cancellation on MIMO Decision Feed Equalizer based on
property, Institute For Scientific Computing Information, vol.4,
No.4, pp. 500-511, 2008.
[3]. Heunchul Lee, Seokhwan Park and Inkyu Lee,
Orthogonalized Spatial Multiplexing for Closed-Loop
MIMO Systems,IEEE Trans. Commun. Vol. 55, No. 5,
pp. 1044-1052, Mar. 2007.
[4]. G.J. FOSCHINI and M.J. GANS, On Limits of Wireless
Communications in a Fading Environment when Using Multiple
Antennas, Wireless Personal Communications, vol.6, pp.311335, 1998.
[5]. Emre Telatar, Capacity of Multi Antenna Gaussian Channels,
European transactions and telecommunication, vol.10, No 6,
pp.585-595, Dec.1999.
[6]. Daniel W. Bliss, Keith W. Forsythe, and Amanda M. Chan,
MIMO Wireless Communication, Lincoln Laboratory Journal,
vol.15, NUMBER,2005
[7]. Jabran Akhtar, David Gesbert, Spatial Multiplexing over
Correlated MIMO Channels with a Closed Form Precoder,
Globecom, pp.1-24, 2003.
[8]. Hongyuan Zhang, Quan Zhou, Brian L. Hughes,On the Diversity
Order of Spatial Multiplexing Systems with Transmit Antenna
Selection: A Geometrical Approach, National Science
Foundation, pp.1-34,2003
[9]. Shahab Sanayei and Aria Nosratinia, Adaptive Antennas And
Mimo Systems For Wireless Communications, IEEE
Communications Magazine , pp.68-73, October 2004,

Fig. 8 Capacity vs. SNR for Rayleigh fading.

Similarly the capacity for different receiver structure is
performed for the Rayleigh fading as shown in fig 8 with
different detection techniques. In which MMSE SIC has
remarkable improvement in simulation.
V. CONCLUSIONS
We simulated a detector that supports spatial multiplexing
MIMO system. In our detector we tend to equipped
interference cancellator on many parallel braches with totally
different ordering pattern. Then every branch produces its
distinctive symbol estimate vector by its ordering pattern, then
there will be a bunch of symbol estimate vector at receiver
structure, by victimization of different selection rules ML,
MMSE and CM we can select the branch that performs best.
We tend to use 3 ordering schemes.
We proposed detector which gets sensible diversity, and
collated with existing detector techniques via matlab
simulations it shows that our scheme approaches optimal ML
detector with low difficulty.