Documente Academic
Documente Profesional
Documente Cultură
Burak ŞEKERLİSOY
Supervisor: Asst. Professor Defne AKTAŞ
1. Introduction
Recent studies show that the capacity is highly increased using multiple input multiple
output schemes. With the same amount of transmitted power at the transmitter, using multiple
antennas at the transmitter and/or receiver increases the capacity.
x1 h11 y1
n1
x2 y2
. .
. n2 .
. .
. .
. .
xt hrt yr
nr
y = Hx + n (1)
In this research, the communication between the mobile stations (MS) and base
stations (BS) is modeled as a MIMO system and the downlink part of this system (from BS to
MS) is studied.
In the downlink communication scenario, base station simultaneously transmits to
multiple users. Then there is inter-user interference for one user generated by the signal,
transmitted to the other users. By using multi-user detection, it is possible to mitigate the
interference in the receiver side but since this technique is too costly to use in receivers, it is
not used and in this work, it is assumed that no cooperation exists between the users for the
downlink communication. The mitigation of the interference is handled in transmitter side by
intelligently designing the transmitted vector given the channel state information (CSI). This
inter-user interference can be mitigated by intelligent beamforming or the use of dirty paper
codes.
One way of dealing with inter-user interface is to use the inverse of the channel matrix
and multiply the transmitted vector with this inverse channel matrix. This simple technique is
know as channel inversion. It has been shown [1] that channel inversion technique does not
result in the linear capacity growth with the number of antennas. The reason is that with a
power constraint, a inversion of a channel matrix may require a large normalization factor and
this will result in reduction of the SNR dramatically. The regularized channel inversion
technique [1] is the modified version of the channel inversion technique where the
interference is not totally suppressed. This technique gives ability to regularize the inverse of
the channel matrix. This modification achieves the throughput growth linearly in the number
of antennas but still puts a gap in capacity. Besides the linear processing for multi-user MIMO
downlink communication, there are also dirty paper coding techniques, which are nonlinear
techniques. This is based on the “writing on dirty paper” concept by Costa [8]. Costa’s work
tells us that the capacity of a channel where the transmitter knows the interfering signal is the
same as if there were no interference. It is hard to develop a practical dirty paper coding
technique for this problem. The simplest thing to do is to set the transmitted signal to the
desired signal minus the interference but this results in increased transmission power. In [1],
the vector to be transmitted is constructed and by using a modulo function at the transmitter
and receiver, the system operates close to the capacity. This technique will be the one that our
work will be based on and we will verify the performance of our algorithms with respect to
the results which are achieved using this technique.
has norm smaller than H −1u and u%can be still decoded at the receivers. At this point an idea
derived from Tomlinson-Harashima (TH) precoding [6],[7] is used and each element of u is
perturbed by an integer. In this case
u%= u + τ l (2)
where τ is a positive real number and l is a complex vector whose real and imaginary parts
are integers. Here, the aim is to find l and τ which minimizes the norm of s = H −1u%. The
choice of the parameter l can be written as:
l = arg min(u
'
+ τ l ' )* ( HH * ) −1 (u + τ l ' ) (3)
l
The problem in (3) is an integer lattice least squares problem and sphere decoder
algorithm [2],[3],[4] can be used to solve this problem. This algorithm gives the minimum
distance solution in a lattice, i.e., it tries to find a x̂ from a finite or infinite lattice, which
2
minimizes y − Hx .
In this work we consider the scenario where BSs cooperate and this enables us to solve
the problem on factor graphs using distributed algorithms. After this point, the problem
reduces to finding the solution to the following problem in a distributed manner.
Problem:
2
x̂ = arg minn y-Hx
x∈X
1 2
p(x|y) α exp - 2 y-Hx
2σ
1
p(x|y) α exp - 2 x T H T Hx - 2yT Hx
2σ
Let bi @yT h i
A ij @h i h j where hi is the i th column of H
Then one can write b = y T H and A = HT H.
Then it is obvious that A matrix is symmetric so that we can write :
1 n n n
p(x|y) α exp - 2 ∑ (Aii x i 2 -2bi xi ) + ∑ ∑ Aij x i x j (4)
2σ i=1
i=1 j=1,j ≠i
After having equation (4), the next step is to use sum-product algorithm on factor
graphs and run this algorithm on the graph to get the x vector which maximizes the a-
posteriori probability.
g i (x i ) = ∑ g(x ,x
~{x i }
1 2 ,...,xn ) (5)
which tells that ith marginal function associated with g(x1 ,x2 ….. xn) is the summary for xi of g.
Instead of indicating the variables being summed over, we indicate the ones not being
summed over and “summary for xi” means that, the sum is being taken over the variables
except xi. By definition, a factor graph is a bipartite graph that expresses the factorization of
the function and it consists of variable nodes for each variable and factor nodes for each local
function [5].
g(x1 ,x 2 ,x 3 ,x 4 ,x5 ) = fA (x1 )fB (x2 )fC (x1 ,x2 ,x3 )fD (x3 ,x4 )fE (x3 ,x5 )
The sum-product rule runs on this graph and for example it calculates g1 (x1 ) by only
message passing and processing the messages at the nodes. We can think about this algorithm
to benefit from multiprocessor systems and each processor is doing its job at a particular time
and we can associate each node as a processor and make use of parallel processing.
In order to use the sum-product algorithm in this work, we first observe our global
function which is the function in equation (4). Here we have some modifications to do. Since
we are looking for the arguments of the x which maximizes the global function, we do not
need to calculate the marginal function itself. Instead we only look for x which maximizes the
function in (4) or equivalently which minimizes the -log(global function). Since after taking
the -log(.) of the global function and looking for the argument which minimizes the function
we have min-sum algorithm to run on the factor graph.
1 n n-1 n
p(x|y) α exp - 2 ∑ (A ii x i 2 -2bi xi ) + 2∑ ∑ Aij xi x j
2σ i=1
i=1 j=i+1
then one can write
x̂ = arg minn -log(p(x|y))
x∈X
n n-1 n
= arg minn ∑ (A ii x i 2 -2bi xi ) + 2∑ ∑ Aij xi x j (6)
x∈X
i=1 i=1 j=i+1
As we see in equation (6), our aim is to minimize sum of functions and this is why it is
called min-sum algorithm. So we convert the problem to a min-sum algorithm and the
remaining part is to construct the factor graph and run the min-sum algorithm on the
associated graph. We notice that the graph is not loop-free which means that a message sent
from one node to another will affect itself at the future iterations. This creates a convergence
problem and the convergence will be one of the most important issues to be analyzed in this
research. Besides, convergence of the min-sum algorithm depends on how we partition the
global function into local functions. Different partitioning of the function in equation (6) gives
different results and the related work is described in Section 5.
5. Work Done
Throughout our studies channel matrix H is modeled as a complex random matrix and
its entries are assumed to be i.i.d. Gaussian distributed with zero-mean and variance 1/2 for
both real and imaginary parts. The channel is modeled as a block fading channel which means
that for a predetermined duration of symbol time, channel matrix H is fixed. Furthermore, the
channel is assumed to be slowly varying and the channel state information is perfectly known
by the transmitter.
Firstly, we began our study implementing the sphere decoder [4] in a centralized
manner. After this step, we proceeded with the centralized implementation, the vector-
perturbation technique [1] where the sphere decoder is utilized. By verifying our
implemntations in terms of error performance for the centralized vector perturbation
technique, we moved on studying on min-sum algorithm and we are still working on
designing an efficient distributed algorithm.
-2
10
BER
-3
10
-4
10
-5
10
5 10 15 20 25 30 35
Eb/No (dB)
The resulting bit-error-rate of the simulations for the 64-QAM signal constellation is
given in Figure 4.
BER vs. Eb/No with Best Curve Fit
0
10
Empirical BER
Exp Plus Const Fit
-1
10
-2
10
BER
-3
10
-4
10
-5
10
5 10 15 20 25 30 35
Eb/No (dB)
The numeriacl results are verified using the results presented in [1].
f1 f2 f3 f4
. . .
x1 x2 . . . x3 x4
f i (x i )=Aii x i 2 -2bi xi
g ij (x i ,x j )=2Aij xi x j i=1 ... n-1
j=i+1 ... n
variable node → factor node
i-1 n
μ xi -gij (x i )=μ fi -xi (xi ) + ∑
k=1,k ≠ j
μgki -xi (xi ) + ∑
k=i+1,k ≠ j
μgik -xi (xi ) + c
Initialization
μ xi -gij (x i ) = 0 μgij -xi (xi ) = 0 (8)
Termination
i-1 n
μ i (x i ) = μ f i -x i (x i ) + ∑μ
k=1
g ki -x i (xi ) + ∑μ
k=i+1
g ik -x i (xi )
0
10
min-sum version1
Sphere decoder
-1
10
-2
10
-3
10
-4
10
-5
10
-6
10
0 5 10 15 20 25 30
n n-1 n
x̂ = arg minn ∑ (A ii x i 2 -2bi xi ) + 2∑ ∑ Aij xi x j
x∈X
i=1 i=1 j=i+1
n n-1 n
= arg minn ∑ (A ii x i 2 -2bi xi ) + 2∑ xi ∑ Aij x j (9)
x∈X
i=1 i=1 j=i+1
then we select the factor node operations as :
f i (x i )=Aii xi 2 -2bi xi ( Number of factor nodes = 2n-1 )
n
g i (x i ,x j )=2xi ∑ Aij x j i=1 ... n-1
j=i+1
f1 f2 f3 f4
. . .
x1 x2 x3 x4
g1 g2 gn-1
. . .
In this configuration of the factor graph, our aim is to improve the convergence of the
previous algorithm and make the messages more independent from each other. Since this
problem is modeled on a loopy graph, the partitioning of the global function plays an
important role in the convergence of the algorithm.
This part is still in progress and the algorithm is coded and it is being debugged. The
following table graph summarizes our min-sum work.
# of # of
Min-Sum
Partitioning of the global function variable factor
Version
nodes nodes
n n-1 n
Version-1 arg minn ∑ (A ii x i 2 -2bi x i ) + 2∑ ∑ Aij xi x j n n(n+1)/2
x∈X
i=1 i=1 j=i+1
n n-1 n
Version-2 arg minn ∑ (A ii x i 2 -2bi x i ) + 2∑ xi ∑ Aij x j n 2n-1
x∈X
i=1 i=1 j=i+1
Table1 – Summary of the min-sum work
6. Future Work
First step of the future work is to develop an algorithm which has a satisfactory error
performance and which has convergence problem as small as possible. At first we will not
take the practicality and complexity of the algorithm into account but in subsequent phases,
practicality and complexity and the effects of the real life problems will be considered.
For now, we are investigating a how to implement the distributed algorithm on a factor
graph as a min-sum algorithm. In this phase, we are working with finite constellations.
However, the problem in this research includes infinite lattice and sphere decoder has a
satisfactory performance for this infinite lattice. Our aim will be to achieve a similar
performance as the centralized sphere decoder. After analyzing the error performance and the
convergence issues for the algorithm, we will work on practicality and complexity and may
need to sacrifice performance in order to get an algorithm applicable to real life. For instance,
sensitivity of the algorithm to CSI feedback, synchronization and packet loss between BSs
will be analyzed.
Bibliography
[1] M. Hochwald, B.Peel, A.Lee ``A Vector Perturbation Technique for Near Capacity Multiantenna
Multiuser Communication – Part II : Perturbation'' IEEE Trans. On Communications, vol. 53, No.3, March
2005.
[2] U. Fincke and M. Pohst, “Improved methods for calculating vectors of short lengths in a lattice, including a
complexity analysis,” Math. Computat., vol. 44, pp. 463–471, Apr. 1985.
[3] E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, “Closest point searches in lattices,” IEEE Trans. Inf. Theory,
vol. 48, pp. 2201–2214, Aug. 2002.
[4] M. O. Damen, H. El Gamal, and G. Caire, “On maximum-likelihood detection and the search for the closest
lattice point,” IEEE Trans. Inf. Theory, vol. 49, pp. 2389–2402, Oct. 2003.
[5] R. Kschischang, J. Frey, Hans-Andrea Loeliger, “Factor Graphs and the Sum-Product Algorithm” IEEE
Trans. On Info. Theory, Vol 47, N0.2, February 2001
[6] M. Tomlinson, “New automatic equaliser employing modulo arithmetic,” Electron. Lett., vol. 7, pp. 138–
139, Mar. 1971.
[7] H. Harashima and H. Miyakawa, “Matched-transmission technique for channels with intersymbol
interference,” IEEE Trans. Commun., vol. COM-20, pp. 774–780, Aug. 1972.
[8] M. Costa, “Writing on Dirty Paper,” IEEE Trans. Info. Theory, vol. 29, May 1983, pp. 439–41.