Code division multiple access (CDMA) based on direct sequence (DS) spread spectrum modulation using spreading codes is one of standard technologies for multiple access communications. In asynchronous DS/CDMA communications, spreading codes with appropriate negative auto-correlation can reduce bit error rate (BER) compared with uncorrelated sequences. In this letter, we design new binary functions for generating chaotic binary sequences with negative auto-correlation using Bernoulli chaotic map. Such binary functions can be applied to the generation of spreading codes with negative auto-correlation based on existing spreading codes (e.g., shift register sequences).

Spreading sequences with appropriate negative auto-correlation can reduce average multiple access interference (MAI) in asynchronous DS/CDMA systems compared with the conventional Gold Sequences generated by linear feedback shift registers (LFSRs). We design spreading sequences with negative auto-correlation based on Gold sequences and the chaos theory for the Bernoulli map. By computer simulations, we evaluate BER performances of asynchronous DS/CDMA systems using the proposed sequences.

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.

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.

In this paper, we propose an adaptive data transmission scheme for DS/CDMA packet radio communication systems in bandlimited indoor multipath fading channels. We first analyze the relationship between the code rate and the processing gain (defined as the number of chips per coded bit) in maximizing the normalized throughput in connection with the channel state of the indoor multipath fading channels. One observation made is that the maximum throughput with BPSK modulation is attained when the code rate is chosen as low as possible irrespective of the channel state, and the processing gain is increased (decreased) as the channel becomes worse (better). The other observation made is that when DPSK modulation is employed, there exists an optimal combination of the code rate and the processing gain in maximizing the normalized throughput for each channel state. Based on these observations, we propose to adapt the processing gain and/or code rate according to the fading conditions in order to maximize the normalized throughput. We analyze the performance of the proposed scheme and compare it with the non-adaptive data transmission scheme. Our results show that the adaptive transmission scheme yields a significant performance improvement over the nonadaptive scheme, and increasing the adaptation level is more effective as the channel gets worse, but the 3-state adaptation seems to be practically optimum.

In this paper, we compare two signal designs for uplink quasi-synchronous code division multiple access (CDMA) channels in order to optimize the trade-off between bandwidth efficiency and power efficiency. The design we call band-limited DS/CDMA design, is based on the time-domain assignment of Gold sequences, just as in the ordinary DS/CDMA, but with band-constrained cyclic chip interpolation functions, which is unlike the ordinary DS/CDMA. The other design, MC/CDMA design, is based on frequency-domain assignment of the sequences, as in the ordinary MC/CDMA. In both designs, we assume insertion of guard intervals at the transmitter and frequency-domain processing in reception. Assuming quasi-synchronous arrival of CDMA signals at the CDMA base station and FFT in the effective symbol interval, the intersymbol interference is evaded in both designs. First we identified the signal parameters that optimize bandwidth efficiency in each of the band-limited DS design and MC design. Second, we clarified the signal parameters that optimize the power efficiency as functions of frequency efficiency in each of the two designs. Finally, we derived and compared the trade-off between the bandwidth efficiency and power efficiency of band-limited DS and MC designs. We found a superiority of band-limited DS design over MC design with respect to the optimized trade-off.

A new channel identification algorithm using both pilot and traffic channels is proposed. It is based on the linear modelling for the fading channel and takes the form of a modified recursive least-squares (RLS) algorithm. Its existence is also analyzed. It will be shown through computer simulation that the proposed algorithm is robust to the variation of the channel fade rate in a mean square error (MSE) sense.

In this paper, we introduce a Parallel Interference Canceller (PIC) based on a sorting method to improve the performance in the MC-DS/CDMA environment. A conventional PIC estimates and cancels out all of the MAI (Multiple Access Interference) for each user in parallel. The parallel process ensures a limited delay for the detection of all users. Since the performance of PIC is strongly related to the correct MAI estimation, we introduce an interference cancellation scheme to estimate accurately the MAI of the weaker interferers than the desired signal. The principle of proposed IC (Interference cancellation) scheme is to sort in descending order from the strength of the signal and subtracted by the MAI of the strong interferer from the weak signal. Therefore, the signal of the weak interferer becomes a better estimation. Following this, the output of the front processing is achieved by a rank operation of the signals in an ascending order of strength. Then the strong signal eliminates the improved weak interferer. Resulting from this, the proposed scheme obtains a better BER performance than the conventional PIC, because the accuracy of the strong signal has been improved. However, a disadvantage exists in that the processing time has a slightly longer delay than the PIC-1stage owing to a two step processing, including the sorting one.

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.

In this paper, we propose a single-user strategy for demodulating asynchronous direct-sequence code-division multiple access (DS/CDMA) signals for improving the performance of the adaptive receiver in fast fading channels. Since the adaptive receiver depends on the channel coefficient of all users, it cannot be implemented adaptively in fading channels due to severe tracking problem. A proposed adaptive receiver based on the modified minimum mean-squared-error (MMSE) criterion is used for solving this problem. By simulation, it is verified that our proposal is a promising method to solve the problem, and the results show that the proposed adaptive receiver has substantially larger capacity than the conventional adaptive receiver in fast fading channels.

We investigate the optimal chip rate of power or rate adapted direct-sequence code division multiple access (DS/CDMA) communication systems in Nakagami fading channels. We find that the optimal chip rate that maximizes the spectral efficiency depends upon both the channel parameters, such as multipath intensity profile (MIP) and line-of-sight (LOS) component, and the adaptation scheme itself. With the rate adaptation, the optimal chip rate is less than 1/Tm irrespective of the channel parameters, where Tm is multipath delay spread. This indicates that with the rate adaptation, correlation receiver achieves higher spectral efficiency than RAKE receiver. With the power adaptation, however, the optimal chip rate and the corresponding number of tabs in RAKE receiver are sensitive to MIP and LOS component.

This paper presents two novel blind set-theoretic adaptive filtering algorithms for suppressing "Multiple Access Interference (MAI)," which is one of the central burdens in DS/CDMA systems. We naturally formulate the problem of MAI suppression as an asymptotic minimization of a sequence of cost functions under some linear constraint defined by the desired user's signature. The proposed algorithms embed the constraint into the direction of update, and thus the adaptive filter moves toward the optimal filter without stepping away from the constraint set. In addition, using parallel processors, the proposed algorithms attain excellent performance with linear computational complexity. Geometric interpretation clarifies an advantage of the proposed methods over existing methods. Simulation results demonstrate that the proposed algorithms achieve (i) much higher speed of convergence with rather better bit error rate performance than other blind methods and (ii) much higher speed of convergence than the non-blind NLMS algorithm (indeed, the speed of convergence of the proposed algorithms is comparable to the non-blind RLS algorithm).

We propose an efficient method for updating the inverse of the signature waveform cross-correlations (SWC) matrix when the number of users in the synchronous direct-sequence code-division multiple-access (DS/CDMA) system changes. It is shown that the computational complexity of the proposed method is O(n2) in which n represents the number of active users in the system.

A novel signal enhancement scheme using the rotation of signal subspace (RSS) and Toeplitz matrix approximation (TMA) methods to enhance the performance of an adaptive antenna array in multirate DS/CDMA systems is proposed. The basis of RSS is to find a transformation matrix in order to recover the desired complex array covariance matrix from a sampled complex array covariance matrix which is contaminated by an interference-plus-noise component, which is the total noise. Also, the objective of TMA is to change the output matrix of RSS into a matrix having the theoretical properties of a total noise-free signal. Consequently, the proposed signal enhancement scheme using RSS and TMA methods can greatly improve the performance of an adaptive antenna array by reducing the undesired total noise effect from the sampled complex array covariance matrix of the pre-correlation received signal vector that is used to calculate a weight vector of an adaptive antenna array. It is shown through various simulation results that the system performance using the proposed signal enhancement scheme is much superior to that of the conventional method.

This letter presents a new probability expression for a multi-carrier (MC) DS/CDMA acquisition system with a reference matched filter (RMF). To evaluate the mean acquisition time (MAT) as a measure of the system performance, the probabilities of detection, miss, and false alarm are derived. From the results, it is shown that the MAT of the MC-CDMA hybrid system with RMF is comparable to the optimum mean acquisition time of the conventional MC-CDMA hybrid system, maintaining approximately the same degree of structuring complexity.

Efficient schemes to enhance the performance of the optimum beamforming for DS/CDMA systems are proposed. The main focus of the proposed schemes is to enhance the practical estimation of an array response vector used at the weight vector for the optimum beamforming. The proposed schemes for the performance enhancement of the optimum beamforming are the Complex Toeplitz Approximation (CTA) and the real Toeplitz-plus-Hankel Approximation (RTHA) which have the theoretical property of an overall noise-free signal. It is shown through several simulation results that the performance of the optimum beamforming using the proposed schemes is much superior to that of a system using the conventional method under several simulation environments, i.e., the number of users, the SNR value, the number of antenna elements, the angular spread, and Nakagami fading parameter.

We propose a post-filter (digital filter applied after the correlator) to reduce multiple-access interference (MAI) in the correlator output in asynchronous communications. Optimum filter coefficients are derived for Markov and i.i.d. codes. It is shown that post-filter is not needed for Markov case. Variance of MAI is reduced in i.i.d. codes and it becomes equal to that of Markov codes; thus, both will have the same bit error rate (BER) performance. This post-filter reduces level of MAI in the correlator output for Gold codes as well.

This paper presents a novel blind multiple access interference (MAI) suppression filter in DS/CDMA systems. The filter is adaptively updated by parallel projections onto a series of convex sets. These sets are defined based on the received signal as well as a priori knowledge about the desired user's signature. In order to achieve fast convergence and good performance at steady state, the adaptive projected subgradient method (Yamada et al., 2003) is applied. The proposed scheme also jointly estimates the desired signal amplitude and the filter coefficients based on an approximation of an EM type algorithm, following the original idea proposed by Park and Doherty, 1997. Simulation results highlight the fast convergence behavior and good performance at steady state of the proposed scheme.

In this paper, a simple blind algorithm for a beamforming antenna is proposed. This algorithm exploits the property of cyclostationary signals whose cyclic autocorrelation function depends on delay as well as frequency. The cost function is the mean square error between the delay product of the beamformer output and a complex exponential. Exploiting the delay greatly reduces the possibility of capturing undesired signals. Through analysis of the minima of the non-quadratic cost function, conditions to extract a single signal are derived. Application of this algorithm to code-division multiple-access systems is considered, and it is shown through simulation that the desired signal can be extracted by appropriately choosing the delay as well as the frequency.

In this paper, an interference cancellation (IC) scheme for a multirate VPG DS/CDMA system is evaluated in a multipath fading mobile channel and is designed to accommodate the multimedia sources of varying data-rate requirements. In the this scheme, the strongest user with high-rate transmission will benefit from the multiple access interference (MAI) reduction of the weaker users, which yields more clean estimates in the next cancellation stage. From the numerical results, the proposed scheme outperforms the conventional SIC scheme under the condition of the approximately identical decoding delay at the cost of the hardware burden.