Вы находитесь на странице: 1из 8

Two-Dimensional Set Membership Afne Projection Adaptive

Channel Estimation for OFDM Systems



Akshay Soni
1
, Tanvi Sharma
2
and Vijaykumar Chakka
3


1,2,3
Dhirubhai Ambani Institue of Informaiton and Communication Technology
Email: akshay_soni@daiict.ac.in, tanvi_sharma@daiict.ac.in, vijaykumar_chakka@daiict.ac.in

Abstract
Orthogonal Frequency Division Multiplexing (OFDM) is seen as one of the most promising solution to
broadband wireless communications. Its performance depends on the channel state information (CSI) which can
be estimated using different channel estimation algorithms. This paper proposes a Set Member Feasibility
(SMF) formulation to govern the updating of the adaptive-filter coefficients. Here, two-dimensional Set-
Membership Affine Projection (2D-SM-AP) algorithm is proposed. In the proposed adaptive channel estimation
algorithm, the basic assumption is that the additional noise is considered bounded and the bound is either
known or can be estimated. The 2D-RLS adaptive channel estimation algorithm is also simulated for
comparison. Matlab simulations show that 2D-SM-AP algorithm has similar Bit Error Rate (BER) performance
as that of 2D-RLS algorithm. But the proposed algorithm has computational complexity of O(N) which is less
than that of conventional 2D-RLS algorithm having order O(N
2
). 2D-SM-AP algorithm compromises on the
convergence speed which is acceptable in stationary environments. Although, it should be noted that the
reduction in order is attained without compromising on the BER performance of the proposed algorithm.

Keywords: OFDM, SMF, 2D-SM-AP, 2D-RLS, 2D-MMSE

1. Introduction

In OFDM systems, two-dimensional Minimum Mean Squared Error (2D-MMSE) channel estimation in
frequency and time domain is optimum, if the noise is additive [6][7]. However, 2D-MMSE channel estimation
requires auto-covariance matrix of current channel impulse response (CIR) and cross-covariance vector between
CIR corresponding to n
th
symbol time and k
th
sub-carrier, and the current CIR. But, 2D-MMSE based channel
estimation may not provide desired performance in presence of weak channel correlation between the data and
pilot symbol transmission. This problem can be rectied by using more number of pilot symbols, but at the cost
of increasing computational complexity (O(N
3
) where N is the order of the filter) as well as signal overhead [8].
In [6], two-dimensional Recursive Least Square (2D-RLS) adaptive channel estimation for OFDM systems is
proposed. Unlike 2D-MMSE, it does not require accurate channel statistics. With properly chosen parameters, it
converges in several OFDM symbols time only. Also, preambles are required only during the training period.
SMF adaptive channel estimation algorithms allow trade-off between the speed of convergence while
constraining the overall computational complexity. In SMF algorithms, the adaptive-lter coefficients are
updated only when the output estimation error is greater than a prescribed threshold. The lter coefficients
which are updated should belong to a feasible set where the lter output satisfies a bounded error constraint [2].
The set-membership NLMS (SM-NLMS) algorithm was proposed in [3] which achieves a fast convergence and
its low computational complexity per update makes it very attractive in various applications [4].
Here, 2D-SM-AP adaptive channel estimation algorithm is proposed for OFDM systems. The algorithms like
2D-MMSE and 2D-RLS present a fast convergence speed and tend to be very dynamic. But in general, such fast
and dynamic behavior is not an essential feature required after convergence in a stationary environment. In the
proposed adaptive channel estimation algorithm, the basic assumption is that the additional noise is considered
bounded and the bound is either known or can be estimated [1]. This algorithm by doing trade-off in
convergence speed, reduces the computational complexity to O(N). Also, the BER performance of the proposed
algorithm is not compromised and is similar to the conventional 2D-RLS algorithm [5].
The paper has been organized as: OFDM system model is explained in Section II. Section III introduces the
concept of SMF algorithms with 2D-SM-AP algorithm described in Section III-A and algorithm summary given
in Section III-B. Section IV contains computer simulations and results followed by conclusion in Section V.


2. OFDM System Model

Consider an OFDM system working in a time-varying multi-path Rayleigh fading channel. Fig. 1 explains the
block diagram representation of channel estimation for OFDM systems. Initially, N
s
input samples are taken and
BPSK modulation is done. If K subcarriers are considered for OFDM then the BPSK samples are grouped in
symbols of length K. Since the channel is assumed to be slow-time-varying, it is considered constant for Z
OFDM symbols. OFDM symbol length is less than the coherence time of slow fading frequency selective cannel
therefore, ICI can be neglected.
Now, the OFDM system can be described as a set of parallel Gaussian Channels. Accordingly, at transmission
time n, the received signal on the k
th
sub-carrier can be expressed as
Y, = H, X, + N(, ) (1)
where X(n, k) represents transmitted signal on k
th
sub-carrier at time n and N(n, k) represents FFT of additive
complex Gaussian noise with zero mean and variance

2
, which is uncorrelated for different n or k.
For the initial Z input OFDM symbols, first L symbols are preambles and the rest are data symbols. The
output Y(n-1,k) for the first preamble X(n-1,k), after removal of CP and taking K-point FFT, is used for first LS
estimate

( 1, ) of the channel as
H

1, =
Y(1,)
X(1,)
(2)
Using similar approach, other LS channel estimates H

( 2, ), H

( 3, ), ..., H

( , ) are obtained. The


L LS estimated are stored in LK x 1 input vector as
= 1,1. . 1, , 1. . ,

(3)
and a K x 1 reference vector

() is constructed as

= 1,1 1,2 1,

(4)
where [.]
T
represents transpose.
Z-OFDM
Blocks
Update P(n) and
Href(n)
LS Channel Estimation
Initial L
Preambles
X(n,k)
Y(n, k)
2D-RLS/2D-SM-AP
Algorithm
1/ H(n)
X(n,k)
H(n, k) = Y(n, k) / X(n, k)
-1
+1
Decision Quantizer

Fig. 1. Block Diagram Representation of Channel Estimation Method

Using the vectors () and

(), the adaptive channel estimation algorithm is used for estimating the
channel

(). For every next Z OFDM symbols, input is estimated using the previous channel estimate and
Decision Quantizer [6] maps the input estimate to the corresponding BPSK symbols. Using these input
estimated, new L LS estimates of channel are obtained,

() and are updated and passed to the


adaptive channel estimation algorithm for constructing new channel estimation

().


3. Set-Membership Filtering

The adaptive channel estimation Eq.(2) is given by

( 1)() (5)
where () is LK x K weight coefficient matrix which needs to be estimated by adaptive algorithms and ()
is input vector as described in Eq. (3). The K x 1 priori estimation error vector (n) is given as
=

1() (6)
where

is described in Eq.(4) [6].


The objective of the SMF is to design such that the magnitude of estimation output error is upper bounded
by a prescribed quantity . In summary, any filter parameter leading to a magnitude of the output estimation
error smaller than a deterministic threshold is an acceptable solution. Bounded error constraint results in a set of
filters rather than a single estimate.
Assuming that S

denotes the set of all possible input-desired pairs (,

) of interest, it is possible to define


as set of all possible matrix leading to output errors whose magnitudes are bounded by whenever
,

. The set , called feasibility set [1] is given by


= {

ref

H
}
(,

)
(7)
Given a set of pairs (,

), define (n) as the set containing all matrices such that the associated output
error at time instant n is upper bounded in magnitude by . That is,
= {

ref

H
} (8)
The set () is usually referred as the constraint set [1]. The boundaries of () are hyperplanes. Since for
each pair (,

) there is associated constraint set, the intersection sets over all the available time instants is
called the exact membership set (n), formally defined as
() = ()

=0
(9)

Fig. 2. Exact Membership Set out of Constraint Set Fig. 3.Coefcient matrix updating for the 2D-SM-AP algorithm

The set (n) represents a polygon in the parameter space whose location is one of the main objectives of the
SMF. This polygon in and (n) should become small. In this case, the adaptive-filter coefficients do not need
updating because the current membership set is totally inside the constraint set, resulting in selection of update
which is data dependent. The selective updating of the SMF brings about opportunities for power and
computational savings.
As can be seen from Fig. 2, the feasibility set is a subset of the exact membership set (n). The goal of SMF
adaptive filtering is to adaptively find an estimate that belongs to the feasibility set. 2D-SM-AP algorithm has
been proposed to adaptively obtain the filter coefficients belonging to the feasibility set.


3.1 2D-SM-AP Algorithm

The equation for exact membership set (n) can be expressed as
=
1
=0

=
=
1
()
+1
() (10)
where
+1
() represents the intersection of the (+1) last constraint sets, whereas
1
() is the
intersection of first ( ) constraint sets. The aim of this derivation is to conceive an algorithm whose
coefficient update belongs to the last (+1) constraint sets, i.e.
+1
().
We can retain the last (+1) input vectors in a matrix as follows

= 1 (11)
where is as defined in Eq.(3). In a similar way

() and

are constructed [1]. The vector ()


specifies the point in
+1
(), where
= [
1

2

+1
()]

(12)
where

+1

() and represent the bound constraint to be satisfied by the


error magnitudes after updating the coefficients. This algorithm minimizes the Euclidean distance
( 1)
2
subject to constraint
+1
() such that the posterior errors at iteration ( ), ,
are kept constant for = 2, . . . , +1. The resulting update equations are given by
= 1 +

()()

(13)

() (14)
where is the variable step size and (0 < < 1) is added to avoid large step size when


becomes small.
=
1

()
, () >
0,

(15)

3.2 Algorithm Summary

Step.1: Initialization (n = 0)
Regularization parameter : 0 < < 1
= 5

2

0 =
where

2
represents noise variance.
Step.2: The algorithm operates on a set of X received OFDM symbols at a time. L LS channel estimations are
done using the preamble symbols using equation (2) and P(n),

are constructed using Eq.(3) and (4).


Step.3: New channel estimation is done using Eq.(5).
Step.4: Weight coefficient matrix G(n) is recursively updated as by using equations (6), (13) and (15).
Step.5: As the next OFDM symbols come, L symbols of input are estimated by using the previous estimated
channel.
Step.6: Using Decision Quantizer, mapping of input estimates to BPSK symbols is done as shown in Fig. 1.
These L mapped symbols are treated as true inputs (as preambles) and new L channel estimates are done
using equation (2) using which P(n) and

are updated as in Eq.(3) and (4).


Subsequently, all the steps from Step.3 to Step.6 are repeated for the next received OFDM symbols.




4. Computer Simulations and Results

The adaptive channel estimation algorithms 2D-SM-AP and 2D-RLS are simulated in Matlab for SISO-OFDM
system for IEEE 802.11b standard. The total bandwidth of 20 MHz is divided into 64 sub-carriers and the
effective OFDM symbol length Ts is 3.2 s. BPSK modulation is utilized. The fixed and time-varying Rayleigh
fading channel is modeled using smith model [9] as equal spaced (0.05 s) tap delay-line (TDL) structure with
exponential power delay profile. Maximum multipath delay (T
d
) of the channel is taken as 0.5 s. The number
of symbols Z is taken as 5 for slow time-varying channel, the number of previous LS channel estimates L is
taken as 2 and regularization parameter is set to 0.1 for simulation purposes.

2D-RLS 2D-SM-AP
20K
2
+ 6K + 2 12K + 13

Table 1: Operation Count Per Iteration for L = 2 and K Sub-carriers at SNR = 10 dB

Table I depicts the operation count per iteration for 2D-RLS and 2D-SM-AP algorithms. It is observed that the
operation count per iteration for 2D-SM-AP algorithm is significantly lower than 2D-RLS algorithm. It is
evident that the complexity has reduced by an order (O(N)) in the proposed algorithm than the conventional 2D-
RLS algorithm (O(N2)).

2D-RLS 493884
2D-SM-AP ( = 5

2
)
6248
2D-SM-AP ( = 0.5

2
)
8591
2D-SM-AP ( = 0.05

2
)
10934

Table 2: Total Operation Count for Convergence for L = 2 and K = 64 at SNR = 10 dB

Table II shows the total operation count required for the convergence of 2D-SM-AP algorithm for different
threshold values and 2D-RLS algorithm at SNR 10dB. It can be seen that as the threshold value is decreased, the
total operation count required for convergence of the proposed algorithm is increased.
Fig. 4 compares the BER performance of 2D-SM-AP algorithm with different threshold values and 2D-RLS
algorithm. Here, CP of length 0.8 s is considered which is greater than T
d
of the channel, hence ISI can be
neglected. It is evident from the figure that the BER performance of both the algorithms is similar. Also,
changing the threshold values does not affect the BER performance of the 2D-SM-AP algorithm.
Fig. 5 shows the Normalized Mean Square Error (NMSE) performance of 2D-SM-AP and 2D-RLS algorithms
at SNR 10dB. It is seen that 2D-RLS converges very fast in only 5 iterations, whereas the convergence speed of
2D-SM-AP algorithms is slow, taking around 10 15 iterations which is acceptable in stationary environments.
However, as the threshold value becomes less, the increased total operation count leads to more number of
iterations required for convergence. Also, the error floor for the algorithms is nearly same.

Fig. 4. BER performance of 2D-RLS & 2D-SM-AP algorithms

Fig. 5. NMSE performance of 2D-RLS and 2D-SM-NLMS algorithms at SNR 10dB



5. Conclusion

In this paper, 2D-SM-N adaptive channel estimation algorithm has been proposed for OFDM systems. The
adaptive-lter coefficients are updated only when the error is more than the predefined threshold. This algorithm
slightly compromises on the convergence speed which is acceptable in stationary environments. But it provides
improvement in the computational complexity of the algorithm (O(N)) than the 2D-RLS adaptive channel
estimation algorithm (O(N
2
)). Reducing the threshold value increases the operation count for convergence
without affecting the BER performance of 2D-SM-AP algorithm. Matlab simulations show that the low
computational complexity is achieved keeping the BER performance of 2D-SM-AP algorithm similar to the
conventional 2D-RLS algorithm.


References

1. P.S.R. Diniz, Adaptive Filtering-Algorithms and Practical Implementation, 3rd ed., Springer, 2008.
2. P.S.R. Diniz, G.O. Pinto and A. Hjrungnes, Data Selective Partial-Update Afne Projection Algorithm,
International Conference on Acoustics, Speech and Signal Processing (ICASSP), March 2008.
3. S. Gollamudi, S. Nagaraj, S. Kapoor, and Y.F. Huang, Set-Membership Filtering and a Set-Membership
Normalized LMS Algorithm with an Adaptive Step Size, IEEE Signal Processing Letters, Vol. 5, pp. 111-
114, May 1998.
4. S. Werner and P.S.R. Diniz,Set-Membership Afne Projection Algorithm, IEEE Signal Processing
Letters, Vol. 8, No. 8, August 2001.
5. T. Sharma, A. Soni and V.K. Chakka,Two-Dimensional Set Membership Normalized Least Mean Square
Adaptive Channel Estimation for OFDM Systems, Proceedings of INDICON 2009, pp. 125-128,
December 2009.
6. X. Hou, S. Li, C. Yin and G. Yue, Two-Dimensional Recursive Least Square Adaptive Channel
Estimation for OFDM Systems, International Conference on Wireless Communications, Networking and
Mobile Computing, pp. 232-236, 2005.
7. P. Hoeher, S. Kaiser and P. Robertson, Two-Dimensional Pilot-Symbol-Aided Channel Estimation by
Wiener Filtering, International Conference on Acoustics, Speech and Signal Processing (ICASSP), 1997.
8. S.K. Kim and Y.H. Lee, 3-Dimentional MMSE Channel Estimation in Multi-Antenna OFDM Systems,
The Third International Conference on Digital Communications, pp. 6-10, 2008.
9. T.S. Rappaport, Wireless Communications, Pearson Edition, 2002.

Вам также может понравиться