The large Doppler offset that exists in high dynamic environments poses a serious impediment to the acquisition of direct sequence spread spectrum (DSSS) signals. To ensure acceptable detection probabilities, the frequency space has to be finely divided, which leads to complicated acquisition structures and excessively long acquisition time at low SNR. A local frequency folding (LFF) method designed for combined application with established techniques dedicated to PN-code synchronization is proposed in this paper. Through modulating local PN-code block with a fixed waveform obtained by folding all frequency cells together, we eliminate the need for frequency search and ease the workload of acquisition. We also analyze the performance of LFF and find that the detection performance degradation from folding can be compensated by FFT-based coherent integration. The study is complemented with numerical simulations showing that the proposed method has advantages over unfolding methods with respect to detection probability and mean acquisition time, and the advantage becomes obvious but limited if the folded number gets larger.

Code acquisition performance in the Direct-Sequence Code-Division Multiple-Access (DS/CDMA) communication system is strongly related to the quality of the communication systems. The performance is assessed by (i) code acquisition time; (ii) precision; and (iii) complexity for implementation. This paper applies the method of maximum likelihood (ML) to estimation of propagation delay in DS/CDMA communications, and proposes a low-complexity method for code acquisition. First, a DS/CDMA system model and properties of outputs with a passive matched-filter receiver are reviewed, and a statistical problem in code acquisition is mentioned. Second, an error-controllable code acquisition method based on the maximum likelihood is discussed. Third, a low-complexity ML code acquisition method is proposed. It is shown that the code acquisition time with the low-complexity method is about 1.5 times longer than that with the original ML method, e.g. 13 data periods under 4.96 dB.

This letter investigates the effects of using multiple transmit antennas on code acquisition for preamble search in the CDMA uplink when MIMO is used for signal transmission and reception. The performance of a ML code acquisition technique in the presence of MIMO channel is analyzed by considering the detection and miss probabilities. The acquisition performance is numerically evaluated on a frequency selective fading channel. It is found that the performance of code acquisition scheme for a SIMO system is better than that for the case of MIMO on the low thresholds in terms of detection performance and MAT.

An adaptive array code acquisition for direct-sequence/code-division multiple access (DS/CDMA) systems was recently proposed to enhance the performance of the conventional correlator-based method. The scheme consists of an adaptive spatial and an adaptive temporal filter, and can simultaneously perform beamforming and code-delay estimation. Unfortunately, the scheme uses a least-mean-square (LMS) adaptive algorithm, and its convergence is slow. Although the recursive-least-squares (RLS) algorithm can be applied, the computational complexity will greatly increase. In this paper, we solve the dilemma with a low-complexity conjugate gradient (LCG) algorithm, which can be considered as a special case of a modified conjugate gradient (MCG) algorithm. Unlike the original conjugate gradient (CG) algorithm developed for adaptive applications, the proposed method, exploiting the special structure inherent in the input correlation matrix, requires a low computational-complexity. It can be shown that the computational complexity of the proposed method is on the same order of the LMS algorithm. However, the convergence rate is improved significantly. Simulation results show that the performance of adaptive array code acquisition with the proposed CG algorithm is comparable to that with the original CG algorithm.

Recently, a novel detector was proposed by the authors for code acquisition in non-Gaussian impulsive channels [3], which dramatically outperforms the conventional squared-sum detector; however, it requires exact knowledge of the non-Gaussian noise dispersion. In this paper, a robust detector is proposed, which employs the signs and ranks of the received signal samples, instead of their actual values, and so does not require knowledge of the non-Gaussian noise dispersion. The acquisition performance of the proposed detector is compared with that of the detector of [3] in terms of the mean acquisition time. The simulation results show that the proposed scheme is not only robust to deviations from the true value of the non-Gaussian noise dispersion, but also has comparable performance to that of the scheme of [3] using exact knowledge of the non-Gaussian noise dispersion.

We propose a multiple dwell serial search (MDSS) code acquisition for optical code-division multiple-access (O-CDMA) systems and theoretically analyze its performance. The search/lock strategy (SLS) is used as verification scheme for the multiple dwell detector. The operation of SLS is modeled by finite Markov chain to analyze the performance of the proposed system. Effect of system parameters, such as number of users, threshold and mean photon count per chip, on the performance of the proposed system is investigated. The theoretical result shows that the performance of the proposed system is less sensitive to parameter settings than the conventional single dwell serial search (SDSS) code acquisition system is. In addition, the proposed MDSS code acquisition system offers shorter mean acquisition time than that of conventional SDSS system.

A detector based on calculation of a posteriori probability is proposed for code acquisition in singleuser direct sequence code division multiple access (DS/CDMA) systems. Available information is used for decision making, unlike conventional methods which only use a part of it. Although this increases the overhead in terms of additional memory and computational complexity, significant performance improvements are achieved. The frame work is extended to multiuser systems and again mean acquisition time/correct acquisition probability performance is superior to the conventional systems although computational complexity is high. An approximate multiuser method with significantly less complexity is also derived.

Packet-recognition/code-acquisition (PR/CA) is one of the most important issues in packet communication systems. In a CDMA Unslotted ALOHA system, Multiple Access Interference (MAI) may bring about errors in PR/CA. The MAI mainly stems from already recognized packets and newly arriving packets under the execution of PR/CA. This characteristic of asynchronous transmission in CDMA U-ALOHA systems implies that only one or a few packets arrive at the receiver within a short interval of a execution. Furthermore, newly arriving packets are recognized and code-acquired by using a short preamble part. Consequently, the MAI from the packets under the execution of the PR/CA will be small. Focusing on that point, this paper proposes applying the IC scheme in order to suppress the MAI from the already recognized and code-acquired packets. A performance evaluation demonstrates that such an application is valid due to the small amount of MAI from the packets under the execution of PR/CA. In addition, we demonstrates that the scheme reduces false recognition rather than mis-recognition. Such a scheme improves the performance of not only PR/CA, but also the throughput.

We analyze the performance of an adaptive hybrid search code acquisition algorithm for direct-sequence code division multiple access (DS-CDMA) systems under slowly-moving mobile environments. The code acquisition algorithm is designed to provide the desired feature of constant false alarm rate (CFAR) to cope with nonstationarity of interference in CDMA forward links. An analytical expression for the mean acquisition time is first derived and the probabilities of detection, miss, and false alarm are then obtained for frequency-selective Rayleigh fading environments. The fading envelope of a received signal is assumed to be constant over the duration of post-detection integration (PDI), which is most reasonable, especially for slowly-moving mobile environments. The performance of the designed code acquisition algorithm shall be evaluated numerically to examine the effect of some design parameters, such as the sub-window size, the size of the PDI, the decision thresholds in search and verification modes, and so on, considering IMT-2000 environments.

The problem of estimating code timings in DS-CDMA systems with multiple antennas is considered in the presence of multipath time-varying fading channels and near-far environments. We present an efficient algorithm for an approximate maximum likelihood approach of jointly estimating the multipath timings of a desired user for DS-CDMA systems that consist of multiple antennas either uncorrelated or fully correlated in space. The procedures of the algorithm to estimate code-timings are developed in order to better exploit the time-varying characteristics of the fading process. In the multipath fading channels, the solution of the proposed algorithms is based on successively optimizing the criterion for increasing numbers of multipath delays. It is shown via simulation results that the modified approaches of the approximate maximum likelihood algorithm much more improve its acquisition performance in the time-varying fading channels. It is seen that the acquisition performance of multiple antennas based acquisition scheme is much better than that of a single antenna based timing estimator in the presence of multipath fading channels and the near-far problem. Furthermore, it is observed that the proposed algorithms outperform the correlator and MUSIC estimator in the multiuser environments with near-far situation on time-varying Rayleigh fading channels.

This paper proposes and theoretically evaluates two different schemes of code acquisition for pulse-position modulation (PPM) and overlapping PPM (OPPM) fiber-optic code-division multiple-access (CDMA) systems, namely threshold-based and demodulator-based code acquisition. Single-dwell detector and serial-search algorithm are employed for both schemes. Theoretical analysis is carried out for shot-noise-limited photon-counting receiver. Discussions upon effects of various parameter settings on the performance of code acquisition for PPM/OPPM fiber-optic CDMA systems, such as index of overlap, PPM/OPPM multiplicity, average photon counts per information nat, and darkcurrents, are presented. It is shown that when the threshold is properly selected, the threshold-based code acquisition system offers better performance, in terms of mean number of training frames, than the demodulator-based one.

We propose an interference-canceller-aided (ICA) code timing acquisition scheme, code acquisition in short subsequently, for initial synchronization of direct sequence-code division multiple access (DS-CDMA) systems with interference cancellation (IC). The scheme removes completely or partially multiple access interference (MAI) due to the already-synchronized users from the received signal prior to code acquisition of a desired user. Code acquisition is then performed using the MAI-reduced signal. We compare the ICA code acquisition scheme with the conventional non-ICA scheme in terms of the probability of correct acquisition and the code timing accuracy. Simulation results shows that the proposed scheme can accommodate many more users than the conventional one and provide reliable code timing estimates even under many more interfering users.

This paper investigates the cell search time performance of our previously proposed three-step cell search method in a two-cell site environment by laboratory and field experiments supporting asynchronous cell site operation, which is one of the most notable features of wideband direct sequence code division multiple access (W-CDMA) mobile communications. The cell search methods used in the paper are based on the ongoing third generation partnership project (3GPP), in which our original scheme was refined with respect to several points in order to reduce the complexity of the receiver. The experimental results demonstrate that the method achieves the fast cell search time of less than one second in real multipath-fading channels. The cell search is accomplished in less than approximately 700 msec at 90% of the detection probability when 4.7% and 0.5% of the total transmit power of a cell site is assigned to the common pilot channel (CPICH) and synchronization channels (SCHs), respectively, in a two-cell site environment. We also elucidate that the cell search time at the detection probability of 90% using time switched transmit diversity (TSTD) is decreased by approximately 100 msec compared to that without TSTD in low-mobility environments such as the average vehicular speed of 5 km/h with a transmit power assignment of the CPICH of 4.7%.

Noncoherent detectors for use in acquiring data-modulated direct-sequence spread-spectrum (DS/SS) signals are considered in this paper. Taking data modulation and timing uncertainty into account and using the generalized maximum likelihood (GML) or maximum likelihood (ML) detection approaches, we derive optimal detectors in the sense of Bayes or Neyman-Pearson and propose various suboptimal detectors. A simple systematic means for their realization is suggested and the numerical performance of these detectors is presented. We also compare their performance with that of the noncoherent combining (NC1) detector that had been proposed to serve the same need. Numerical results show that even the proposed suboptimal detectors can outperform the NC1 detector in most cases of interest.

In this paper, the authors derived the distributions of the probability of detection and of false alarm in function of the decision threshold. An Optimized Threshold Decision (OTD) algorithm was proposed to decide the optimal threshold for reaching the best system performance in a given known channel noise. By applying this OTD algorithm, the multiple access capacity can thus be maximized.

In this paper, we study macro/micro diversity techniques for code acquisition of a direct-sequence spread-spectrum signal in an indoor packet communication system. In the system discussed, the base station has several radio ports each with a cluster of antennas, and the terminal also has multiple antennas. The performance in the uplink of this system is analyzed under Lognormal shadowing and flat Rayleigh fading. The numerical results show great performance improvements by proposed diversity techniques. In addition, it is clarified that the mean acquisition time, which is often used as the measure of performance, is not suitable for packet radio systems as it underestimates the necessary preamble length for initial code acquisition.

This paper is concerned with CDMA applied to personal and mobile communications on a global basis using multiple low earth orbital satellites (LEOS). We focus our attention on some unique aspects of LEOS systems and discuss their influences on the CDMA system performance as well as the techniques for coping with these aspects. We deal with three kinds of important items that are unique to LEOS systems; Doppler frequency shift due to satellite movement, propagation delay affecting packetized data transmission and geographical nonunifomity in traffic.

In this paper, the evaluation of a hybrid acquisition performance has been considered for the pilot signal in direct sequence code division multiple access (DS/CDMA) forward link. The hybrid acquisition is introduced by the combination of two schemes, parallel and serial acquisitions. The mean acquisition time of the hybrid acquisition scheme is derived to consider both case 1 (the correct code-phase offsets ae included in one subset) and case 2 (the correct code-phase offsets exist at the boundary of two subsets), which are caused by the distribution of the correct code-phase offsets between two subsets. Detection, false alarm, and miss probabilities are derived for the cases of multiple correct code-phase offsets and multipath Rayleigh fading channel. Results are provided for the acquisition performance with respect to system design parameters such as postdetection integration length in the search and verification modes, subset size, and number of I/Q noncoherent correlators. Also, comparision between hybrid acquisition and parallel acquisition under the same hardware complexity is provided in terms of the minimum mean acquisition time.

This paper considers the evaluation of the acquisition performance for an access channel preamble based on the random access procedure of direct sequence code division multiple access (DS/CDMA) reverse link. The parallel acquisition technique that employs the single-dwell and multiple-dwell (double-dwell) detection schemes is investigated. The acquisition performance for two detection schemes is compared in terms of the acquisition probablity and the mean acquisition time. The parallel acquisition is done by a bank of N parallel I/Q noncoherent correlators. Expressions on the detection, false alarm, and miss probabilities of the single-dwell and multiple-dwell (double-dwell) detection schemes are derived for the multiple H1 cells and multipath Rayleigh fading channel. Comparing the single-dwell detection scheme with the multiple-dwell (double-dwell) detection scheme in the case of employing the parallel acquisition technique in the reverse link, the numerical results show that the single-dwell detection scheme provides a better performance.