Decorrelating detectors for quasi-synchronous CDMA

To date, two forms of spread spectrum code division multiple access (CDMA) have been considered in the literature. Either synchronous CDMA, where all users are both chip and bit synchronized relative to each other, or asynchronous CDMA, where all users are neither chip nor bit synchronized relative to each other. Between these two extremes lies quasi-synchronous CDMA (QS-CDMA) where users are not chip synchronized but are approximately bit synchronized. Quasi-synchronous CDMA arises in microcell systems where the combined propagation time and delay spread produces a variation in the round trip delay time limited to a few chips.Detection of QS-CDMA at the base station is considered. It is shown that memoryless detection can be achieved by appending blank chips to the user's spreading codes.Two decorrelating detectors are proposed and analyzed. The first uses a matched filter bank to produce a discrete time signal, and the second uses a single oversampling integrate-and-dump filter to produce a discrete time signal. For the first detector, each matched filter is synchronized to its respective user, and for the second detector, the integrate-and-dump filter is synchronized to the base station transmissions. The performance of the two detectors is shown to be approximately equal provided the integrate-and-dump filter is sampled at least two times the chip rate.     

用于ONRS的正交多相码设计

为了提高正交组网雷达系统（Orthogonal Netted Radar Systems,ONRS）中的雷达性能,可以将信号设定为一组特殊设计的正交信号。笔者在阐述正交组网雷达发射信号的设计原理后介绍了一种混合算法,基于以上混合算法获得了相应的多相码序列。结合仿真分析证明,该混合算法是可行有效的。     

Loosely synchronised spreading code aided network performance of quasi-synchronous UTRA-like TDD and FDD CDMA systems

It is demonstrated that loosely synchronised (LS) spreading codes exhibit a so-called interference-free window, where both the autocorrelation and cross-correlation of the codes become zero. Therefore LS codes have the promise of mitigating the effects of both inter-symbol-interference and multiple-access-interference in time dispersive channels. Hence, LS codes have the potential of increasing the capacity of CDMA networks. The work reported has studied the achievable network performance and compared it to that of a UTRA-like time division duplex (TDD) and frequency division duplex (FDD) CDMA system using orthogonal variable rate spreading factor codes.     

Polyphase code design for Orthogonal Netted Radar systems

Orthogonal netted radar systems (ONRS) can fundamentally improve radar performance by using a group of specially designed orthogonal signals. A novel hybrid algorithm is proposed to numerically optimize such orthogonal polyphase code sets. The proposed algorithm integrates a statistical simulated annealing algorithm with the traditional iterative code selection method and is demonstrated to be effective for the design of polyphase signals used in ONRS. Some of the design results are presented and discussed. The effect of Doppler frequency shift on the performance of the designed signals is also investigated.     

Performance of constrained and unconstrained adaptive multiuserdetectors for quasi-synchronous CDMA

It has previously been shown that multiuser interference in a quasi-synchronous code-division multiple-access (QS-CDMA) system can be effectively rejected using a nonadaptive decorrelator. However, the QS decorrelator is orthogonal to the inflated subspace spanned by the undesired users with arbitrary delays in the QS uncertainty interval and, hence, does not perform as well as a decorrelator with a priori knowledge of the delays. Here, we consider a constrained adaptive linear suppression filter which implicitly estimates the delays of the QS undesired signals, and thus approaches the ideal decorrelator of Lupas and Verdu (1990). For QS-CDMA, it is shown through analysis and simulations that the constrained recursive least-squares (C-RLS) algorithm converges faster than an unconstrained RLS adaptive filter, and generally outperforms the nonadaptive QS decorrelator. A cellular quasi-synchronous system is discussed in the present paper     

Design of spreading codes for quasi-synchronous CDMA with intercell interference

The recently proposed loosely synchronized (LS) spreading code can in principle realize an intracell-interference-free quasi-synchronous code-division multiple-access (QS-CDMA) system by creating a wide enough interference-free window (IFW). However, the problem of minimizing intercell interference (ICI) in a cellular QS-CDMA system remains an open issue. Addressing the problem from a sequence design viewpoint, the key challenge is how to generalize the known construction of a single LS code to the design of many families of generalized LS (GLS) codes so that a desirable code family can be selected for the realization of a low-ICI cellular QS-CDMA system. Our main contribution is a systematic construction of new families of GLS codes with favorable intercode cross-correlation properties within a certain window, while maintaining the desirable IFW property. Many such code families can be obtained from our construction by choosing different Hadamard matrices and different uncorrelated complementary pairs. Their effectiveness with respect to some meaningful evaluation criteria are compared. In particular, by a simplified system bit-error rate analysis, it is demonstrated that a new GLS code family significantly outperforms the conventional scrambled LS codes.     

Spreading code construction for CDMA

In this letter, we use the well-known Walsh-Hadamard codes to construct larger sets of linearly dependent codes such that their matrix of correlations is band-diagonal. Optimal detection for systems employing these spreading codes can be efficiently accomplished by a trellis decoder. Analysis and simulation show that with a processing gain of N, up to 2N users can be accommodated without much performance degradation. This proposed approach is quite general and larger code set can be constructed analogously.     

On the performance of a novel quasi-synchronous trellis-coded CDMA system

We introduce a novel signal set defined over a signal space that consists of L (L/spl ges/2) orthogonal planes, and a quasi-synchronous trellis-coded code-division multiple-access (TC-CDMA) system based on it. The proposed scheme makes efficient use of the available processing gain to improve power and/or bandwidth efficiency for practical multiuser interference environments. Having a multiplanar signal constellation structure, the proposed scheme provides several options for a given required data rate, which makes it better adapted to dynamic channel conditions. Analytical bounds and simulation results indicate that at practical error rates and 2 b/s/Hz the proposed scheme is approximately 1.2 dB better than a TC-CDMA system based on 8-PSK, and 3 dB better at 3 b/s/Hz compared to TC-CDMA using 16-QAM. Additionally, the proposed system is approximately 1 dB better than a multicoded system using two signature sequences per user.     

一种用于CDMA中的超正交Turbo码

Turbo码是一种具有接近Shannon编码理论极限性能的并行级连码。阐述了一种性能极为优越的低速率超正交Turbo码,它以带宽为代价,在高斯及衰落信道中的性能均优于普通的Tur-bo码,因此适用于扩频通信的CDMA系统。最后给出了仿真结果。     

Bandlimited quasi-synchronous CDMA: a novel satellite accesstechnique for mobile and personal communication systems

Recent trends in digital communications are opening commercial applications to code division multiple access (CDMA). A novel access technique based on bandlimited quasi-synchronous CDMA (BLQS-CDMA) is described, showing all the advantages of synchronizing conventional direct sequence CDMA to drastically reduce the effect of self-noise. Bandlimitation is achieved with no detection loss by means of Nyquist chip shaping, leading to a simple all-digital demodulator structure. Detection losses due to imperfect carrier frequency and chip timing synchronization are analytically derived and numerical results are checked by computer simulations. Impairments due to satellite transponder distortions are evaluated. The full digital modem structure is presented, together with possible applications to mobile and very small aperture terminal (VSAT) satellite communications     

一种用于CDMA系统的正交序列调制方法

在宽带移动通信系统中，经常考虑采用通过ＦＦＴ实现的多载波调制，如ＯＦＤＭ。本文提出了一种利用ＦＨＴ实现的ＣＤＭＡ系统的正交序列调制方案。其基本思想为利用Ｗａｌｓｈ函数作为载波，将Ｗａｌｓｈ函数分组，从每组中选出一些作为载波，这样不同的载波组合方式本身将包含用户信息。这种方法实现简单，可提高传输效率，并容易与ＣＤＭＡ相结合，能有效地抑制多径干扰。仿真结果表明，该方案在多径衰落信道中能得到很好的性能。     

Orthogonal variable spreading codes for wideband CDMA

Orthogonal codes of variable lengths are essential for multirate services in the Third-Generation Partnership Project (3GPP). We propose an alternative to Walsh functions for variable spreading codes. There are three important points. First, we design an orthogonal code of constant length by mapping the points of a set of finite projective planes to chips of high/low amplitudes. Second, we develop variable spreading codes using multiple layers of recursion. Last, we compare and contrast the proposed variable spreading technique with Walsh functions in terms of ease of synchronization, blind-rate detection and wideband characteristics     

Orthogonal complementary codes for interference-free CDMA technologies

This article addresses the issues of next-generation CDMA technologies for B3G wireless communications. To engineer a CDMA system whose performance will no longer be interference-limited, many challenging issues should be tackled, such as novel CDMA code sets, efficient spreading and carrier modulation schemes, and signaling format for high-speed burst traffic. This article reviews our ongoing research on next-generation CDMA technologies. In particular, we propose a new CDMA code design methodology, real environment adapted linearization (REAL), which can generate CDMA code sets with inherent immunity against multipath interference and multiple access interference for both uplink and downlink transmissions. It is also shown that interference-free CDMA can only be implemented with the help of orthogonal complementary codes. The article goes further to reveal that cell-wise capacity for such interference-free CDMA is equal to the number of element codes assigned to each user, making OFDM a natural choice to implement interference-free CDMA. Several other issues of OCC-CDMA, such as its system implementation and performance, are also addressed in this article.     

A bipolar-bipolar code for asynchronous wavelength-time optical CDMA

We propose a modified bipolar-bipolar code for wavelength-time optical code-division multiple access. The new code uses Gold sequences for time spreading, in place of Barker sequences in our previously proposed bipolar-bipolar code. The new code has a cardinality of N+1 times greater than the original code, because there exist N+2 Gold sequences, but only one Barker sequence, for a given code length N. Since the new code is modified from the original code, there is no increase in hardware complexity. The average performance of the new code is analyzed and found very close to that of the original code. In other words, the new code can support greater cardinality without worsening average performance or increasing hardware complexity.     

Variable-length code construction for incoherent optical CDMA systems

The purpose of this study is to investigate the multirate transmission in fiber-optic code-division multiple-access (CDMA) networks. In this article, we propose a variable-length code construction for any existing optical orthogonal code to implement a multirate optical CDMA system (called as the multirate code system). For comparison, a multirate system where the lower-rate user sends each symbol twice is implemented and is called as the repeat code system. The repetition as an error-detection code in an ARQ scheme in the repeat code system is also investigated. Moreover, a parallel approach for the optical CDMA systems, which is proposed by Marić et al., is also compared with other systems proposed in this study. Theoretical analysis shows that the bit error probability of the proposed multirate code system is smaller than other systems, especially when the number of lower-rate users is large. Moreover, if there is at least one lower-rate user in the system, the multirate code system accommodates more users than other systems when the error probability of system is set below 10⁻⁹.     

Distributed code assignments for CDMA packet radio networks

Code-division multi-access (CDMA) techniques allow many users to transmit simultaneously in the same band without substantial interference by using approximately orthogonal (low cross-correlation) spread-spectrum waveforms. Two-phase algorithms have been devised to assign and reassign spread-spectrum codes to transmitters, to receivers and to pairs of stations in a large dynamic packet radio network in polynomial times. The purpose of the code assignments is to spatially reuse spreading codes to reduce the possibility of packet collisions and to react dynamically to topological changes. These two-phase algorithms minimize the time complexity in the first phase and minimize the number of control packets needed to be exchanged in the second phase. Therefore, they can start the network operation in a short time, then switch to the second phase with the goal of adapting to topological changes. A pairwise code-assignment scheme is proposed to assign codes to edges. Simulations based on well-controlled topologies (sparse topologies) show that the scheme requires much fewer codes than transmitter-based code assignment, while maintaining similar throughput performance     

Orthogonal code hopping multiplexing

An orthogonal code hopping multiplexing scheme is proposed as a statistical multiplexing scheme for an orthogonal downlink in order to accommodate more orthogonal downlink channels than orthogonal codewords for mobile stations, and its performance is evaluated.     

Noncoherent hybrid parallel PN code acquisition for CDMA mobilecommunications

This paper proposes a noncoherent hybrid parallel pseudonoise (PN) code acquisition scheme for code-division multiple access (CDMA) mobile communication systems and analyzes the effect of multiple access interference (MAI) on the code acquisition performance for Rayleigh and Rician fading channels. The hybrid acquisition scheme combines parallel search with serial search to cover the whole uncertainty region of the input code phase. It has a much simpler acquisition hardware structure than the total parallel acquisition and can achieve the mean acquisition time slightly inferior to that of the total parallel acquisition in the case of severe MAI; on the other hand, it provides the flexibility in the tradeoff between the mean acquisition time and system complexity if no MAI is considered. The closed-form expressions of the detection and false-alarm probabilities and mean acquisition time are derived. Numerical analysis quantifies the severe performance degradation of code acquisition due to both MAI and channel fading, and demonstrates the dependence of the increase of mean acquisition time (due to MAI) on the number of users in the CDMA system, system design parameters, and channel fading statistics     

Blind channel estimation for long code multiuser CDMA systems

In CDMA systems with long codes, the users' signatures change in each bit period, impeding the estimation of the time-invariant multipath parameters. In this paper, correlation-matching methods are employed to blindly estimate those multipath parameters. For given code sequences, the output correlation matrix (parameterized by the unknown channel coefficients) is compared with its instantaneous approximation. By minimizing the Frobenius norm of the resulting error matrix, the channel parameters can be estimated up to a complex scalar ambiguity. Both batch and adaptive algorithms are derived. Under the assumption of i.i.d. code sequences, identifiability up to a complex scalar ambiguity for each channel is guaranteed, and the asymptotic convergence of the proposed algorithm is established. Furthermore, step-size selection for the adaptive version is investigated. When only the code sequence of the user of interest is available, a single user receiver is also derived. Simulation results verify those claims and provide comparisons with other methods     

Use of multiple antennas for DS/CDMA code acquisition

A generalized acquisition scheme is proposed for direct sequence code-division multiple-access systems with multiple antennas. The proposed scheme employs grouping of multiple antennas as a means of a tradeoff between two important factors determining the mean acquisition time, combining gain and search time. The performance of the proposed acquisition scheme is analyzed in frequency-selective Rayleigh-fading channels with consideration of spatial correlations. Numerical results show that the use of the largest number of antenna groups is preferable to reducing the mean acquisition time at low signal-to-interference ratio (SIR) values. At high SIR values, on the contrary, the mean acquisition time is found to increase in proportion to the number of antenna groups. In a typical environment, the presence of spatial correlation is shown to increase or decrease the mean acquisition time within 50% compared with the uncorrelated fading case.