Open access

Adaptive Beamforming Algorithm Using a Pre-filtering System

Written By

Omar Abu-Ella and Bashir El-Jabu

Published: 01 January 2010

DOI: 10.5772/7167

From the Edited Volume

Aerospace Technologies Advancements

Edited by Thawar T. Arif

Chapter metrics overview

4,027 Chapter Downloads

View Full Metrics

1. Introduction

As depicted in Fig. 1, adaptive beamforming algorithms can be classified into two categories: non-blind adaptive algorithms and blind adaptive algorithms [1]. Non-blind adaptive algorithms rely on statistical knowledge about the transmitted signal in order to converge to a solution. This is typically accomplished through the use of a pilot training sequence sent over the channel to the receiver to help it identifying the desired user. On the other hand, blind adaptive algorithms do not require prior training, and hence they are referred to as “blind” algorithms. These algorithms attempt to extract salient characteristic of the transmitted signal in order to separate it from other users in the surrounding environment [2]. In this chapter we propose a technique that could be used with the blind or non blind algorithms to enhance their performance. This technique acts on the input signal vector x(k) as a band pass filter but in spatial domain, so it minimizes the noise and interference effects as a function of the Direction of Arrivals (DOAs).

Figure 1.

General classifications of adaptive array algorithms.

Advertisement

2. Proposed hybrid adaptive beamforming technique

The proposed technique which introduced in [3] aims to increase the Signal-to-Interference and Noise Ratio (SINR) of the beamforming system by reducing the interference and noise effects on the desired user signal using filtering in spatial domain, or extracting the desired signal from the instantaneous input signal vector x(k) of the beamformer, as can be seen in Fig. 2. In this context, it is worth pointing out that in image processing, especially in image compressing techniques, one can find an abundance of techniques that can reconstruct the original image with acceptable performance, without using all transformation components, but rather using only the lower component coefficients of the image transform matrix [4]. We will exploit this fact with some modifications and employ it in the antenna array processing to obtain a new beamforming technique.

Figure 2.

Proposed blind adaptive beamformer with pre-filtering system.

Since the interfering signals are in the same frequency band of the desired signal, we investigate representing them in another domain other than frequency domain so as to distinguish between the mixed signals that form the input signal. Therefore, the proposed technique is based on the idea that the desired and interfering signals arrive at the antenna array from different directions. Thus, we exploit these differences between arriving signals. The distinction can be obtained by converting the input signal to the spectrum of the spatial domain (this domain is the sine of the direction of arrival, or sin θ domain). The desired signal can be extracted from the input system signals simply by making a band-pass filter in the spectrum of the spatial domain, i.e., in the sin θ spectrum. This filtering process is shown in Fig. 3, and can be explained generally as follows:

  • The original input signal is passed through a Fast Fourier Transform (FFT) stage to obtain its coefficients in the spectrum domain.

  • The Most Significant Coefficient (MSC) of the transformed signal is selected. This is ranked as the largest sample of the transformed desired signal.

  • The most significant coefficient is placed at its rank in the M zeros element vector (zero padding).

  • The Inverse Fast Fourier Transform (IFFT) is applied to the filtered vector of the previous step to reconstruct an alternative input signal that contains a reduced amount of interference and noise.

  • The reconstructed data vector is used as input signal to the adaptive beamforming system.

Figure 3.

Pre-filtering system.

Mathematically, assuming that the narrow band array propagation vector for the θ direction of arrival is given by

a ( θ ) = e j 2 π d λ sin θ ( m 1 ) , m = 1 , 2 , , M E1

where M is the number of array elements, d is the spacing distance between any two adjacent elements, and λ is the wavelength of the operating carrier frequency. Applying the FFT on the array propagation (Equation 1) gives

A ( Θ ) = F F T ( a ( θ ) ) = 1 M m = 1 M e j 2 π d λ sin θ ( m 1 ) e j 2 π K ( m 1 ) / M = 1 M m = 1 M e j 2 π ( d λ sin θ ( m 1 ) + K M ( m 1 ) ) E2
Let
d = λ / 2 E3
then
A ( Θ ) = 1 M m = 1 M e j 2 π ( K M + sin θ 2 ) ( m 1 ) = 1 M e j π ( 2 K + M sin θ ) / M e j 2 π ( 2 K + M sin θ ) ( M 1 ) / M e j π ( 2 K + M sin θ ) / M 1 = 1 M { e j π ( 2 K + sin θ M ) ( 3 2 M 2 ) [ e j π ( 2 K + M sin θ M ) ( M 1 2 ) e j π ( 2 K + M sin θ M ) ( M 1 2 ) ] e j π ( 2 K + sin θ 2 M ) [ e j π ( 2 K + M sin θ 2 M ) e j π ( 2 K + M sin θ 2 M ) ] } = e j π ( 2 K + sin θ M ) ( M 1 ) [ sin ( π ( 2 K + M sin θ M ) ( M 1 2 ) ) M sin ( π ( 2 K + M sin θ 2 M ) ) ] E4

By differentiating Equation (3) and equating the result to zero, the following formula gives the index K MSC (or the order) of the most significant coefficient as a function of the direction of arrival θ and the number of array elements M

K M S C = [ 1 2 ( M [ 2 π M sin θ π sin θ + j 2 tanh 1 ( M 1 2 M 1 ) ] π ( 2 M 1 ) ) ] int E5

where [ x ] int means the integer part of x.

Since the index K MSC must be a real integer, the formula in Equation (4) is modified to take the form

K M S C = mod M { 1 + M [ 1 2 ( M ( 2 π M sin θ π sin θ ) π ( 2 M 1 ) ) ] int } E6

where mod M is the modulus notation, performed on M points.

Equation (5) can be simplified to

K M S C = mod M ( [ 1 1 2 M sin θ ] ) E7

To illustrate the idea of the pre-filtering system consider, as an example, an array of 4 elements, with desired DOA = –45˚and signal sample s d = - 0.0035 - 0.1000i. Then, from Equation (1) the array propagation factor at the desired direction is

a ( θ d ) = [    0 .9990 -  0 .0000i   -0 .6049 + 0 .7958i   -0 .2663 -  0 .9623i    0 .9280 + 0 .3715i ] E8

Thus, the desired signal vector s = s d a ( θ d ) is given by

s = [ -0 .0035 -  0 .0999i  0 .0817 + 0 .0577i -0 .0953 + 0 .0300i  0 .0339 -  0 .0941i ] E9

And assuming that there is an undesired signal vector u, such that:

u = [ -0 .0241 -  0 .7054i -0 .7078 + 0 .0253i  0 .0239 + 0 .7065i  0 .7069 -  0 .0256i ] E10

Thus, by adding the weighted desired and the desired signals the total input signal is given as:

x = [  -0 .0276 - 0 .8053i   -0 .6261 + 0 .0830i   -0 .0714 + 0 .7365i   0 .7408 - 0 .1197i ] E11

By passing this input data vector through the FFT stage, we get the following transform coefficients vector

X = [    0 .0156 - 0 .1055i    0 .2465 - 0 .1749i   -0 .2137 - 0 .0322i   -0 .1589 - 2 .9087i ] E12

Appling Equation (6) on the given DOA and the number of array elements we find that the most significant coefficient is the second coefficient. Replacing the other coefficients by zeros, we get the following vector

X z [            0             0 .2465 - 0 .1749i            0              0   ] E13

Now, applying the IFFT on the zero padded vector we get the reconstructed input vector as follows

x ˜ = [    0 .0616 - 0 .0437i    0 .0437 + 0 .0616i   -0 .0616 + 0 .0437i   -0 .0437 - 0 .0616i ] E14

To take advantage of the pre-filtering technique to reduce the mean square error (MSE), we determine the fluctuations of the original input data vector x ˜ and the reconstructed input data vector x from the desired signal vector s

s x = [  0 .0241 + 0 .7054i  0 .7078  -  0 .0253i -0 .0239  -  0 .7065i -0 .7069 +0 .0256i ] E15
s x ˜ = [  -0 .0652 - 0 .0562i   0 .0379 - 0 .0039i  -0 .0338 - 0 .0137i    0 .0776 - 0 .0324i ] E16

MSE of the conventional technique = 20 log ( | s x | ) = 9.0306 dBv

MSE of the proposed technique = 20 log ( | s x ˜ | ) = -12.2258 dBv.

It is clear that the proposed technique reduces the MSE in this example by more than 21 dB; this improvement is significant in communications systems.

As explained in the general steps shown in Fig. 4, the output of the pre-filtering stage is applied as an input to the beamforming algorithms. The flowchart of the whole process using the constant modulus algorithm CMA(1,2) is as indicated in the figure. Other algorithms (other than the CMA) can also be used.

Figure 4.

Flowchart of the proposed hybrid technique

Advertisement

3. Quadratic diagram and the SIR improvement in the beamformer input signal using the proposed hybrid technique

The quadratic (i.e. the complex plane) diagram of the input signal vector to the beamformer system is represented in Fig.5, where s i , u i and x i represent, respectively, the desired, undesired and the total input signal on the ith element of the array. For clarity, only the angles of s 1 , u 1 , x 1 are shown.

Figure 5.

The desired, interfering and the total input signal vectors in the quadratic plane.

The desired signal vector can be represented as

s = s a ( θ d ) E17

where a ( θ d ) is the array propagation vector corresponding to the desired direction and it is given as,

a ( θ d ) = e j 2 π λ ( m 1 ) d sin θ d , m = 1 , 2 , , M E18
,and s = r d e j ϕ d is the desired signal sample. Equation (7) can be put in the form
s = r d e j ϕ d e j 2 π λ ( m 1 ) d sin θ d E19

Assuming d = λ / 2 , the desired signal vector can be written in the form

s = r d e j ( ϕ d π ( m 1 ) sin θ d ) E20

The complex rectangular coordinates of the vectors can be expressed as

x d = r d cos ( ϕ d π ( m 1 ) sin θ d ) E21
y d = r d sin ( ϕ d π ( m 1 ) sin θ d ) , m = 1 , 2 , , M E22

It is clear that the resulting signal is an array containing vectors with a constant magnitude r d , and each vector has a specific phase ϕ d ( m ) = π ( m 1 ) sin θ d , m = 1 , 2 , , M . Similarly, the undesirable signal vector can be put in the form

u = r u e j ( ϕ u π ( m 1 ) sin θ u ) E23

the complex rectangular coordinates of which can be expressed as

x u = r u cos ( ϕ u π ( m 1 ) sin θ u ) y u = r u sin ( ϕ u π ( m 1 ) sin θ u ) E24

In case of interference, the total received signal can be put as

x = s + u E25
x = r d e j ( ϕ d π ( m 1 ) sin θ d ) + r u e j ( ϕ u π ( m 1 ) sin θ u ) E26

for which, the complex rectangular coordinates may be written as:

x x = r d cos ( ϕ d π ( m 1 ) sin θ d ) + r u cos ( ϕ u π ( m 1 ) sin θ u ) y x = r d sin ( ϕ d π ( m 1 ) sin θ d ) + r u sin ( ϕ u π ( m 1 ) sin θ u ) E27

The resulting overall vector magnitude can be obtained as follows

r x = x x 2 + y x 2 = ( x d + x u ) 2 + ( y d + y u ) 2 = ( x d 2 + y d 2 ) + ( x u 2 + y u 2 ) + 2 ( x d x u + y d y u ) = ( r d 2 + r u 2 ) + 2 r d r u ψ E28

where

ψ = cos ( ϕ d π ( m 1 ) sin θ d ) cos ( ϕ u π ( m 1 ) sin θ u ) + sin ( ϕ d π ( m 1 ) sin θ d ) sin ( ϕ u π ( m 1 ) sin θ u ) E29

is the variation in the total signal magnitude (desired and undesired signals) caused by the interference (undesirable signals). Here, ψ ( m ) is not a constant value for all values of m except when θ d and θ u are equal; in this case the proposed technique will not improve SIR; but generally most of beamforming algorithms fail in this case. Since we have assumed in this chapter that the interfering signal arrive at a direction different from the desired signal direction, r x ( m ) can not to be a constant value, i.e., the total input signal vector x ( m ) will appear scattered in the complex plane.

To show the Signal-to-Interference Ratio (SIR) improvement in the input signal vector using the proposed hybrid beamforming technique we determine the gained signal-to-interference ratio in the reconstructed signal vector using the pre-filtering technique of the hybrid beamforming system. Assuming a linear system, the total input signal vector x(m) is the sum of the desired signal s(m) and the undesired one u(m) –i.e.-

x ( m ) = s ( m ) + u ( m ) E30

Similarly, for the reconstructed input data vector x ˜ ( m ) ,

x ˜ ( m ) = s ˜ ( m ) + u ˜ ( m ) E31

where s ˜ ( m ) , and u ˜ ( m ) are the desired and undesired reconstructed signals vector respectively. To generalize the procedure, we will assume that an arbitrary signal sample v = r e j ϕ arrives to the array at θ direction. Therefore, the array signal vector of this signal will be in the form

v ( m ) = r e j ϕ e j π sin θ ( m 1 ) , m = 1 , 2 , , M E32

The fast Fourier transform of the resulting signal vector v(m) is

V ( k ) = F F T [ v ( m ) ] = m = 1 M v ( m ) e j 2 π ( k - 1 ) ( m - 1 ) / M = m = 1 M r e j ϕ e j 2 π ( k - 1 ) ( m - 1 ) / M = r e j ϕ e j π 2 [ M sin θ + 2 ( k 1 ) ] ( M + 1 ) / M [ sin ( π 2 [ M sin θ + 2 ( k 1 ) ] ) sin ( π 2 [ M sin θ + 2 ( k 1 ) ] / M ) ] E33

Now, the value of the specific kth coefficient from the transformed signal vector V(k) can be calculated. This coefficient will be selected to reconstruct the signal vector v ˜ ( m ) . Substituting for the kth index in Equation (6) into Equation (21) gives the value of the most significant coefficient as

V ( k M S C ) = r e j ϕ e j π M 2 [ sin θ sin θ d ] ( M + 1 ) / M [ sin ( π M 2 [ sin θ sin θ d ] ) sin ( π 2 [ sin θ sin θ d ] ) ] E34

This value will be put in a zeros vector in the rank of the k MSC so that we can express the resulting signal vector as

V ( k M S C ) = r e j ϕ e j π M 2 [ sin θ sin θ d ] ( M + 1 ) / M [ sin ( π M 2 [ sin θ sin θ d ] ) sin ( π 2 [ sin θ sin θ d ] ) ] δ ( k k M S C ) , k = 1 , 2 , M E35

where

δ ( k k M S C ) = { 1 , k = k M S C 0 , elsewhere E36

The reconstructed signal vector can be obtained by applying inverse Fourier transformation to Equation (23) as follows

v ˜ ( m ) = 1 M k = 1 M V ( k M S C ) e j 2 π ( k 1 ) ( m 1 ) / M = 1 M V ( k M S C ) e j π sin θ d ( m 1 ) = r e j ϕ e j π sin θ d ( m 1 ) e j π M 2 [ sin θ sin θ d ] ( M + 1 ) / M 1 M [ sin ( π M 2 [ sin θ sin θ d ] ) sin ( π 2 [ sin θ sin θ d ] ) ] E37

Therefore, we can put the signals in the form

v ˜ = G 1 ( r , ϕ , θ ) G 2 ( θ ) E38

where

G 1 ( r , ϕ , θ ) = r e j ϕ e j π sin θ d ( m 1 ) e j π M 2 [ sin θ sin θ d ] ( M + 1 ) / M E39

It is clear from Equation (24 c) that the magnitude of G 1 equals the signal magnitude r

and
G 2 ( θ ) = 1 M [ sin ( π M 2 [ sin θ sin θ d ] ) sin ( π 2 [ sin θ sin θ d ] ) ] E40

The variation of G 2 as a function of θ is shown in Fig. 6 from which it is clear that its value equal unit only if and only θ = θ d . Fig. 7 shows the effects of the gains on the magnitude of the desired, undesired and the total input signal.

In Fig. 7, it is assumed that r d >r u without loss of generality.

Note that, in case of s ˜

G 1 ( r d , ϕ d , θ d ) = r d e j ϕ d e j π sin θ d ( m 1 ) E41

and from Equation (2d)

G 2 ( θ d ) = 1 E42

Note that, in case of u ˜

G 1 ( r u , ϕ u , θ u ) = r u e j ϕ u e j π sin θ d ( m 1 ) e j π M 2 [ sin θ u sin θ d ] ( M + 1 ) / M E43

Figure 6.

Magnitude of G 2 versus DOA.

Figure 7.

Desired, interference and the total input signal in the quadratic plane.

and
G 2 ( θ u ) = 1 M [ sin ( π M 2 [ sin θ u sin θ d ] ) sin ( π 2 [ sin θ u sin θ d ] ) ] E44

Note that in case of the desired signal (i.e. θ = θ d ) G 2 will be equals one i.e. the maximum value. However, in case of the undesired signal (i.e. θ = θ u ) G 2 will be attenuated i.e. will be less than one.

The overall reconstructed input signal vector x ˜ ( m ) , which consists of the desired signal vector and attenuated interfering signal vector can be given by

s ˜ = G 1 ( r d , ϕ d , θ d ) G 2 ( θ d ) E45
and
u ˜ = G 1 ( r u , ϕ u , θ u ) G 2 ( θ u ) E46

Substituting Equation (26) into Equation (19) gives

x ˜ ( m ) = r d e j ϕ d e j π sin θ d ( m 1 ) + r u e j ϕ u e j π sin θ d ( m 1 ) e j π M 2 [ sin θ u sin θ d ] ( M + 1 ) / M 1 M [ sin ( π M 2 [ sin θ u sin θ d ] ) sin ( π 2 [ sin θ u sin θ d ] ) ] E47

Note that the overall reconstructed x ˜ ( m ) (overall reconstructed signal on the mth element) has a constant magnitude, because its derivative with respect to m is zero (i.e. d d m ( | x ˜ ( m ) | ) = 0 ), which means that the hybrid technique eliminates the magnitude fluctuation which is described in Equations (16) and (17).

As a result, we can evaluate the signal-to-interference ratio SIR improvement in the reconstructed input vector x ˜ ( m ) . Since the magnitude of the desired signal vector stays constant without any attenuation and the interfering signal vector magnitude is decreased by the factor | 1 M [ sin ( π M / 2 [ sin θ u sin θ d ] ) sin ( π / 2 [ sin θ u sin θ d ] ) ] | , therefore, the maximum possible gained S I R G in dB can be expressed as

S I R G = 20 log { | M sin ( π 2 [ sin θ u sin θ d ] ) sin ( π M 2 [ sin θ u sin θ d ] ) | } d B E48

A simulation setup will be used to show the improvements in the reconstructed input signal vector. Fig. 8 shows a quadratic diagram representation of a desired signal, arriving at DOA of 60˚, an interfering signal with arbitrary DOA of 40˚, the original received signal without using the pre-filtering technique, and the reconstructed signal after the pre-filtering process. From these results, one can observe that the reconstructed input data vector is closer to the desired signal than the original received input vector which is scattered by the interference effects. For this reason, the pre-filtering process is performed directly before the beamforming process in the proposed hybrid algorithm. This will help the beamformer in extracting the desired signal in easier and faster way.

Fig. 9 illustrates the quadratic diagram of a similar scenario but with the desired signal arriving at DOA of 45˚ and 6 undesired signals arriving at DOAs of (19˚, 60˚, 120˚, 240˚, 300˚, 341˚) with respect to the DOA of the desired signal. In this figure, one can observe the extensively scattering of the compound interfering signal which causes the scattering of the original input data vector. However, the same figure shows that the reconstructed input signal is not scattered and nearer to the desired signal. Thus, pre-filtering effectively reduces the noise and interfering.

In summary, the pre-filtering technique generates a new input data signal with lower undesired signal than the original one. This reduction is obtained previously by taking the most significant coefficient of the desired signal (and ignoring the other coefficients) (similar to bandpass filtering). To see the possibility of reducing the undesired signal by discarding the most significant coefficient of the undesired signal (similar to band reject filtering), the same scenario is used in Fig. 8 gave the results shown in Fig. 10 which illustrates lower performance.

Advertisement

4. Simulation results

This section compares the performance of the proposed hybrid adaptive algorithms with some of conventional adaptive beamforming algorithms. The factors used for this comparison are:

Figure 8.

Quadratic diagram in case of single interferer signal.

Figure 9.

Quadratic diagram in case of multiple interferer signals.

Figure 10.

Quadratic diagrams (complex plane) in case of discarding the interferer signal.

  • Beam Pattern Characteristics (Beam gain in small angular separation between desired and undesired signals).

  • Resulting Signal-to-Interference Ratio SIR.

  • Bit Error Rate (BER) behavior with Respect to SINR.

  • System Capacity (Number of user in the system).

  • The Outage Probability of the System.

  • Computational Complexity.

  • Convergence Speed.

  • Tracking performances

In each case, simulation environment parameters are assumed to realize the system in the case. Overall simulation environments are written using MATLAB code.

4.1. Beam pattern performance

The array response to the signal with direction of arrival θ is given by [5]

G ( θ ) = i = 1 M w i e j 2 π λ ( i 1 ) d sin θ E49

where w i is the ith value of the weight vector. This array response, G ( θ ) , can also be represented in a vector form as

G ( θ ) = w H a ( θ ) E50

where w is the weight vector and H is the Hermitian notation. The beam pattern G BP defined as the magnitude of G(θ) has the form

G B P ( θ ) = | w H a ( θ ) | E51

Initially, a simulation is carried out assuming arrival direction of the desired signal at 60˚ interfering signal arrives from 50˚(small separation angle and equal power of the desired signal, which represents a tight condition) and the initial weights vector is taken as the first column of the identity matrix, i.e. w ( 0 ) = [ 1 , 0 , 0 , , 0 M ] T . The results obtained after 1000 iterations, using an adaptive array system with eight antennas. The beam pattern obtained for the conventional Constant Modulus Algorithm (CMA), which is considered as one of the most efficient blind algorithms and the proposed technique. A comparison between these two results is displayed in Fig.11. It is clear that the maximum gain of the main lobe directed toward the desired direction for the proposed hybrid technique is greater than that for the conventional CMA by about 2 dB, and the minimum gain (null) at undesired direction for the proposed technique is less than that for the conventional CMA by 7 dB (better performance). This means that the proposed hybrid algorithm is more efficient in forming the beam pattern. The results are as displayed in Fig. 12 from which it is clear that the directivity of the hybrid algorithm is higher than that of the conventional one, i.e., the former is more capable in distinguishing between neighboring users (a serious problem for conventional blind adaptive beamforming algorithm).

Figure 11.

Beam patterns of CMA and hybrid technique in (dB).

Figure 12.

Polar beam patterns of CMA and hybrid technique for small angular separation between desired and interfering DOAs.

4.2.Signal-to-Interference Ratio (SIR) performance and power budget

The SIR for adaptive array can be written to have the form

S I R = w H s d 2 a ( θ d ) a H ( θ d ) w w H R I w E52

where a(θ d ) is the array propagation vector at the desired direction of arrival, s d is the desired signal sample, and R I is the covariance matrix of the interference signal.

The simulation is carried out under the same previous conditions, but with lower noise level. Fig. 13 shows the results. The steady state of the hybrid technique is at about 23 dB while that of the conventional algorithm is less than 6 dB (improvement of more than 17 dB in favor of the proposed technique). The SIR for both algorithms is evaluated as a function of interfering DOA assuming the desired user is at 0˚. Fig. 14 indicates a better performance for the hybrid technique in most of the time.

To obtain the power budget in this tight case, i.e., at a smaller angular separation of 10 degrees, we determined the ratio between the gain beam pattern at desired direction, G d , and the maximum possible gain G max , i.e. G d / G max . This ratio is 11 / 16 for the hybrid CMA technique and 5 / 16 for the conventional CMA, another advantage of the proposed technique (Gain of the power budget more than 3 dB).

4.3. BER behavior with respect to SINR

This part studies the effects of the proposed technique on the required SINR to achieve a specific bit error rate. Through out this chapter the required BER is assumed to be 10-8 because of simulation considerations, since a BER of 10 -k needs 10(k+1) samples for the simulation results to lie within a confidence interval of 90% [2]. The conventional CMA

Figure 13.

SIR versus the number of iterations for the conventional CMA and hybrid technique.

Figure 14.

SIR variations against interference direction of arrival for desired direction of arrival = 0˚.

algorithm will be used as a reference. The results shown in Fig. 15 are obtained using an array receiving a desired signal at 0˚ and 6 interfering signals arriving at 19˚, 60˚, 120˚, 240˚, 300˚ and 341˚. The array uses 4 elements. These curves show that in case of SNR = 6 dB, the proposed hybrid technique needs -12.7 dB SINR to achieve 10-8 BER while the conventional CMA algorithm needs -2.7 dB to achieve the same BER (a difference of 10 dB in favor of the proposed technique). When the SNR is changed to 20 dB the difference becomes 12 dB.

Figure 15.

BER versus SINR using CMA, hybrid technique, using 4-antenna arra.

4.4. System capacity

Beamforming often affects system capacity. Here, effect of the proposed technique on the capacity of cellular CDMA system is considered. System capacity (in terms of the number of users M) can be determined using [7]

M = ( E b I o ) ( R b B c ) + 1 ( 1 + γ ) ( E b I o ) ( R b B c ) E53

where E b is the energy per bit, I o is the interference power spectral density (PSD) in Watts/Hertz, R b is the message data rate in bits per second, B c is the radio channel bandwidth in Hertz, where B c >> R b , and

γ = j = 1 J G I j G d E54

is the inverse of the total SIR experienced by the mobile in the cell under considerations from the cochannel cells assuming one mobile per cochannel cell, G d is the desired beam gain evaluated at direction θ d G Ij is the beam gain of the jth interfering cell evaluated at θ i . The aim of this proposed hybrid technique is to suppress the γ value by decreasing the interference beam gain at θ i direction. The factor γ is evaluated by simulating the beamforming system with 4- and 8-element array antenna, in environment with 20 dB SNR assuming each interfering user generates interference power equal to the desired user power. A CDMA cellular system is assumed with service bit rate of 8000 and 32000 bps for each user, and with chip rate of 4 Mcps. The results are displayed in Fig. 16. The results shows that for the case of 8000bps rate the systems capacities for E b /I o = -6dB are 213 and 228 users for the hybrid system using 4- and 8-element array respectively whereas the conventional system capacity are 80 and 89 users for 4 and 8 elements array system respectively. Thus, the proposed algorithm increases the system capacity by 1.5 folds comparing with the conventional system capacity. The same trend applies for the case of 32000 bps service bit rate as shown in Fig. 16 (b).

4.5. The outage probability

Here, the effect of the proposed technique on the outage probability for both up link and down link will be consider.

4.5.1. Outage probability of the down-link system

The performance of the system can be expressed in terms of the outage probability, i.e., the probability that the bit error rate (BER) exceeds a certain threshold required BER, (BER max), normally10-8, i.e.

P o = Pr ( B E R B E R max ) E55

The outage probability can be defined as the probability that the SIR falls below minimum required SIR [6]. In cellular CDMA the system outage probability could be determined by the following [7]

Figure 16.

Number of users versus Eb/Io

p o = Q ( χ E [ I o u t S ] M G P var [ I o u t S ] ) E56

where χ = 1 σ r e q I i n S η S , E [ I o u t / S ] is the ratio of the intercellular interference-to-signal ratio, σ r e q is the required SINR for the BER to be less than B E R max , M is the number of users, G P is the processing gain, η S is the ratio of received thermal noise to user signal power, and

E [ I o u t S ] = ( M + 1 ) G P E [ γ ] = ( M + 1 ) G P j = 1 j k J E [ G ( θ j ) G ( θ k ) ] E57

where E[γ] is the intercellular interference factor. Therefore, the outage probability will be given as

P o = Q ( 1 σ r e q M + 1 G P ( 1 + E [ γ ] ) η S M G P var [ I o u t S ] ) E58

The system with seven cells (desired one and six interfering using 8-element array system), which is represented in Fig. 17, is used to simulate the down-link of the cellular system in this section. The results of this simulation model are tabulated in Table 1.

Now, assuming M>>1, and using the simulation results in Table 1 we can expressed the outage probability using CMA(1,2) (conventional algorithm) for 8-element array system as follows

p o = Q ( 1 σ r e q M 7 .7026 G P η s M 0 .4520 G P ) E59

Figure 17.

Down-link cellular system with seven cells.

Technique Item Cell number (j)
1 2 3 4 5 6 7
CMA(1,2) G( θ j ) 1.8304 1.5027 2.3538 2.2899 2.3533 2.3457 1.4232
G( θ j )/G( θ 1 ) 1.0000 0.8209 1.2859 1.2510 1.2857 1.2815 0.7775
Hybrid Technique G( θ j ) 9.8264 1.5895 1.0812 0.9990 1.0812 1.0098 1.1439
G( θ j )/G( θ 1 ) 1.0000 0.1618 0.1100 0.1017 0.1100 0.1028 0.1164

Table 1.

Down-link beam gains at different directions of arrival.

while that of the proposed technique is given by

p o = Q ( 1 σ r e q M 1 .7027 G P η s M 0 .2214 G P ) E60

The results of Equation (39) and (40) are displayed in Fig. 18 for SNR = 0 dB and 20 dB. From this figure, it is clear that the hybrid technique decreases the outage probability of the system. This decrease will help in increasing the number of users that can be accommodated in the system (System Capacity). As an example, assuming that the acceptable outage probability is 1% and SNR = 0 dB, the system capacity will be 40 and 86 users for the conventional and hybrid system respectively, in case of 4-element array, and 45 and 108 users in case of 8-element array. Therefore, doubling the array size improves the system capacity by 11% and 26% for the conventional and hybrid systems respectively. In case of SNR = 20dB, the system capacity will be 45 and 95 users for the conventional and hybrid system respectively, in case of 4-element array, and 50 and 120 users in case of 8 elements array. Therefore, doubling the array size, again improves the system capacity by 11% and 26% for the conventional and hybrid systems respectively.

4.5.2. The outage probability of the up-link system

To check up-link performance improvement using the hybrid technique, we simulate the uplink cellular system shown in Fig. 19 using 6 interferer sources distributed uniformly around a central base station with a single desired user communicates with this station. We assumed that the interference sources located outside of the central base station cell. For simplicity, we assumed the distance of each interferer from the base station is double that of the desired user. The results of this simulation model are tabulated in Table 2.

Using Equation (38) and Table 2, the outage probability of the up-link cellular system using 16-element array for the conventional technique given by

p o = Q ( 1 σ r e q M 6 .9501 G P η s M 0 .0303 G P ) E61

Figure 18.

The outage probability of cellular down link system with 4- and 8-element array.

while that of 16-element array for the propose hybrid technique is

p o = Q ( 1 σ r e q M 3 .4715 G P η s M 0 .1202 G P ) E62
Technique Item Cell number (j)
1 2 3 4 5 6 7
CMA(1,2) G( θ j ) 2.4981 2.4392 2.4998 2.4981 2.4967 2.4998 2.4394
G( θ j )/G( θ 1 ) 1.0000 0.9764 1.0007 1.0000 0.9995 1.0007 0.9765
Hybrid Technique G( θ j ) 10.000 0.9167 1.0000 1.0000 1.0000 1.0000 1.2663
G( θ j )/G( θ 1 ) 1.0000 0.0917 0.1000 0.1000 0.1000 0.1000 0.1266

Table 2.

Up-link beam gains at different directions of arrival.

Figure 19.

Up-link cellular system with seven cells.

The results are as shown in Fig.20 It is clear that the hybrid technique decreases the outage probability of the system. This decrease will help in increasing the number of users that can be accommodated in the system (System Capacity). As an example, assuming that the acceptable outage probability is 1% and SNR = 0dB, the system capacity will be 28 and 59 users for the conventional and hybrid system respectively, in case of 8-element array, and 34 and 67 users in case of 16-element array. Therefore, doubling the array size improves the system capacity by 21% and 14% for the conventional and hybrid systems respectively. In case of SNR = 20dB, the system capacity will be 31 and 65 users for the conventional and hybrid system respectively, in case of 8 elements array, and 37 and 75 users in case of 16 elements array. Therefore, doubling the array size, improves the system capacity by 19% and 15% for the conventional and hybrid systems respectively. Here we can observe that the capacity improvement percentage of the conventional algorithm is slightly greater than the improvement percentage of the overall hybrid technique, but in all of above cases the hybrid system capacity is greater.

Figure 20.

Outage probability of up-link system with 8- and 16- element array.

Figure 21.

Computation complexity for the hybrid algorithm and some of the conventional types of adaptive beamforming algorithms

4.6. Convergence speed of the proposed algorithm

Here, a comparison between the convergence speed of the conventional adaptive beamforming algorithms and the proposed hybrid technique is carried out. This speed is determined by measuring the error behavior of the algorithms versus the used samples in the training period i.e. measuring the value of the cost function (the mean square error) at each sample time. The cost functions of LMS and CMA (1, 2) algorithms are respectively as follows:

J L M S ( k ) = E [ | d ( k ) y ( k ) | 2 ] E63
and
J C M ( 1 , 2 ) ( k ) = E [ | | y ( k ) | 1 | 2 ] E64

where d(k) and y(k) are the desired and output signal samples respectively. Using the same environment used for the beam pattern performance, we plotted the result of error curves in Fig. 22 by taking into account only the first significant iterations (samples) of both algorithms. From the figure it is clear that the convergence speed of the conventional algorithms is slightly faster than the hybrid technique, but this difference is very small.

Figure 22.

Convergence of the hybrid and conventional algorithms.

4.7. Tracking performances

Although the computational cost of the hybrid technique was slightly higher comparing with computational cost of the conventional technique, the simulation results have shown that the hybrid technique is more capable of tracking the targets with varied directions of arrival. The results in Fig. 23 show that the hybrid technique can track the signal arriving from the desirable source, which has the DOA of 60˚in the initial 800 iterations; the DOA of the desired signal is changed to 30˚, where the interfering DOA remain unchanged at 0˚ in two tracking periods. We can observe that the hybrid technique is more effective in tracking

Figure 23.

Tracking capabilities of the hybrid and conventional techniques References.

the desired target. Also in case of the desired target is flipped to the other side of the interfering source (from –20˚ to 60˚) the hybrid tracking capability is still better than the tracking capability of the conventional technique. In fact the reason of this good tracking capability is the hybrid technique use of the initial reconstructed input signal which has less interference.

Advertisement

Acknowledgments

The authors express their gratitude to Professor Otman Basir, University of Waterloo, for reviewing and editing this chapter, and for his valuable remarks.

References

  1. 1. Shetty K. 2004A novel Algorithm for Up-link Interference Suppression Using Smart Antennas in Mobile Communications,” A thesis submitted to the Department of Electrical and Computer Engineering, Florida State University in partial fulfillment of the requirements for the degree in Master of Science, Spring.
  2. 2. Litva J. Lo T. k. 1996Digital Beamforming in Wireless Communications,”.
  3. 3. Abu-Ella O. El -Jabu B. 2000Capacity Improvement of Blind Adaptive Beamforming Algorithms Using Pre-filtering Technique,” in press in IET Microwave, Antenna & Propagation Journal.
  4. 4. Paul A. Wintz 1972Transform Picture Coding,” Proceedings of the IEEE, 60 7 July.
  5. 5. Chwn Y. Le -Ngoc T. Champagne B. Xu C. 2004.“Recursive Least Squares Constant Modulus Algorithm for Blind Adaptive Array,” IEEE Transaction on Signal Processing. 52 5 May.
  6. 6. Sawant A. S. Anvekar D. K. 1999 “Capacity Improvement in CDMA and FDMA Cellular Mobile Communication Systems Using Adaptive Antenna,” 0-7803-4912-1/99, IEEE.
  7. 7. El -Jabu B. 1999Cellular Communications using Aerial Platforms,” A doctoral thesis submitted in partial fulfillment of the requirements for the award of Doctor of philosophy of the university of Southampton, September.

Written By

Omar Abu-Ella and Bashir El-Jabu

Published: 01 January 2010