An Improved Acquisition Algorithm for the Uplink Synchronization of CDMA Systems Wei Jiang, Daoben Li School of Information Engineering Beijing University of Posts and Telecommunications Beijing 100876, China E-mail: [email protected]

Weidong Li Telecommunication Planning and Research Institute of MII Beijing 100037, China

Abstract - An improved algorithm for the acquisition of the uplink synchronization in CDMA systems is proposed. By noncoherent combination of the correlation waveform for successive access frames, the average acquisition period can be reduced significantly without loss of timing precision, and the error floor of the traffic transmission caused by imperfect synchronization can be lowered down. The performance of the new algorithm applied to large area synchronous CDMA (LAS-CDMA) system is evaluated by numerical simulations.

Then it transmits the synchronization signal on the channel with pre-determined power. The base station calculates the time offset to the required synchronization time slot based on the received signal and sends the instruction to the mobile station to adjust the time slot through the downlink channel. And then the mobile station retransmits the synchronization signal according to the instruction. This close-loop process goes on until the synchronization is successful or is given up.

Keywords - CDMA, synchronization, acquisition algorithm

We first consider the case of AWGN (Additive White Gaussian Noise) channel and one-user load system, i.e., there is no MAI. Let s(t) be the synchronization signal of duration T0 transmitted by the mobile station, which should be spread signal with good autocorrelation property. Assuming the corresponding signal received by the base station is r(t), the log-likelihood function is in the form [5]:

I. Introduction CDMA (Code Division Multiple Access) wireless communications system is a self-interfered system. The imperfect cross correlation property of the multiple access codes, or spreading codes, causes the multi-access interference (MAI) in the system and limits the system capacity. Especially for the uplink, the MAI is relatively severe when the system is asynchronous, because of the strong cross-correlation side-lobe. Synchronization technique can reduce the interference and increase the system capacity in the uplink, as have been adopted in 3G mobile communications systems [1]. The LAS-CDMA (Large Area Synchronous CDMA) system [2] employs spreading codes with Interference Free Window (IFW) [3], thus is immune to the multi-path propagation in the mobile channel. However, in order to make use of the IFW property in the uplink, synchronization of different users is required by the system. The uplink synchronization process is usually partitioned into the acquisition stage and the tracking stage. The initial synchronization of the system is established in the acquisition stage and the moving of the user terminal is tracked in the next one. This paper focuses on the acquisition algorithm only. Based on the algorithm introduced in [4], we propose an improved acquisition algorithm for the uplink synchronization of CDMA systems. The new algorithm, as well as the original one, is presented in detail in section II. The following section evaluates the algorithms by numerical simulations, and a conclusion is drawn in the last section. II. Improved Acquisition Algorithm

Basically, the uplink synchronization acquisition in CDMA systems is performed like this. Firstly, the mobile station selects an idle uplink synchronization channel after the detection of the downlink broadcast channel.

x (τ ) = C ∫ r ( t ) s ( t − τ ) dt , T0

(1)

where τ is the assumed transmission delay of the signal, and C is a constant that is irrelevant to the acquisition algorithm. Equation (1) is a correlation function and can be implemented by a matched filter. The maximum-likelihood (ML) estimation of the transmission delay can be made according to the peak position of the squared waveform of the output of the matched filter, i.e., τˆ = arg max x 2 (τ ) , (2) τ ∈T

where T is the zone of the possible time delay and is relevant to the area of the cell. Denote the expected delay * as τ . Then we can generate the delay control command (DCC) according to the offset between the estimated access time and the expected time: d = τ * − τˆ. (3) After the receipt of DCC, the mobile station should shift its transmission time with d. In the case of the mobile multi-path fading channels, the acquisition algorithm implemented with Eq. (2) and Eq. (3) may have poor performance. Firstly, if the channel is in deep fading, the energy collected by the matched filter is very limited, which makes the acquisition algorithm sensitive to the noise. Secondly, the delay spread caused by the multi-path propagation in

the mobile channel may spread the main lobe of x(t) over several chips, which makes the DCC in poor precision. The first problem, i.e., the channel fading, can partially be solved by accumulation of the correlation waveform of successive frames. This is the key point of improvement proposed by this paper. Because the duration of a typical access frame is longer than the coherent time of the channel, the accumulation for different frames can achieve notable time diversity gain. The accumulation itself can be regarded as an EGC (Equal Gain Combining) technique. Meanwhile, power gain can also be achieved by combining synchronization signal, thus the signal-to-noise ratio (SNR) at the receiver for the later frames is increased, which is also helpful in AWGN channel. Note that the accumulation between different frames cannot be implemented directly, because the successive accessing synchronization signal may not arrive at the base station in the same time slot in a frame, which is caused by the effect of DCC on the mobile station. Instead, the waveform of the last frame should be shifted in time axis by d and then stored in the register to be added to the next frame. So, the accumulated waveform after the matched filter can be expressed as: n = 1, ⎧ x 2 (τ ) , yn (τ ) = ⎨ 2 (4) ⎩ x (τ ) + yn −1 (τ − d n ) , n > 1, where τ ∈ T , and n is the index of the frames. The accumulation can also decrease the MAI caused by other users. This is because the accumulation is only effective for the target user, but not for the interfering users, as the other users do not adjust the transmitting time slot according to the dedicated DCC. So the energy of the interference signal is spread when that of the target signal is concentrated, which makes the acquisition algorithm more robust to MAI. This mechanism can be illustrated by Fig. 1, in which the user 0 is the target user, and the other two are the interfering users. The interfering users are assumed to transmit the synchronization signal within same time slots for the two frames. By combining the correlation waveform for two frames, the signal of the target user is enhanced while that of the interfering users is not. As a result the interfering signal is depressed. To overcome the second problem mentioned above, i.e., the delay spread of the signal, a sliding accumulator can be used after the matched filter, which can effectively collect the spread energy and make the acquisition algorithm much more robust to the delay spread [4][6]. Considering the combination of the waveform of successive frames, the output of the sliding accumulator can be expressed as z n (τ ) =



τ

τ − Tw

yn ( t ) dt ,

(5)

where Tw is the width of the sliding window, which

Frame 1:

User 1

Frame 2:

User 1

Combined:

User 0

User 0

User 1

User 2

Time

User 2

Time

User 0

Time

User 2

Fig. 1 Resistance of MAI by accumulation r (t )

Matched x (τ ) Filter

(i)

2

y (τ )

Sliding Accumulator

z (τ )

DCC Generator

DCC

Delay & Shift

Fig. 2 The structure of the improved uplink synchronization acquisition receiver

should be larger than the maximum delay spread of the channel. And by replacing x( τ ) in Eq. (2) with zn( τ ), the improved estimation of the transmission delay is obtained: τˆ = arg max zn (τ ) . (6) τ ∈T

Similar to the simple case discussed above, the DCC can be generated by calculation of the time offset according to the Eq. (3). In summary, the structure of the proposed receiver for the acquisition of uplink synchronization is illustrated in Fig. 2. The received signal is passed through a matched filter which matches the spreading code and the shaping waveform. The squared output of the matched filter is accumulated for successive access frames and then passed through a sliding accumulator which collects the energy in a few chips. The peak position of the output of the accumulator is regarded as the access time and is compared with the expected arrival time. A delay control command (DCC) is generated based on the access time and then sent to the mobile station through the downlink channel. The mobile station shifts its access frame according to the received DCC. This structure is based on the acquisition receiver invented in [4]. The accumulation of the signal between different frames is the improvement proposed in this paper, which makes the acquisition algorithm different from the old one. III. Simulation Results

The performance of the proposed acquisition algorithm for uplink synchronization applied to the LAS-CDMA system is compared with the original algorithm [4] by numerical simulations. The length of a frame is 20 ms, and the system load is 4 or 8 users. Perfect power control is assumed, i.e., the signal of different users received by

Percentage of Successful Acquisition (%)

100

98

96

94

92

90 Original, Standard Deviation: 0.977 New, Standard Deviation: 0.978

88

86

1

2 3 Acquisition Error in Number of Samples

4

Fig. 4 Performance of the algorithms in acquisition precision in AWGN channel, SNR = 2 dB, 8 users

100

Percentage of Successful Acquisition (%)

the base station is of the same power. The over-sample rate at the receiver is 16, which means that there are 16 samples in one chip period. An acquisition is regarded to be successful only if the timing offset is no greater than a quarter of the chip period, or 4 samples, after the mobile station's adjusting of the transmitting time according to the received DCC. So the minimum acquisition time required is two frames, or 40ms. Moreover, it’s assumed that the DCC is transmitted on the downlink channel without error. Fig. 3 illustrates the performance in acquisition time of the two acquisition algorithms in AWGN channel with SNR = 2dB. The original algorithm and the algorithm introduced in this paper are labeled with original and new, respectively. It can be seen that the new algorithm can save the acquisition time tremendously, and synchronize all of the accesses simulated in four frames at most. On the other hand, the original algorithm may fail for some accesses and need nine frames to acquire synchronization at most. Meanwhile, Fig. 4 shows that the two algorithms perform almost the same on the acquisition precision in AWGN channel. Fig. 5 and Fig. 6 show the results for ITU-VA multi-path fading channel model [7] with average SNR being 20dB. The vehicle speed is set to be 30 km/hour. The gain of the proposed algorithm is more obvious than the last case. When the original algorithm performs very poor and may need to acquire the synchronization in 20 frames at most, the new algorithm can still achieve successful acquisition in four frames. On the other hand, there is a little degradation in acquisition precision for the new algorithm. However, the loss is acceptable when the great saving of access time is considered. The impact of the acquisition error on the performance of the traffic channel is also simulated. The result is shown in Fig. 7. It can be seen that the acquisition error of both

90

80

70

60

Original, Mean: 64 ms, Max: 400 ms New, Mean: 43 ms, Max: 80 ms

50

40

2

3 Acquisition Time in Number of Frames

4

Fig. 5 Performance of the algorithms in acquisition time in ITU-VA channel, SNR = 20 dB, 4 users

100

100

Percentage of Successful Acquisition (%)

Percentage of Successful Access (%)

95 98

96

94

92

Original, Mean: 43 ms, Max: 180 ms New, Mean: 41 ms, Max: 80 ms

90

88

90 85 80 75 70 65

55 50

2

3 Acquisition Time in Number of Frames

Original, Standard Deviation: 2.154 New, Standard Deviation: 2.262

60

4

1

2 3 Acquisition Error in Number of Samples

4

Fig. 3 Performance of the algorithms in acquisition time in

Fig. 6 Performance of the algorithms in acquisition

AWGN channel, SNR = 2 dB, 8 users

precision in ITU-VA channel, SNR = 20 dB, 4 users

device for uplink synchronization”, Chinese patent, CN03825533.2, 2003. [5] J. G. Proakis, Digital Communications, 4th ed. New York: McGraw Hill, 2001. [6] L. Jiang, K. Miu, and X. You, “The design and implementation of coherent receiver for CDMA2000 spreading system”, Telecommunications Science, vol. 18, no. 4, 2002. [7] ITU-R M.1225, “Guidelines for evaluation of radio transmission technologies for IMT-2000”, 1998.

-1

10

Original New

-2

Bit Error Rate

10

-3

10

-4

10

6

8

10

12 14 16 Signal to Noise Ratio (dB)

18

20

22

Fig. 7 Bit error rate of the traffic channel

algorithms results in error floor for the traffic channel transmission. Though, the error floor caused by the improved algorithm is lower than that of the original one. This is because that the new algorithm lowers down the probability of asynchronous transmission. IV. Conclusion A simple method to improve the uplink synchronization acquisition in CDMA systems is proposed in this paper. The new architecture of the acquisition receiver employs an accumulator to collect the energy of the synchronization signal in successive frames. Simulation results show that compared to the original algorithm, the new algorithm saves much acquisition time, both for the AWGN channel and the multi-path fading channel, when losses little in acquisition precision. Further more, the error floor of the traffic channel transmission can be lowered down by the new algorithm. The cost of the new algorithm is an accumulator and the register for the storage of the correlation waveform. Because the access time is in a limited zone, only the waveform in that zone needs to be stored. Moreover, the size of the register can be reduced by down-sampling of the waveform, which is to be researched in the future work. V. Acknowledgments Wei Jiang would like to thank Gang Quan and Dr. Xingqing Cheng for helpful discussion about the work. This work was supported by National Natural Science Foundation of China (NSFC) under grant no. 90604035. References [1] 3GPP TR 25.928 4.0.1, “1.28 Mb/s functionality for UTRA TDD physical layer”. [2] D. Li, “The perspectives of large area synchronous CDMA technology for the fourth-generation mobile radio”, IEEE Communications Magazine, vol. 41, no. 3, pp. 114–118, 2003. [3] D. Li, “A high spectral efficient multiple access code”, Chinese Journal of Electronics, vol. 8, no. 7, pp. 221-226, 1999. [4] G. Quan and Y. Zhang, “A new acquisition method and

An Improved Acquisition Algorithm for the Uplink ...

and the error floor of the traffic transmission caused by imperfect synchronization can be .... The length of a frame is 20 ms, and the system load is 4 or 8 users.

56KB Sizes 0 Downloads 294 Views

Recommend Documents

An Improved Acquisition Algorithm for the Uplink ...
CDMA (Code Division Multiple Access) wireless communications system is a .... on the acquisition receiver invented in [4]. The accumulation of the signal ...

An Improved Algorithm for the Solution of the ...
tine that deals with duplicate data points, a routine that guards against ... numerical algorithm has been tested on several data sets with duplicate points and ...

An improved Incremental Delaunay Triangulation Algorithm
Abstract: The incremental insertion algorithm of. Delaunay triangulation in 2D is very popular due to its simplicity and stability. We briefly discuss.

An Improved Divide-and-Conquer Algorithm for Finding ...
Zhao et al. [24] proved that the approximation ratio is. 2 − 3/k for an odd k and 2 − (3k − 4)/(k2 − k) for an even k, if we compute a k-way cut of the graph by iteratively finding and deleting minimum 3-way cuts in the graph. Xiao et al. [23

An improved algorithm for anisotropic nonlinear ...
development of a software program for filtering cryot- omograms based on AND, ... AND can be considered as an adaptive gaussian filtering technique in which, ...

An improved memetic algorithm using ring neighborhood ... - GitHub
4, 5, 6, 7 that the con- vergence to the known optimal result of test functions is very fast and most test functions have been converged after around. 1 × 105 FEs.

An improved memetic algorithm using ring neighborhood ... - GitHub
Nov 29, 2013 - The main motivation of using ring neighborhood topology is to provide a good ... mine the choice of solutions for local refinements, by utiliz- ...... 93,403 g08. 2,755. 2,990 g09. 13,455. 23,990 g10. 95,788. 182,112 g11. 1,862.

W-AlignACE: an improved Gibbs sampling algorithm based on more ...
Computer Science and Technology, Tsinghua University, Beijing, China and 3Department of Computer Science and Engineering ...... Singapore Ministry of Education and T.J.'s research is sup- ported by ... Genet, 27, 167–171. Cherry,J. et al.

W-AlignACE: an improved Gibbs sampling algorithm based on more ...
learning an accurate PWM to characterize the binding sites of a specific TF ... W-AlignACE, is compared with three other programs (AlignACE,. MDscan and ..... relative entropy (i.e. Kullback–Leibler distance) of binding sites with respect to the ..

An Improved FloatBoost Algorithm for Naïve Bayes Text ...
20-Newsgroups consists of 20,000 Usenet articles collected by K. Lang from 20 different newsgroups. For this data set, about 70% documents in each newsgroup are used for training (700 documents per class), while left documents are used for testing. (

KA-CAPTCHA: An Opportunity for Knowledge Acquisition on the Web
We present an application where we ... between Web users and their applications is the fact that .... problem lies in designing a CAPTCHA test that impedes.

An improved method for the determination of saturation ...
2) use of cost effective excitation source with improved voltage regulation and ..... power electronic applications, renewable energy systems, energy efficiency.

The Development of an Improved Method for ...
between scraping to allow more time for the froth to build up and mature. This method of ... opinion thereof. It has been proposed that machine vision technologies could be used to extract useful data ... For the modified method of batch flotation th

An Evolutionary Algorithm for Homogeneous ...
fitness and the similarity between heterogeneous formed groups that is called .... the second way that is named as heterogeneous, students with different ...

An Algorithm for Implicit Interpolation
More precisely, we consider the following implicit interpolation problem: Problem 1 ... mined by the sequence F1,...,Fn and such that the degree of the interpolants is at most n(d − 1), ...... Progress in Theoretical Computer Science. Birkhäuser .

An Adaptive Fusion Algorithm for Spam Detection
An email spam is defined as an unsolicited ... to filter harmful information, for example, false information in email .... with the champion solutions of the cor-.

An Algorithm for Implicit Interpolation
most n(d − 1), where d is an upper bound for the degrees of F1,...,Fn. Thus, al- though our space is ... number of arithmetic operations required to evaluate F1,...,Fn and F, and δ is the number of ...... Progress in Theoretical Computer Science.

An Adaptive Fusion Algorithm for Spam Detection
adaptive fusion algorithm for spam detection offers a general content- based approach. The method can be applied to non-email spam detection tasks with little ..... Table 2. The (1-AUC) percent scores of our adaptive fusion algorithm AFSD and other f

An Algorithm for Nudity Detection
importance of skin detection in computer vision several studies have been made on the behavior of skin chromaticity at different color spaces. Many studies such as those by Yang and Waibel (1996) and Graf et al. (1996) indicate that skin tones differ

uplink pdf
Page 1 of 1. File: Uplink pdf. Download now. Click here if your download doesn't start automatically. Page 1 of 1. uplink pdf. uplink pdf. Open. Extract. Open with.

An Implementation of a Backtracking Algorithm for the ...
sequencing as the Partial Digest Problem (PDP). The exact computational ... gorithm presented by Rosenblatt and Seymour in [8], and a backtracking algorithm ...

An O∗ (1.84k) Parameterized Algorithm for the ...
basic formulation is to find a 2-partition that separates a source vertex s from a target vertex t .... So we leave it open for a parameterized algorithm for ..... Discrete Mathematics and Theoretical Computer Science 5 (1991) 105–120. 8. Cygan, M.

An algorithm for solving the open gallery problem
ABSTRACT. Given a polygon and a desired number of guards resulting after performing an reflex vertex straddling (RVS) deploy- ment or a polygonal ...

An Online Algorithm for Finding the Longest Previous ...
1 Department of Computer Science, University of Tokyo. Hongo 7-3-1, Bunkyo-ku, Tokyo 113-0013, Japan [email protected]. 2 Department of Computer ...