An algebraic approach to generate super‐set of perfect complementary codes for interference‐free CDMA

This paper introduces an algebraic approach to generate the super‐set of perfect complementary (PC) codes suitable for new generation CDMA applications, characterized by isotropic multiple access interference (MAI) free and multipath interference (MI) free properties. The code design methodology proposed in this paper takes into account major impairing factors existing in real applications, such as MAI, MI, asynchronous transmissions, and random signs in consecutive symbols, such that a CDMA system using the generated codes can insure a truly interference‐free operation. Two important facts will be revealed by the analysis given in this paper. First, implementation of an interference‐free CDMA will never be possible unless using complementary code sets, such as the PC code sets generated in this paper. In other words, all traditional spreading codes working on an one‐code‐per‐user basis are not useful for implementation of an MAI‐free and MI‐free CDMA system. Second, to enable the interference‐free CDMA operation, the flock size of the PC codes should be made equal to the set size of the codes, implying that a PC code set can support as many users as the flock size of the code set. A systematic search has been carried out to generate the super‐set of various PC codes with the help of carefully selected seed codes belonging to distinct sub‐sets. This paper will also propose an implementation scheme based on multi‐carrier CDMA architecture and its performance is compared by simulations with the ones using traditional spreading codes. Copyright © 2006 John Wiley & Sons, Ltd.     

A ZCZ‐CDMA system with BFSK modulation

A quasi‐timing synchronous code division multiple access (CDMA) system called ZCZ‐CDMA, which uses a set of sequences with a zero‐correlation zone called ZCZ code as a spreading code, is useful for short‐range wireless communications because of its excellent properties such as co‐channel interference‐free performance, simplified hardware design, and low transmit power as well as fast frame synchronization capability. In this paper, a ZCZ‐CDMA system with binary frequency‐shift keying (BFSK) modulation called BFSK‐ZCZ‐CDMA is proposed. This system is characterized by using a pair of balanced ZCZ codes for spreading and transmitting the two spread components over the respective keying carrier frequencies. Its bit error rate performance, compared with those of existing BPSK‐ZCZ‐CDMA, ASK‐ZCZ‐CDMA, and CDMA systems using the other spreading codes, is evaluated in theory and simulation. The bit error rate performance of the three ZCZ‐CDMA systems over additive white Gaussian noise and Rayleigh fading channels are formulated. It is proved that BFSK‐ZCZ‐CDMA is much more robust in anti‐fading performance and low transmit power in such an environment that fading distributions on the keying frequencies are independent mutually. Fading versus frequency characteristics are also investigated. Copyright © 2012 John Wiley & Sons, Ltd.     

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 New Walsh-Like Near Orthogonal (WNO) Sequence for Asynchronous CDMA System

Present generation mobile communication system employs one of the most popular wireless access technologies called code division multiple access (CDMA). Design of CDMA spreading codes has drawn significant attention amongst the researchers over the last few decades. CDMA code family is generally categorized into purely orthogonal and non-orthogonal (near-orthogonal) members which have established their application in synchronous (downlink) and asynchronous (uplink) CDMA system respectively. Walsh code has been regarded as the most useful spreading code to be used in synchronous link because of its orthogonality property. However, the performance of Walsh code is significantly inferior in asynchronous surroundings. A number of codes have consequently been proposed with an aim to mitigate the shortcomings of Walsh code. This paper makes an innovative attempt to enhance the correlation properties of existing Walsh code through one simple yet powerful algorithm. Proposed code of length ‘N’ has been generated from code sets of length ‘N/4’ and thus makes the code generation algorithm recursive in nature. Performance of the proposed code has subsequently been compared with some existing orthogonal and semi orthogonal codes in terms of various performance metrics and finally the supremacy of our proposition has been established.     

Minimum Cross Correlation Spreading Codes

Multiple access interference (MAI) appears in Code Division Multiple Access (CDMA) systems when the communication channel is a multi-path channel and the spreading codes are not orthogonal. Orthogonality between spreading codes cannot be maintained at the CDMA receiver because the codes may be asynchronous due to channel delay and multi-path spread. The receiver cannot perfectly separate the different signals of the multiple access users, and the resultant MAI limits the capacity of CDMA systems. MAI is a function of the cross correlation property between used spreading codes. In this paper we focus on the cross correlation of the spreading codes, we propose a method to find spreading codes with minimum magnitude of cross correlation. Employing these codes will reduce the resultant MAI in the CDMA system; hence it will increase the system capacity. A great enhancement is shown by comparing found minimum cross correlation spreading codes (MCCSC) with Hadamard and Gold codes.

KM序列用作RAKE型CDMA系统扩频码的分析

本文提出将KM 序列用作RAKE型CDMA系统的扩频码.基于一个RAKE接收机模型,分析了CDMA系统性能并提出了适于作RAKE型CDMA系统扩频码的PN序列的特性.接着,分析了KM 序列作RAKE型CDMA系统扩频码的优劣.最后,运用计算机仿真,比较了m序列和KM 序列的互相关特性以及在相干接收机和RAKE接收机下,这两种序列和Gold序列对应的系统平均误码率,从而证实了KM 序列作为扩频码的可行性.     

KM序列用作RAKE型CDMA系统扩频码的分析

本文提出将KM M序列用作RAKE型CDMA系统的扩频码 .基于一个RAKE接收机模型 ,分析了CDMA系统性能并提出了适于作RAKE型CDMA系统扩频码的PN序列的特性 .接着 ,分析了KM M序列作RAKE型CDMA系统扩频码的优劣 .最后 ,运用计算机仿真 ,比较了m序列和KM M序列的互相关特性以及在相干接收机和RAKE接收机下 ,这两种序列和Gold序列对应的系统平均误码率 ,从而证实了KM M序列作为扩频码的可行性     

多径衰落信道下的扩频码设计与联合检测

在多径衰落信道CDMA系统中，扩频码设计与联合检测为提高系统容量的两个重要手段。在扩频码设计中，通过构造零相关窗码可以消除MAI和ISI，从而提高系统容量。当扩频码相关特性不理想时，通过联合检测也可以消除干扰，提高系统容量。但二者都有一定局限性，对于零相关窗码来说，它的码字资源十分有限，对于联合检测来说，当用户数很大，它的复杂度不能容忍。该文将扩频码设计与联合检测结合起来，提出了一种具有组间零相关窗特性的新型扩频码。在扩频码设计时考虑联合检测，可以增加码字资源，在联合检测中考虑扩频设计，又可以降低联合检测的复杂度。     

Adaptive transmitter optimization for blind and group-blind multiuser detection

The linear subspace-based blind and group-blind multiuser detectors recently developed represent a robust and efficient adaptive multiuser detection technique for code-division multiple-access (CDMA) systems. In this paper, we consider adaptive transmitter optimization strategies for CDMA systems operating in fading multipath environments in which these detectors are employed. We make use of more recent results on the analytical performance of these blind and group-blind receivers in the design and analysis of the transmitter optimization techniques. In particular, we develop a maximum-eigenvector-based method of optimizing spreading codes for given channel conditions and a utility-based power control algorithm for CDMA systems with blind or group-blind multiuser detection. We also design a receiver incorporating joint optimization of spreading codes and transmitter power by combining these algorithms in an iterative configuration. We will see that the utility-based power control algorithm allows us to efficiently set performance goals through utility functions for users in heterogeneous traffic environments and that spreading code optimization allows us to achieve these goals with lower transmit power. The signal processing algorithms presented here maintain the blind (or group-blind) nature of the receiver and are distributed, i.e., all power and spreading code adjustments can be made using only locally available information.     

Code-spread CDMA using maximum free distance low-rate convolutionalcodes

In code division multiple-access (CDMA) systems, maximum total throughput assuming a matched filter receiver can be obtained by spreading with low-rate error control codes. Previously, orthogonal, bi-orthogonal and super-orthogonal codes have been proposed for this purpose. We present in this paper a family of rate-compatible low-rate convolutional codes with maximum free distance. The performance of these codes for spectrum spreading in a CDMA system is evaluated and shown to outperform that of orthogonal and super-orthogonal codes as well as conventionally coded and spread systems. We also show that the proposed low rate codes will give simple encoder and decoder implementations. With these codes, any rate 1/n, n⩽512, are obtained for constraint lengths up to 11, resulting in a more flexible and powerful scheme than those previously proposed     

Performance bounds for optimum multiuser DS-CDMA systems

In this letter we estimate the bit error probability (BEP) of optimum multiuser detection for synchronous and asynchronous code division multiple access (CDMA) systems on Gaussian and fading channels. We first compute an upper bound and a lower bound on the bit error probability for a given spreading code, then average the bounds over a few thousand sets of spreading codes. These bounds are obtained from a partial distance spectrum. On Gaussian channels, the upper bound converges to the lower bound at moderate to large signal-to-noise ratios. However, on fading channels the upper bound does not converge, hence we present our results for the lower bound only. The numerical results show that: 1) the BEP of a 31-user CDMA system with binary random spreading codes of length 31 is only two to four times higher than the BEP of the single user system; 2) the number of users that can be accommodated in an asynchronous CDMA system is larger than the processing gain; and 3) optimum multiuser detection outperforms linear detection (e.g., the decorrelating detector) by about 2.8 to 5.7 dB     

A novel modulation and demodulation technique for the downlink of spread spectrum multipath channels

In this letter, a novel method for modulation and demodulation of user information bit in spread spectrum code-division multiple-access (CDMA) systems is proposed. Synchronous CDMA poses intrinsic protection against co-channel interference due to orthogonal spreading codes used. However, in the presence of multipath, signals lose their orthogonality property, leading to an increased cross correlation. In this letter, we show that the performance of the system will be close to single user system if we assign two codes to each user and these two codes are used for modulation and demodulation. The well-known maximum length sequence codes are good candidates for the present modulation and demodulation technique. The limiting factor to the system capacity is the maximum number of codes and the capacity is half of that number.     

Efficient use of DS/CDMA signals for broadband communications over power lines

This paper investigates the use of direct‐sequence/code‐division multiple access (DS/CDMA) signals for broadband communications over power lines. Each user is assumed to utilize all available spreading codes for sending the information to the destination. The transmitter and the receiver are assumed to have perfect channel knowledge with the receiver employing a zero‐forcing multiuser detector. Based on channel knowledge we attempt to maximize the data throughput by suitable choice of the number of codes used and the power and the constellation size (bit‐load) assigned to the data modulating each spreading code. We employ Gold codes, in addition to special codes derived based on the channel knowledge for ISI minimization, termed ‘eigen codes’. In contrast to some earlier results concerning CDMA and OFDM, we show that DS/CDMA signals can be optimized to achieve an overall data throughput of approximately 80% of that achieved by OFDM systems. This result shows that DS/CDMA signaling can be a good candidate for broadband power line communications. Copyright © 2011 John Wiley & Sons, Ltd.     

On Next Generation CDMA Technologies: The REAL Approach for Perfect Orthogonal Code Generation

All currently available code-division multiple-access (CDMA) technologies used in second-generation and third-generation mobile cellular systems are interference limited and can be appropriately called first-generation CDMA, whereas next-generation CDMA should provide a nearly interference-free performance. This paper addresses the issues on spreading code generation that is suitable for next-generation CDMA systems. The real environment adaptation linearization (REAL) approach is proposed to generate perfectly orthogonal complementary (POC) codes characterized by multiple access interference (MAI)-free and multipath interference (MI)-free operation. The REAL approach takes into account almost all major impairing factors in real applications, such as multipath propagation, asynchronous transmission, random data signs, and burst traffic, such that a CDMA system using them can offer an interference-resist operation. Two important conclusions are drawn in this paper: First, implementation of an interference-free CDMA will not be possible unless using complementary codes, such as the POC codes. Second, to enable interference-free CDMA, the flock size of the signature codes should preferably be equal to the set size of the codes. A fast algorithm to generate supercomplementary codes (a subset of POC codes) is also presented, and their ideal orthogonality is explicitly proven.      

A Toeplitz displacement method for blind multipath estimation forlong code DS/CDMA signals

The problem of blind channel identification for direct-sequence/code-division multiple-access (DS/CDMA) multiuser systems is explored. For wideband DS/CDMA signals, multipath distortion is well modeled by a finite-impulse response filter. In this work, a blind channel identification technique based on second-order statistics is investigated. The method exploits knowledge of the spreading code of the user of interest via matched filtering, as well as properties of spreading codes. The current scheme focuses on a method appropriate for randomized long sequence DS/CDMA. This access scheme poses special challenges as the spreading codes are time varying. An analytical approximation of the mean-squared error is derived using perturbation techniques. The performance of the algorithm is studied via simulation and through the mean-squared error approximation, which is observed to be tight     

Interference-free broadband single- and multicarrier DS-CDMA

The choice of the direct sequence spreading code in DS-CDMA predetermines the properties of the system. This contribution demonstrates that the family of codes exhibiting an interference-free window (IFW) outperforms classic spreading codes, provided that the interfering multi-user and multipath components arrive within this IFW, which may be ensured with the aid of quasi-synchronous adaptive timing advance control. It is demonstrated that the IFW duration may be extended with the advent of multicarrier DS-CDMA proportionately to the number of subcarriers. Hence, the resultant MC DS-CDMA system is capable of exhibiting near-single-user performance without employing a multi-user detector. A limitation of the system is that the number of spreading codes exhibiting a certain IFW is limited, although this problem may be mitigated with the aid of novel code design principles     

Iterative multiuser interference reduction: turbo CDMA

We view the asynchronous random code division multiple-access (CDMA) channel as a time-varying convolutional code. We study the case where the users encode their data, and, therefore, the single user transmitters and the CDMA channel appear as the concatenation of two coding systems. At the receiver we employ serial turbo decoding strategies. Unlike conventional turbo codes where both the inner and outer code may be selected, in our case, the inner code is due to the CDMA channel which we assume to be random. Nevertheless, the decoding system resembles the decoder of a serial turbo code and single-user performance is obtained even for numbers of users approaching the spreading code length     

The Application of Frequency Assignment Techniques in Spreading Code Assignment

The use of spreading codes with a zero correlation zone or a low correlation zone can reduce multiple access interference in code-division multiple-access (CDMA) radio systems. However, problems can arise from the limited number of codewords. In this paper it is shown that this shortage of codewords can be mitigated by a combination of two approaches. Existing constructions of binary and ternary codes for quasisynchronous CDMA are modified to double the number of spreading codewords. Increases in correlation are restricted to certain codeword pairs. A metaheuristic algorithm inspired by those used in frequency assignment is then used to assign these codewords. This is done in such a way that a satisfactory signal-to-interference ratio across the network is obtained. Excellent results are reported for several networks. Interference is lower than when a Gold code is used as a scrambling code. Bit-error-rate improvements are quantified in the case that binary phase shift keying is used.     

A Medium Access Control Protocol for Voice/Data Integrated Wireless CDMA Systems

In this paper, a medium access control protocol is proposed for integrated voice and data services in wireless local networks. Uplink channels for the proposed protocol are composed of time slots with multiple spreading codes per slot based on slotted code division multiple access (CDMA) systems. The proposed protocol uses spreading code sensing and reservation schemes. This protocol gives higher access priority to delay‐sensitive voice traffic than to data traffic. The voice terminal reserves an available spreading code to transmit multiple voice packets during a talkspurt. On the other hand, the data terminal transmits a packet without making a reservation over one of the available spreading codes that are not used by voice terminals. In this protocol, voice packets do not come into collision with data packets. The numerical results show that this protocol can increase the system capacity for voice service by applying the reservation scheme. The performance for data traffic will decrease in the case of high voice traffic load because of its low access priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.     

Spreading‐code‐dependent bit error rate and capacity analysis for finite asynchronous CDMA systems

Most CDMA systems serve only finite number of active users. Therefore, using Gaussian approximation to evaluate its performance is inappropriate. In such finite CDMA systems, the selection of spreading codes is of great importance because its performance is very much spreading‐code‐dependent. In this paper, a new algorithm based on multiple variable Bernoulli process is introduced to evaluate bit error rate due to co‐channel interference and thus the capacity of a CDMA system. The algorithm can also be used for large‐sized CDMA systems. The results show that small Kasami and Gold‐like codes offer higher capacity than the others do. Copyright © 1999 John Wiley & Sons, Ltd.