Skip to content


  • Research
  • Open Access

Spatial filter decomposition for interference mitigation

  • 1Email author,
  • 1,
  • 1,
  • 1 and
  • 2
EURASIP Journal on Advances in Signal Processing20142014:127

  • Received: 28 March 2014
  • Accepted: 29 July 2014
  • Published:


This paper presents a two-part decomposition of a spatial filter having to optimize the reception of a useful signal in the presence of an important co-channel interference level. The decomposition highlights the role of two parts of the filter, one devoted to the maximization of the signal to noise ratio and the other devoted to the interference cancellation. The two-part decomposition is used in the estimation process of the optimal reception filter. We propose then an estimation algorithm that follows this decomposition, and the global spatial filter is finally obtained through an optimal-weighted combination of two filters. It is shown that this two-component-based decomposition algorithm overcomes other previously published solutions involving eigenvalue decompositions.


  • SIMO receiver
  • Optimum combining
  • Maximum ratio combining
  • Antenna array

1 Introduction

Increasing capacity demand for wireless communication networks should lead to a high co-channel interference level in the future. This interference problem is not new and has been addressed, for a long time, in wireless networks. The first solutions, coming from 2G networks, were based on frequency reuse patterns while, a few years later, scrambling codes were used, for the same purpose, in 3G networks. Nowadays, diversity techniques are more and more considered as one of the best answer for this interference problem, especially in 4G networks. The work presented in this paper was initially based on private mobile radio (PMR) characteristics linked to the TETRA enhanced data service (TEDS) standard, but it is suitable also in the context of 4G transmissions which are based on the Long-Term Evolution (LTE) standard. The presented work addresses essentially the problem of transmission with high interference level ratio and fast varying propagation channels.

In such a context, several previous works have treated and analyzed the best spatial filter to maximize the signal to interference plus noise ratio (SINR). The optimum combining (OC) filter [15] can be proposed as an exploitable solution. It was also proven that, in the absence of interference, this optimum combining filter converges to the well-known maximum ratio combining (MRC) filter [6].

The main problem, in the estimation of the optimum combiner filter, resides in the estimation of the covariance matrix of the interference plus noise in addition to the estimation of the useful user propagation channel. The minimum mean square error estimation (MMSE) criterion can be used to estimate the desired user propagation channel, while the covariance matrix can be estimated by the sample matrix inversion (SMI) approach [79]. However, this strategy is suboptimal and requires a large signal sample set to get a correct smoothing stage [10, 11]. Another problem resides in the covariance matrix itself which will be obviously interpolated to the data locations since it is estimated on the pilot locations [10].

In this paper, we will prove that under certain conditions, the OC filter can perfectly be decomposed in two independent components. Hence, when the number of interferers is smaller than the number of receiving antennas, the OC filter can be split in two weighted components, namely MRC filter and interference canceller combiner (ICC). Moreover, for its own scientific interest, it will be proven that this decomposition leads to a new and efficient optimum filter estimation algorithm.

More precisely, we will show that for the MRC part of the OC filter, the classical MMSE can be proposed in order to obtain the estimation of the useful user propagation channel. On the other hand, we will show that the ICC part can be estimated by modifying the matched desired impulse response (MDIR) algorithm [12]. This algorithm requires a null linear system solving, and a constraint is required to prevent the trivial solution. Following [12], a constraint, so-called maximum SINR constraint (MSINRC), can be introduced; it will maximize the SINR at the output of the filter. The final solution-vector will then be given by the eigenvector corresponding to the lowest eigenvalue of a Hermitian matrix generated by the algorithm. Due to the presence of the noise, the estimation still remains suboptimal and the result is corrupted by the training noise estimation. It was proven in [13] that combining all eigenvectors, weighted by the inverse of their corresponding output SINR, could lead to an enhanced algorithm, so-called solution-vectors maximum ratio combining (SoMRC). It was shown that this approach gives better performance than the single solution-vector [13, 14]. Obviously, such kind of algorithms is based on a complex eigendecomposition. To simplify this step, we propose to introduce another constraint, leading to a less complex algorithm where we can avoid the eigendecomposition. We will also show that this new constraint keeps the performance of the algorithm comparable to that of the SoMRC.

The contribution of the presented work in the study of the optimum combiner filter consists on identifying the cases where it can be decomposed to a MRC plus a ICC independent filters. Another contribution consists of the modified MDIR algorithm and in the introduction of the new constraint that does not degrade performances of the SoMRC. A 16-bit digital signal processor (DSP) implementation is also presented in order to evaluate the rounding errors effect on the performance of the algorithm and to determine the possibility of the algorithm execution under some real-time constraints.

The paper is organized as follows. The system model is given in Section 2. Section 3 presents the split of the OC into two weighted independent parts, namely MRC and ICC. In Section 4, the estimation algorithm for ICC is detailed. A simplification of this estimation algorithm is introduced in Section 5. Numerical results and performance of the algorithms are presented in Section 6. A performance degradation study, due to a practical 16-bit fixed point DSP implementation is detailed in Section 7. Conclusion summarizes the present work in Section 8.

1.1 Notation

Vectors and matrices are boldface small and capital letters; the transpose, complex conjugate transpose, and inverse of matrix A are denoted by A T , A H , and A−1, respectively.

The norm of vector a and the diagonal matrix with the diagonal element extracted from a are denoted respectively by a and diag{a}, IN is the N × N identity matrix, and E[.] denotes the statistical expectation.

2 System model

We consider a SIMO structure having M receiving antennas, with one desired signal and U interferers, as presented in Figure 1. Desired user and interferers are transmitting orthogonal frequency-division multiplexing (OFDM) waveforms, and for the sake of simplicity, we will consider that all users are time and frequency synchronized. This remark is not restrictive, and all results presented are not linked to this hypothesis that will nevertheless simplify some notations in the sequel of the paper.
Figure 1
Figure 1

Context of the work, one useful user, and U interferers.

The OFDM frame of the desired user is composed of K subcarriers and N s OFDM symbols. A N g length cyclic prefix is inserted. It is assumed that this cyclic prefix is sufficient to totally suppress intersymbol interferences. We will focus on one OFDM symbol, and we will avoid indicating the symbol number in the notations. Algorithms presented will then be able to cope with a unique OFDM symbol and therefore able to deal with very high-speed propagation channels.

With this assumption, the received sample, after the OFDM demodulation, corresponding to the k th subcarrier on the m th antenna, as presented in Figure 2, can be modeled by Equation 1:
Figure 2
Figure 2

Receiving structure in the SIMO context.

y k m = h x , k m x k + n k I m
n k I m denotes an additive noise plus interference term and can be developed as follows
n k I m = u = 1 U h z , k , u m z k , u + n k m

Zk,u is the symbol transmitted by the u th interferer.

hz,k,u(m) denotes the frequency response of the channel between the u th interferer and the m th antenna. n k (m) represents a centered additive white Gaussian noise term with a variance equals to σ n 2 .

u = 1 U h z , k , u m z k , u is then the total contribution of the U interferers received by the m th antenna on the k th subcarrier.

In this paper, we have to identify a spatial filter w k able to estimate the QAM symbol x ^ k transmitted by the desired user. This leads to
x ^ k = w k H y k
In this equation, corresponding to the k th subcarrier, w k = w k 0 w k M 1 denotes, as illustrated in Figure 3, M weights of the spatial filter and y k = y k 0 y k M 1 stands for the k th post-fast Fourier transform (FFT) outputs of M antennas. Combining Equations 1, 2, and 3 leads to Equation 4
Figure 3
Figure 3

Receiver spatial filter for the k th subcarrier.

x ^ k = w k H h x , k x k + u = 1 U h z , k , u z k , u + n k

where h x , k = h x , k 0 h x , k M 1 denotes the M desired propagation channel frequency responses of the k th subcarrier,

h x , k , u = h x , k , u 0 h x , k , u M 1 the M interfering propagation channel frequency responses between the u th interferer and the receiving antennas, and finally n k = n k 0 n k M 1 stands for the received noise on the M receiving antennas.

The spatial filter that maximizes the signal to interference plus noise ratio (SINR k ) for x ^ k was introduced in [1] and studied in [2, 3]. Main steps of this derivation are presented hereafter.

We could consider, without loss of generality, that E[|x k |2] = 1 and E[|zk,u|2] = 1. According to Equation 4, the SINR k , at the output of the spatial filter, is then given by
SINR k = w k H h x , k * h x , k T w k w k H R nn , k w k
In this equation, Rnn,k stands for the M × M spatial covariance matrix of interference plus noise, and it is expressed by
R nn , k = E u = 1 U h z , k , u z k , u + n k u = 1 U h z , k , u z k , u + n k H
Considering the decorrelation between interferer signals and noise terms, we have
R nn , k = u = 1 U E h z , k , u * h z , k , u T + σ n 2 I M
By introducing the Rzz,k matrix defined by
R zz , k = u = 1 U E h z , k , u * h z , k , u T
we can rewrite Rnn,k as a summation of two parts as given hereafter
R nn , k = R zz , k + σ n 2 I
At the output of the combiner, in order to perfectly equalize the useful channel, we propose to introduce the following constraint
w k H h x , k * = 1
Merging Equations 5 and 9, the SINR k becomes
SINR k = 1 w k H R nn , k w k
The optimum spatial filter vector w k that maximizes the SINR k can then be obtained by minimizing w k H R nn , k w k under the constraint w k H h x , k * = 1 . Using Lagrange multiplier, the optimum spatial filter is obtained by solving the following equation
w k = arg min L 1 SINR k , w k , λ
where the Lagrangian is defined such that
L 1 SINR k , w k , λ = w k H R nn , k w k λ w k H h x , k * 1
Under the assumption that det d 2 L 1 SNIR k , w k , λ d w k 2 > 0 , the solution is obtained by nulling the derivative of L 1 SNIR k , w k , λ with respect to w k
d L 1 SINR k , w k , λ d w k = 0
Solving Equation 14 leads to
R nn , k w k λ h x , k * = 0
The optimal [1] solution is then expressed by
w k = λ R nn , k 1 h x , k *
The minimum of the solution (Equation 12) is justified by the positive Hermitian characteristic of the covariance matrix Rnn,k. We have
det d 2 L 1 SINR k , w k , λ d w k 2 = det R nn , k
As det(Rnn,k) is equal to the product of eigenvalues of Rnn,k, we have det(Rnn,k) > 0. Finally, w k H h x , k * = 1 leads to
λ = 1 h x , k H R nn , k 1 h x , k
w k = R nn , k 1 h x , k * h x , k H R nn , k 1 h x , k

Identifying the spatial filter w k through Equation 19 is a very complex task involving Rnn,k estimation and inversion plus hx,k estimation. In order to address this spatial filter estimation problem, we propose to split it on two separated filters. This approach highlights how the optimal spatial filter works.

3 Spatial filter decomposition

We consider the eigenvector matrix U k and the diagonal matrix I μk of the eigenvalues defined such that I μk = μ 0 , k 0 0 0 0 0 0 μ M 1 , k . Then, the eigenspace decomposition of Rzz,k can be written as follows
R zz , k = U k I μ k U k H
According to the Rnn,k decomposition, presented in Equations 7 and 8, we obtain
R nn , k = U k I μ k + σ n 2 U k H
With I μk + σ n 2 = I μk + σ n 2 I M , we introduce then Cnn,k as the transpose adjugate (cofactor) matrix of R nn , defined as follows
R nn , k 1 = C nn , k det R nn , k
Replacing R nn , k 1 by C nn , k det R nn , k in the denominator of Equation 19 leads to
w k = 1 h x , k H C nn , k h x , k det R nn , k R nn , k 1 h x , k *
Knowing that det R nn , k = i = 1 M 1 μ i , k + σ n 2 , we can write
det R nn , k R nn , k 1 = U k I μ + σ n 2 μ + σ n 2 U k H
In this last equation, I μ + σ n 2 μ + σ n 2 stands for a diagonal matrix such that its m th component is given by
i = 0 M 1 μ i , k + σ n 2 μ m , k + σ n 2 = i = 0 i m M 1 μ i , k + σ n 2
Then, Equation 24 can be rewritten as follows
det R nn , k R nn , k 1 = C zz , k + σ n 2 M 1 I + G m , k
where Gm,k is null matrix for M ≤ 2 otherwise is defined by the following expression
G m , k = m 1 = 0 M 2 × 1 m 1 R zz , k m 1 m 2 = 1 M m 1 1 σ n 2 M m 2 1 i = 1 M 1 μ i , k m 2 1

As shown in the previous equation, Gm,k is linked to the interference covariance matrix. We note that in the case of totally decorrelated interferers, R zz , k = σ c 2 I .

Finally, we obtain the following decomposition of the spatial filter w k
w k = 1 h x , k H C nn , k h x , k C zz , k h x , k * + σ n 2 M 1 h x , k * + G m , k h x , k *

We conclude that the optimal spatial filter is a combination of three filters: mainly a filter dedicated exclusively to the interference, a maximum ratio combiner filter, and a filter linked to the statistical dependency of the interferers. Due to the complexity of the third filter, the estimation of the optimal spatial filter through the separate estimation of the filters is only interesting in the case of a two-antenna receiver (Gm,k = 0).

3.1 Analysis for M = 2

If we consider now a two-antenna spatial filter (M = 2), in this case, the optimal spatial filter given by Equation 27 becomes
w k = 1 h x , k H C nn , k h x , k C zz , k h x , k * + σ n 2 h x , k *

With Czz,k ≠ 0 for U ≥ M − 1.

From Equation 24, we have
C nn , k = U k I μ + σ n 2 μ + σ n 2 U k H
C nn , k = C zz , k + σ n 2 I M
Replacing Equation 30 in Equation 28, we obtain
w k = 1 h x , k H C zz , k h x , k + σ n 2 h x , k H h x , k C zz , k h x , k * + σ n 2 h x , k *
We introduce now the ρ k scalar defined as follows
ρ k = h x , k H C zz , k h x , k h x , k H h x , k
After some derivations, we arrive to
w k = 1 ρ k + σ 2 ρ k C zz , k h x , k * h x , k H C zz , k h x , k + σ n 2 h x , k * h x , k H h x , k
This equation can be presented as follows
w k = 1 ρ k + σ 2 ρ k w z , k + σ n 2 w h , k
w z , k = C zz , k h x , k * h x , k H C zz , k h x , k
w h , k = h x , k * h x , k H h x , k

Equation 34 expresses the optimum combiner w k through a weighted combination of two combiners wz,k and wh,k.

In this two-part decomposition, wz,k represents the optimum combiner in the case of a noiseless transmission with interference and wh,k represents the maximum ratio combiner ρ k and σ n 2 are two positive scalars representing the degree of contribution of these two combiners wz,k and wh,k.

From this observation, we can derive the following theorem.

Theorem: In the case of two-antenna SIMO receiver, the optimum combiner w k can be expressed as a weighted combination of the optimum combiner w z,k obtained in the case of null additive white Gaussian noise and the maximum ratio combiner w h,k .

Furthermore, of the physical interpretation of the optimal spatial filter, this decomposition can also be used to estimate the optimal spatial filter in two steps: a step devoted to the optimum combiner without taking into account the additive noise wz,k and the other to the maximum ratio combiner wh,k.

4 Spatial filter estimation

4.1 Estimation algorithm for wh,k

The wh,k filter does not depend on interference but only on the desired signal propagation channel. Its estimation is then directly linked to the estimation of the propagation channel hx,k.

In this work, we consider that propagation channels, i.e., useful and interference channels, can be modeled as L taps finite impulse response filters and with L < K. We introduce then these impulse responses, corresponding to the m th antenna, through the following vectors
a x m = a x , 0 m a x , L 1 m
Thanks to this hypothesis we can introduce the h x (m) vector that represents the frequency response of the propagation channel between the useful user and the m th antenna
h x m = h x , 0 m h x , K 1 m
The two a x (m) and h x (m) vectors are linked by the following equation
h x m = F K , L a x m
where FK,L is the K × L truncated Fourier rectangular matrix defined as follows
F K , L k , l = 1 K exp j 2 πkl K , 0 k < K and 0 l < L
In the context of a real transmission, a first estimation h ˜ x m of h x (m) can be proceeded through the classical least square as given in the following equation
h ˜ x m = y 0 m / x 0 y K 1 m / x K 1
As components of h ˜ x m have not been averaged over a great number of observations, they are highly imprecise and they depend on the additive noise over the y k (m) received samples. A smoothing operation [15], leading to a new estimated h ^ x m vector, can be proposed through the following equation
h ^ x m = F K , L F K , L H h ^ x m

This estimation algorithm is known as the indirect estimation [16, 17], and some papers [18] propose to enhance it through the introduction of a noise power estimation and an adaptive weight, able to take this estimation into consideration.

The main drawback of this algorithm comes from Equation 41 that involves knowledge of all transmitted symbols {x k }k [0, K − 1]. In a real transmission, only pilot symbols are known. If we consider that we have K′ < K comb pilots {x0′, x1′, …, xK}, then Equation 41 becomes
h ˜ x m = y 0 , m / x 0 , y K 1 m / x K 1

where h ˜ x m is a (K′ × 1) vector representing the first estimation of the propagation channel frequency responses on the pilot locations.

The first estimation for the propagation channel impulse response can then be obtained through
a ˜ x m = F K , L H h ˜ x m
Then, an interpolation step is required. It is performed by the following equation
h ^ x m = F K , L H h ˜ x m
Equation 45 is devoted to the m th antenna, and it can be generalized to all antennas. If we consider now the k th component h ^ x , k m of all these h ^ x m m 0 , M 1 vectors, we can introduce the h ^ x , k vector defined as follows
h ^ x , k = h ^ x , k 0 h ^ x , k M 1
The estimation w ^ h , k of the wh,k vector is then directly given by
w ^ h , k = h ^ x , k h ^ x , k H h ^ x , k

4.2 Estimation algorithm for wz,k

The wz,k vector is jointly dependent on interference, and propagation channels are devoted to interference sources cancellation. It is well known that a M antenna spatial filter is able to cancel U = M − 1 interferers. In our particular case, where we choose M = 2, we have then to cope with a unique interferer. In the sequel of this section, the u index that represents the interferer index will be omitted in equations.

We consider the transmission of a unique OFDM symbol, the eigendecomposition of Rzz,k is given by
R zz , k = U k μ 0 , k 0 0 0 U k H
And the eigendecomposition of Czz,k is given as follows
C zz , k = U k 0 0 0 μ 0 , k U k H = μ 0 , k u 2 , k u 2 , k H

where μ2,k is the second column vector of U k orthogonal to the interference vector h z , k 0 h z , k 1 . Therefore, the following scalar vector is null u 2 , k T h z , k 0 h z , k 1 = 0 . Therefore, u 2 , k = α h z , k 1 h z , k 0 = 0 , where α is a complex scalar. In the sequel, we set α = 1.

The filter wz,k will then be rewritten as
w z , k = μ 0 , k u 2 , k u 2 , k H h x , k * μ 0 , k h x , k T u 2 , k u 2 , k H h x , k * = u 2 , k h x , k T u 2 , k
Finally, the solution is given by
w z , k = w z , k , n w z , k , d
w z , k , n = h z , k 1 h z , k 0
w z , k , d = h z , k 1 h x , k 0 h z , k 0 h x , k 1
The positive scalar ρ k in the general formula of the optimal spatial filter given in Equation 34 becomes
ρ k = μ 0 , k u 2 , k H h x , k 2 h x , k 2

Therefore, ρ k is the intercorrelation factor between the desired and the interference channel vectors. From the theorem stated above and Equation 50, we emit the following proposition.

Proposition: In the case of two-antenna SIMO transmission disturbed by an interferer, the optimum combiner w k is a weighted combination of the interference cancellation filter wz,kand the maximum ratio combining filter wh,k.

The estimation of wz,k,n and wz,k,d is a complex task that involves the knowledge of the desired and interferer propagation channels. Nevertheless, the expression of wz,k,n and wz,k,d given by Equations 52 and 53, respectively, gives opportunities to project these components on a reduced Fourier basis.

4.2.1 w z,k,n estimation

On the first hand, we can notice that the components of wz,k,n are simply those of the frequency response of the interferer propagation channels, corresponding to the k th subcarrier. Therefore, the components of this filter can then easily be expressed on a reduced Fourier basis. For that purpose, we introduce the (K × 1), h z (m) vector that represents the frequency response of the propagation channel between the interferer and the m th antenna as follows
h z m = h z , 0 m h z , K 1 m
As in the previous section, the h z (m) vector is linked to the L taps impulse response a z (m) through the following equation
h z m = F K , L a z m
where the (L × 1) a z (m) vector is defined as follows
a z m = a z , 0 m a z , L 1 m
Therefore, wz,n can be expressed as
w z , n = F K , L v z , n

4.2.2 w z,k,d estimation

On the other hand, we can notice that the wz,k,d is a scalar obtained by the product of two frequency response terms. It can then be viewed as the Fourier transform of the convolution of two impulses responses of propagation channels, and it can then be linked to a virtual 2 L taps impulse response.

If we introduce the (2 L × 1) vz,d vector representing this virtual impulse response
v z , d = v z , 0 , d v z , 2 L 1 , d
Then we can introduce the wz,d vector defined as
w z , d = w z , 0 , d w z , K 1 , d
w z , d = F K , 2 L v z , d

4.2.3 Replica spatial filter structure

The decomposition of wz,k in a numerator part and a denominator part as given by Equation 51 leads to propose a new spatial filter structure having two weights, represented by wz,k,n acting over the received signal and a weight, represented by wz,k, d, acting over the useful signal (Figure 4).
Figure 4
Figure 4

Replica spatial filter structure for the k th subcarrier.

We can then introduce the error e k defined by
e k = w z , k , d x k y k 0 y k 1 w z , k , n
At this stage, knowing that the wz,k filter has to cancel the interference, we can propose to identify its two components through an error square minimization criterion
w z , k = arg min w z , k , n , w z , k , d e k 2
We have then to insert a constraint ψ(wz,k,n, wz,k,d ) in order to avoid the trivial solution: (wz,k,n = 0, wz,k,d = 0). Moreover, the minimization has to be done over all frequencies. It is then necessary to propose a global criterion. For that purpose, we introduce the X transmitted diagonal data matrix, where each element x k corresponds to the desired symbol transmitted over the k th subcarrier
X = diag x 0 , x 1 , , x K 1
We introduce also the bi-diagonal matrix Y of the received signal over the two antennas
Y = y 0 0 0 0 0 0 0 0 y K 1 0 y 0 1 0 0 0 0 0 0 y K 1 1
The e = e 0 e K 1 vector representing errors over all subcarriers is then given by
e = X w z , d Y w z , n
The filter weights are then given by the following minimization
w z = arg min w z , d , w z , n e 2 μψ w z , n , w z , d

where μ is a Lagrange multiplier.

In [12, 19] and in a similar context, a constraint called maximum signal to interference plus noise constraint (MSINRC) is proposed. It is defined as
ψ w z , n , w z , d = X w z , d 2 1

Without loss of generality, we can consider that all transmitted symbols x k are normalized: |x k |2 = 1, we have then X H X = I. The constraint presented in Equation 68 is then equivalent to wz,d2 = 1.

By nulling the partial derivative of e2 − μψ(wz,n, wz,d) with respect to w z,n and wz,d[20], we obtain the following system of equations
X H Y w z , n w z , d = μ w z , d w z , n = Y H Y 1 Y H X w z , d
Merging the two equations of Equation 68, we arrive to
X H Y Y H Y 1 Y H I X w z , d = μ w z , d

It appears then that wz,d is the eigenvector of the X H (Y(Y H Y)−1Y H  − I)X matrix corresponding to the μ eigenvalue.

Left multiplying the two sides of Equation 70 by w z , d H , we obtain
w z , d H X H Y Y H Y 1 Y H I X w z , d = μ w z , d H w z , d
This last equation leads to
1 μ = w z , d H w z , d w z , d H X H Y Y H Y 1 Y H I X w z , d
In the right side of Equation 72, we recognize the SINR formula; we can then conclude that
1 μ = SINR
Finally, as we have to maximize the SINR at the output of the filter, wz,d has to be the generalized eigenvector which corresponds to the minimal eigenvalue μ. Using Equation 61, Equation 72 becomes
X H Y Y H Y 1 Y H I X F K , 2 L v z , d = μ F K , 2 L v z , d
Left multiplying the two sides of this equation by F K , 2 L H yields to
F K , 2 L H X H Y Y H Y 1 Y H I X F K , 2 L v z , d = μ v z , d
It appears that from Equation 74, the virtual impulse response Vz, d is the (2 L × 1) eigenvector of the matrix F K , 2 L H X H Y Y H Y 1 Y H I X F K , 2 L corresponding to the minimal eigenvalue μ. This result is known and used by many authors. An enhanced maximum signal to interference plus noise constraint (EMSINRC) is proposed in [13]. It is based on the exploitation of the set Vz,d of all the eigenvectors of the previous matrix defined as
V z , d = v z , d 0 v z , d 2 L 1
The EMSINRC algorithm introduces a linear combination of elements of V z,d , in order to propose a composite virtual impulse response v z , d c defined as follows
v z , d c = i = 0 2 L 1 η i 1 μ i v z , d i

where μ i is the eigenvalue corresponding to the eigenvector v z , d i . The complex term η i is defined such that η i = arg max η i v z , d c 2 and |η i | = 1. This complex scalar is acting as a phase term that aligns all eigenvectors.

Concerning the vector vz,n, it is obtained by merging Equation 58 into the second equation of the system (69). Hence, vz,n is given as follows
v z , n = F KK , LL H Y H Y 1 Y H X F KK , LL v z , d

vz,n can then directly be obtained once vz,d is determined.

Finally, having wz, d and wz, n form vz, d and vz, n by performing Equations 61 and 58, respectively, the interferer cancellation filter w z , k = w z , k , n w z , k , d for all subcarriers is obtained.

At this stage, all elements have been established and the optimal filter, given by Equation 34, can be estimated. The combination of Equation 34 is based on ρ k that can be obtained directly from Equation 54 noticing that the interferer power μ0 and σ n 2 can be obtained through a noise plus interferer power estimation.

5 Interference cancellation filter simplification

The estimation of wz,d and wz,n involves an eigendecomposition which is a complex task, especially if we consider a practical implementation of the algorithm in the real-time context of the receiver. We will show, in this section, how this eigendecomposition can be avoided without involving any loss in the global performances of the algorithm.

The key element comes from the constraint introduced to avoid the trivial solution. Instead of wz,d2 = 1, we propose to introduce a constraint directly applied to the virtual impulse response vz,d. This constraint consists in forcing a component of this vector to be equal to 1.

If we denote by k b , the index of this component, the constraint will be then given by vz,d(k b ) = 1.

We will introduce now a square matrix B, with all zero components except a diagonal component set to 1; the constraint is then formalized as follows
B v z , d = 1 k b
where 1 k b is a vector whose all components are null except k b th component set to 1. The constraint can then be formalized with the following function ψ′ (vz,d)
ψ v z , d = B v z , d 2 1
The interference cancellation filter weights are then given by the new following minimization
v z , n , v z , d = arg min v z , n , v z , d e 2 μ ψ v z , d
The derivation of Equation 80 with respect to vz,d leads to the new solution (vz,n, vz,d) given by
v z , d F K , 2 L H X H Y F KK , LL v z , n μ B H Bv z , d = 0
Due to its structure, we have B H B = B. Merging this equation and Equation 78 in Equation 81 leads to
v z , d F K , 2 L H X H Y F KK , LL v z , n μ 1 k b = 0
The derivation of Equation 80 with respect to vz,n leads to
F KK , LL H Y H X F K , 2 L v z , d + F KK , LL H Y H Y F KK , LL v z , n = 0
By developing Equation 83, we obtain
v z , n = F KK , LL H Y H Y F KK , LL 1 F KK , LL H Y H X F K , 2 L v z , d
Merging Equation 84 in Equation 82, we obtain
F K , 2 L H X H I Y Y H Y 1 Y H X F k , 2 L v z , d = μ 1 k b
This last equation can be rewritten as
v z , d = μ Ω 1 1 k b

with Ω = F K , 2 L H X H I Y Y H Y 1 Y H X F K , 2 L and where μ′ is a scalar chosen such that vz,d(k b ) = 1.

Finally, the solution obtained from the proposed constraint leads to a solution given by Equations 84 and 86. With these two equations, the eigendecomposition is avoided and the implementation complexity is widely reduced. The question of the optimality of this new solution has then to be analyzed in details. For that purpose, we propose to decompose the vector vz,d in the Vz,d orthogonal basis introduced in Equation 75. We can then define a (2 L × 1) vector α d representing the image of vz,d in the Vz,d basis as hereafter
v z , d = Vz , d α d
As Vz,d are eigenvectors of the Ω matrix, we have
Ω v z , d = V z , d I μ α d

where I μ is the diagonal matrix of eigenvalue of Ω.

Considering Equation 86, the α d vector is then given by
α d = I μ 1 V z , d H μ 1 k b
Finally, Equation 89 becomes
v z , d i = 0 2 L 1 η i 1 μ i v z , d i

where η i is the i th component of the k b th column vector of the matrix V z , d H .

This last equation has to be compared to Equation 76 related to the EMSINRC algorithm. It leads to the conclusion that the EMSINRC algorithm is in fact equivalent to a constraint modification leading to a new constraint given by Equation 79.

6 Simulation results

In this section, we first evaluate performance of the various solutions presented in Sections 4 and 5. We will then compare:

The solution based on (vz,n, vz,d) that will be referred as maximum signal to interference plus noise ratio constraint (MSINRC)

The solution based on v z , n c , v z , d c that will be referred as enhanced maximum signal to interference plus noise ratio constraint (EMSINRC)

The solution based on (vz,n, vz,d) that will be referred as coefficient constraint (CC)

The simulation parameters based on OFDM waveform are summarized in Table 1, hereafter.
Table 1

OFDM parameters





Number of subcarriers



FFT size


N cp

Cyclic prefix

N FFT 8 = 4


Total bandwidth

100 kHz


Subcarrier spacing

3,125 kHz


OFDM symbol duration

360 μs

T Frame

Frame duration

18.36 ms

The modulation used is 4-QAM with the same power for pilots and data. The propagation channels used follow the Jakes model [21] with a propagation channel impulse response described in GSM standard [22], namely TU50 (typical urban with a mobile velocity of 50 km/h) and HT200 (hilly terrain with a mobile velocity of 200 km/h). The pilots are uniformly distributed along the frequency axis with a rate of 1 2 as depicted in Figure 5 and along the time axis with a rate of 1 5 .
Figure 5
Figure 5

Pilots distribution over the OFDM symbol.

Algorithm's weights are estimated on the plots position for each OFDM symbol containing pilots. An interpolation within the subspace generated by the reduced DFT F L and F2L is followed to extend the weights to the whole OFDM symbol.

However, along the time axis, the interpolation method used is the spline cubic [23].

Performance assessment is performed by comparing the uncoded BER (bit error rate before channel decoding) vs. E b N0 (signal to noise ratio) at signal to interference ratio (SIR) equal to 0 and 6 dB. As in [24, 25], an additional comparison is done to confirm the previous one and consists on the study of the normalized mean square error (NMSE) of v ^ expressed as NMSE = v ^ v v 2 2 , where v is the exact weight vector cancelling totally the interference, and v ^ = v ^ n v ^ d is the estimation of v using the constraints studied in Section 4.

Figures 6 and 7 depict the uncoded BER obtained for the different constraints used in the weight vector estimation v ^ . The observation of the curves confirms the theoretical analysis where the CC outperforms the MSINRC in the both cases of propagation channel environment. The difference in the performance is more pronounced for low E b N0 level, and obviously, the curves converge when E b N0 becomes high. Moreover, as expected in the theoretical analysis, the curves of CC and EMSINRC are superposed.
Figure 6
Figure 6

Replica spatial filter structure BER for the various constraints in TU50 channel propagation environment

Figure 7
Figure 7

Replica spatial filter structure BER for the various constraints in HT200 channel propagation environment.

We conclude that CC is not only the best choice in the sense of bit error rate performance but also achieves very low complexity in its implementation. As shown in Equation 90, the solution is obtained by a simple matrix inversion unlike the other methods which need an eigendecomposition.This difference of BER performance between the constraints studied in Section 5 is confirmed by the NMSE as depicted by Figures 8 and 9. It is clearly shown that for CC constraint, the NMSE is less important than the MSINRC and close to the EMSINRC.
Figure 8
Figure 8

Replica spatial filter structure NMSE of v for various constraints in TU50 channel propagation environment.

Figure 9
Figure 9

Replica spatial filter structure NMSE of v for various constraints in HT200 channel propagation environment.

In the sequel, we discuss the performance of the estimated optimum combiner (EOC) based on the weighted combination of the estimated replica spatial filter using CC and the estimated MRC. EOC is then compared to the exact MRC (propagation channel h d is perfectly known) and the exact optimum combiner (OC) where the covariance matrix R nn and propagation channel h d are perfectly known. Furthermore, additive white Gaussian noise (AWGN) power is assumed known.

Figures 8 and 9 show that the EOC in TU50 propagation environment is better than in HT200 conditions. In TU50, the EOC presents a good performance comparing to OC, and there is only 2 dB of difference at E b N0 = 20 dB. However, in HT200 environment, this difference is more significant and is approximately about 4 dB at E b N0 = 20 dB. This degradation is attributed to the estimation error of the EOC, which is proportional to the size of the weight vector. For example, in our case, the total weight vector length is equal to 4LTU = 8 for TU50 and 4LHT = 12 for HT200. We denote by LTU = 2 and LHT = 3 the maximum impulse response length of the propagation channels in TU50 and HT200 environments, respectively (Figures 10 and 11).
Figure 10
Figure 10

BER performance of EOC vs. MRC and OC in TU50 channel propagation environment.

Figure 11
Figure 11

BER performance of EOC vs. MRC and OC in HT200 channel propagation environment.

7 Real-time implementation

The complexity of an algorithm is often quantified in terms of the number of arithmetic operations. This quantification provides an estimate of the use of memory and execution time necessary to execute the algorithm.

Generally, algorithms are designed for real-time use and have to be performed by finite precision processors then the study of complexity raised above can meet the first requirement, but not enough to satisfy the second. In this section, we have performed a 16-bit DSP implementation in order to insure a full analysis, namely to check that the real-time constraint and 16-bit fixed points degradation tolerance are respected.

EOC using CC constraint is implemented into the 16-bit fixed-point DSP (TMS 320C6474) which works at frequency clock of 1G Hz [26]. The whole of the receive chain is implemented, but we will show only the results of the part where the discussed algorithms are involved, namely the channel equalization.

Table 2 shows the execution time and memory uses performance of the algorithm. The main complexity cost in the EOC algorithm steels the relatively high dimension matrix to be inverted. Two methods of matrix inversion are implemented, namely Gauss-Jordan and Cholesky decomposition. The difference in the sense of execution time is negligible. The total execution time for the channel equalization is 210.7 μs per OFDM symbol which represents 1.15% of the frame duration.
Table 2

Execution time and memory use


Memory used [bytes]

DSP cycle count

Execution time (μ s)

Weights estimation (with Gauss)




Gauss (with prescaling)


84,770 (97,205)


Cholesky (with prescaling)


70,306 (83,777)


Channel equalization




The degradation caused by the 16-bit fixed-point format over the full precision floating point is shown in Figures 12 and 13 for TU50 and HT200 environments, respectively. These results are given in terms of uncoded BER vs. signal to interference ratio (SIR) at E b N0 = 20 dB. One can observe that we have obtained satisfactory results in both cases of Gauss and Cholesky implementation.
Figure 12
Figure 12

BER performance replica filter on 16-bit fixed point in TU50 channel propagation environment.

Figure 13
Figure 13

BER performance replica filter on 16-bit fixed point in HT200 channel propagation environment.

8 Conclusions

This paper presents a new expression for the optimum combining filter for the case of a two-antenna based receiver. This expression is a weighted combination of two components. The first component is the combiner obtained in the case of null additive white Gaussian noise and the second is the combiner obtained in the case of null interference. This decomposition is important because it allows the optimal combining estimation through two filters of known sizes, so the problem of the size of the filters is avoided. A detailed study dedicated to a SIMO transmission in the case of one interferer and two receive antennas is presented in order to confirm the importance of this decomposition. A DSP implementation is also investigated to quantify the algorithm complexity. The success of this implementation is a proof that this algorithm is ready to use at least in cases close to the given example.

We note that all developments presented in the estimation part of the OC study have been based on one dimension estimation, mainly the frequency axis of the OFDM frame. However, the proposed method can be done on the time axis of the frame such as in [27, 28] or on both axis.


Authors’ Affiliations

CNAM/CEDRIC/Laetitia, Paris, France
Airbus Group, Elancourt, France


  1. Raleigh GG, Cioffi JM: Spatio-temporal coding for wireless communication. IEEE Trans. Commun. 1998, 46: 357-366.View ArticleGoogle Scholar
  2. Tang Z, Cannizzaro RC, Leus G, Banelli P: Pilot-assisted time-varying channel estimation for OFDM systems. IEEE Trans. Signal Process. 2007, 55(5):2226-2238.MathSciNetView ArticleGoogle Scholar
  3. Baird AJ, Zahm CL: Performance criteria for narrowband array processing. Proc. IEEE Conf. Decis. Control 1971, 1: 564-565.Google Scholar
  4. Zhihang Y, MinChul J, Il-Min K: Outage probability and optimum combining for time division broadcast protocol. IEEE Trans. Commun. 2011, 10: 1362-1367.Google Scholar
  5. Winters JH: Optimum combining in digital mobile radio with cochannel interference. IEEE J. Selected Areas Commun. 1984, 2: 528-539.View ArticleGoogle Scholar
  6. Roy S, Fortier P: Maximal-ratio combining architectures and performance with channel estimation based on a training sequence. IEEE Trans. Wireless Commun. 2004, 3: 1154-1164.View ArticleGoogle Scholar
  7. Hara Y: Weight-convergence analysis of adaptive antenna arrays based on SMI algorithm. IEEE Trans. Wireless Commun. 2003, 2: 56-57.Google Scholar
  8. Horowitz LL, Blatt H, Brodsky WG: Controlling adaptive antenna arrays with the sample matrix inversion algorithm. IEEE Trans. Aerosp. Electron. Syst. 1979, 15: 840-848.View ArticleGoogle Scholar
  9. Ketonen J: Equalization and Channel Estimation Algorithms and Implementations for Cellular MIMO-OFDM Downlink. University Of Oulu, Oulu, Finland; 2012.Google Scholar
  10. Barhumi I, Leus G, Moonen M: MMSE Estimation of Basis Expansion Models for Rapidly Time-Varying Channels. (ESAT laboratory of the Katholieke Universiteit Leuven, Leuven, Belgium; 2005.Google Scholar
  11. Lee S-H, Kim H-S, Lee Y-H: Complexity reduced space ML detection for other-cell interference mitigation in SIMO cellular systems. Eur. Trans. Telecom. 2011, 22(1):51-60.View ArticleGoogle Scholar
  12. Lagunas MA, Vidal J, Pérez Neira AI: Joint array combining and MLSE for single-user receivers in multipath gaussian multiuser channels. IEEE J. Selected Areas Commun. 2000, 18(11):2252-2259.View ArticleGoogle Scholar
  13. Vidal J, Cabrera M, Augustin A: Full exploitation of diversity in space-time MMSE receivers. IEEE Vehicular Tech. Conf. 2000, 5: 2497-2502.Google Scholar
  14. Maoudj R, Terre M: Post-combiner for interference cancellation algorithm. Int. Conf. Softw. Telecomm. Comput. Netw. 2012, 1: 1-5.Google Scholar
  15. Dumard C, Zemen T: Low-complexity MIMO multiuser receiver: a joint antenna detection scheme for time-varying channels. IEEE Trans. Signal Process. 2008, 56(7):2931-2940.MathSciNetView ArticleGoogle Scholar
  16. Hoeher P, Kaiser S, Robertson P: Pilot-symbol-aided channel estimation in time and frequency. IEEE Global Telecom. Conf. GLOBECOM 1997, 90-96.Google Scholar
  17. Auer G, Karipidis E: Pilot aided channel estimation for OFDM: a separated approach for smoothing and interpolation. IEEE Trans. Commun. 2005, 4: 2173-2178.Google Scholar
  18. Salman F, Cosmas J, Zhang Y: Pilot aided channel estimation for SISO and SIMO in DVB-T2 (Annual post graduate symposium on the convergences of telecommunication, networking and broadcasting. Liverpool, England; 2012:1-6.Google Scholar
  19. Caus M, Perez-Neira A: Space-time receiver for filterbank based multicarrier systems. In Procedure of international ITG workshop on Smart Antennas WSA. Bremen, Germany; 2010:421-427.Google Scholar
  20. Wen-Sheng H, Bor-Sen C: ICI Cancellation for OFDM communication systems in time-varying multipath fading channels. IEEE Trans. Commun. 2005, 4(5):2100-2110.Google Scholar
  21. Jakes WC: Microwave Mobile Communications. John Wiley & Sons Inc, Michigan, USA; 1975.Google Scholar
  22. COST-207: Digital land mobile radio communications. Final report of the COST-project 207, Commission Of the European Community, Brussels; 1989.Google Scholar
  23. Dyer SA, Dyer JS: Cubic-spline interpolation. 1. IEEE Instrum. Meas. Mag. 2001, 4(1):44-46.View ArticleMathSciNetGoogle Scholar
  24. Raghavendra MR, Bhashyam S, Giridar K: Interference rejection for parametric channel estimation in reuse-1 cellular OFDM systems. IEEE Trans. Vehicular Tech. 2009, 58: 4342-4352.View ArticleGoogle Scholar
  25. Zemen T, Mecklenbräuker CF, Wehinger J, Müller RR: Iterative joint time-variant channel estimation and multi-user detection for MC-CDMA. IEEE Trans. Commun. 2006, 5: 1469-1478.Google Scholar
  26. TMS320C6474 Multicore digital signal processor data manual (Rev. H). Texas Instruments Incorporated; 2001.Google Scholar
  27. Zemen T, Mecklenbrauker CF: Time-variant channel estimation using discrete prolate spheroidal sequences. IEEE Trans. Signal Process. 2005, 53: 3597-3607.MathSciNetView ArticleGoogle Scholar
  28. Zemen T, Bernado L, Czink N: Iterative time-variant channel estimation for 802.11p using generalized discrete prolate spheroidal sequences. IEEE Vehicular Tech. Conf. 2012, 1: 1222-1233.View ArticleGoogle Scholar


© Maoudj et al.; licensee Springer. 2014

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.