基于多相扩频码的MC-CDMA信号峰平比抑制方法研究

降低信号峰平比(PAPR)是多载波码分多址(MC-CDMA)系统的关键技术之一。该文推导了基于正交互补扩频码的MC-CDMA信号PAPR关系式;基于多相脉压码构造了可用于MC-CDMA系统的多相脉压扩频码集合;证明了多相脉压扩频码即为正交互补扩频码。仿真结果表明,各种输入信息调制方式下,大部分多相脉压扩频码比常用扩频码能进一步降低信号的PAPR,其中多电平调制方式下多相脉压扩频码的PAPR性能更优;在不同用户数情况下,多相脉压扩频码都是MC-CDMA系统扩频码的一个很好选择。     

A Low Complexity VCS Method for PAPR Reduction in Multicarrier Code Division Multiple Access

This paper investigates a peak to average power ratio (PAPR) reduction method in multicarrier code division multiple access (MC-CDMA) system. Variable code sets (VCS), a spreading codes selection scheme, can improve the PAPR property of the MC-CDMA signals, but this technique requires an exhaustive search over the combinations of spreading code sets. It is observed that when the number of active users increases, the search complexity will increase exponentially. Based on this fact, we propose a low complexity VCS (LC-VCS) method to reduce the computational complexity. The basic idea of LC-VCS is to derive new signals using the relationship between candidature signals. Simulation results show that the proposed approach can reduce PAPR with lower computational complexity. In addition, it can be blindly received without any side information.     

A Low Complexity VCS Method for PAPR Reduction in Multicarrier Code Division Multiple Access

This paper investigates a peak to average power ratio (PAPR) reduction method in multicarrier code division multiple access (MC-CDMA) system. Variable code sets (VCS), a spreading codes selection scheme, can improve the PAPR property of the MC-CDMA signals, but this technique requires an exhaustive search over the combinations of spreading code sets. It is observed that when the number of active users increases, the search complexity will increase exponentially. Based on this fact, we propose a low complexity VCS (LC-VCS) method to reduce the computational complexity. The basic idea of LC-VCS is to derive new signals using the relationship between candidature signals. Simulation results show that the proposed approach can reduce PAPR with lower computational complexity. In addition, it can be blindly received without any side information.     

Multi‐carrier platform for wireless communications. Part 2: OFDM and MC‐CDMA systems with high‐performance,high‐throughput via innovations in spreading

Multi‐carrier technologies in general, and OFDM and MC‐CDMA in particular, are an integral part of the wireless landscape. In this second part of a two‐part survey, the authors present an innovative set of spreading codes known as CI codes, and demonstrate how these significantly increase performance and capacity in OFDM and MC‐CDMA systems, all the while eliminating PAPR concerns. Regarding OFDM: the spreading of each symbol over all N carriers using CI spreading codes (replacing the current one symbol per carrier strategy) are presented. CI codes are ideally suited for spreading OFDM since, when compared to traditional OFDM, CI‐based OFDM systems achieve the performance of coded OFDM (COFDM) while maintaining the throughput of uncoded OFDM, and, at the same time, eliminate PAPR concerns. When applied to MC‐CDMA, CI codes provide a simple means of supporting 2N users on N carriers while maintaining the performance of an N‐user Hadamard Walsh code MC‐CDMA system, i.e., CI codes double MC‐CDMA network capacity without loss in performance. The CI codes used in OFDM and MC‐CDMA systems are directly related to the CI pulse (chip) shapes used to enhance TDMA and DS‐CDMA (see part 1): hence, the CI approach provides a common hardware platform for today's multi‐carrier/multiple‐access technologies, enabling software radio applications. Copyright © 2002 John Wiley & Sons, Ltd.     

BER Performance of Walsh Hadamard Like Codes Based on Complementary Sequence Sets in a CDMA and Cognitive Underlay System

In this paper, a method of constructing a sequence set similar to Walsh Hadamard (WH) codes is described. In general, two complementary sequence set of length 2 is used as a basic kernel to construct WH codes. In this work, four complementary sequence set of length 3 is used as a basic kernel. The proposed code set have a nearly non linear phase sequences with a more evenly spread frequency spectrum when compared with WH codes. It is shown that the proposed spreading codes perform comparable to WH in a Direct Sequence code division multiple access (DS-CDMA) system in an Additive White Gaussian Noise and Rayleigh channel at a reduced code length. In this work, bit error rate performance of the Underlay Cognitive Radio system implemented using DS-CDMA system is simulated. Primary and Secondary Users are distinguished by assigning spreading codes from different families and it is assumed that the channel information is known by both the Primary and Secondary User receivers. This new code set offers good performance in a Cognitive Radio Underlay system.     

The study of a BOCC m-ary spread spectrum scheme

M-ary spread spectrum technique has been found wide applications in wireless communications, but it needs too many orthogonal spreading codes, and its despreading/demodulation is quite complex computationally, which limit its wider applications. This paper proposes a novel scheme for Code Division Multiple Access （CDMA） communication systems based on M-ary spread spectrum, where only one prototype spreading code is assigned to each user and the codes for different users are orthogonal or quasi-orthogonal with each other. The M spreading codes of each user to represent K bits data are generated by circularly shifting the assigned code and reversing its polarity. The spreading codes generated like that are called as BiOrthogonal Cyclic Codes （BOCCs）. At the receiver of the system, a transform domain matched-filter implemented by means of Fast Fourier Transform （FFT） is employed to despread and demodulate the received signals, which has very low computational complexity. The results of simulation experiments and bit-error performance analysis show that the proposed scheme is practical and very useful in many cases.     

A PAPR reduction scheme based on a new spreading code in optical direct detection OFDM system

In this paper, we propose and experimentally demonstrate a peak-to-average power ratio (PAPR) reduction scheme based on a new spreading code in direct detection optical orthogonal frequency division multiplexing (OFDM) system. The new spreading code with low cross correlation and high auto-correlation can support \(2N+1\) users. Thus, \(2N+1\) users or data symbols can be transmitted over only N subcarriers. The experimental results show that, after transmission over 70 km single-mode fiber, at the bit error rate of \(10^{-3}\), with fiber launch power of 2.75 dBm, the receiver sensitivity can be improved 2.1 dB by using the proposed scheme based on new spreading code. The PAPR can be reduced about 4.6 dB, compared with the original OFDM signal at a complementary cumulative distribution function of \(10^{-4}\).     

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     

Design of spread spectrum multicode CDMA transport architecture formultimedia services

We investigate a new application of the well-known spread spectrum code division multiple access (SS-CDMA) techniques to multimedia services related to the development of the next-generation wireless mobile networks interconnecting with a wireline ATM-based broadband network. Such services allow users to share novel multimedia applications without any geographical restrictions. However, since the mobile radio channel has a fixed limited bandwidth, the traditional SS-CDMA system may not be sufficient to accommodate the variable bit rate (VBR) multimedia services requested by multiple mobile users simultaneously. Moreover, the traffic load at the base station can change dynamically due to the time-varying throughput requirement of these requested multimedia services. To tackle this difficulty, a multicode CDMA (MC-CDMA) technique is proposed to provide multirate multimedia services by varying the number of spreading codes assigned to each user in order to meet its throughput requirement. In MC-CDMA, a spreading code can be used to transmit information at a basic bit rate. Users (video or data) who need higher transmission rates can use multiple codes in parallel. Meanwhile, the maximum available number of codes in the MC-CDMA system is still limited. Hence, a cost-effective dynamic code allocation scheme has then been proposed to dynamically assign an appropriate number of codes to each user for achieving the maximum resource utilization for multiuser multimedia services via the mobile radio channel. Finally, a number of real multimedia titles generated from the well-known MacroMind Director are conducted to evaluate performance     

基于改进EASI算法的DS-CDMA信息码与伪码盲估计

针对直扩序列码分多址(DS-CDMA)系统多用户检测的问题,提出了一种基于性能指标(PI)变步长EASI算法信息码与伪码盲估计的算法.该算法在比较盲源分离(BSS)和DS-CDMA系统模型的基础上,用自适应的方法估计混合矩阵进而估计出伪码,并利用分离矩阵分离观测信号从而估计出信息码.另外,该算法利用PI值来调整步长,使算法收敛速度和稳定性能达到一个理想平衡点.实验结果显示,该算法具有很好的抗多址干扰(MAI)的能力,伪码和信息码的误码率分别在-10 dB和0 dB时达到10-2以下;对不同用户数,5dB时所有扩频码被完全正确检测的概率几乎都在80％以上.     

Polyphase codes for uplink OFDM-CDMA systems

We propose a OFDM-CDMA system that employs polyphase codes to support variable spreading factors. A systematic approach for constructing the polyphase code sequences of variable spreading factors is developed. Polyphase codes exhibit better auto- and cross-correlation properties than Hadamard codes. When employed in OFDM-CDMA systems, polyphase codes result in certain structured multiple-access interference (MAI) caused by multipath. Analytical and numerical results show that OFDM-CDMA systems employing polyphase codes have better PAPR performance than those using Hadamard codes. The BER performance of the OFDM-CDMA system using polyphase codes is evaluated by numerical results and compared to that of the OFDM-CDMA system using Hadamard codes with and without clipping.     

基于编码法降低MC-CDMA系统峰均比技术研究

分析了多载波码分多址（MC-CDMA）系统模型及扩频码序列性能,根据MC-CDMA系统特点,研究了采用GOLAY码、Gold码及Walsh码等不同扩频序列及不同序列长度对MC-CDMA系统峰均比的影响。仿真分析了序列长度为16、32及64位时MC-CDMA系统峰均比性能。     

Supporting rate guarantee and fair access for bursty data trafficin W-CDMA

This paper presents a new protocol for statistical multiplexing of bursty data traffic in the forward (base-to-mobile) link of a wireless wideband code division multiple access (W-CDMA) system using orthogonal variable spreading factor (OVSF) codes. At the heart of the protocol is an efficient scheduling algorithm that dynamically assigns an OVSF code to a mobile user on a timeslot-by-timeslot basis and allows many users with bursty traffic to share a limited set of OVSF codes. An important feature of our protocol is that it can provide a heterogeneous data rate guarantee to each mobile user and fully utilize the system capacity. Moreover, the unreserved bandwidth of the network can be shared fairly among competing mobile users     

A current mode feed-forward gain control system for a 0.8 V CMOS hearing aid

A current mode feed-forward gain control（CMFGC）technique is presented,which is applied in the front-end system of a hearing aid chip.Compared with conventional automatic gain control（AGC）,CMFGC significantly improves the total harmonic distortion（THD）by digital gain control.To attain the digital gain control codes according to the extremely weak output signal from the microphone,a rectifier and a state controller implemented in current mode are proposed.A prototype chip has been designed based on a 0.13μm standard CMOS process.The measurement results show that the supply voltage can be as low as 0.6 V.And with the 0.8 V supply voltage,the THD is improved and below 0.06%（-64 dB）at the output level of 500 mV_p-p,yet the power consumption is limited to 40μW.In addition,the input referred noise is only 4μV_rmsand the maximum gain is maintained at 33 dB.     

基于不同载波干涉编码OFDM性能分析

在载波干涉编码正交频分复用（CI/OFDM）系统中采用了几种CDMA扩频序列作为载波干涉码。并比较了用不同载波干涉编码的正交频分复用（OFDM）系统性能。从理论分析和Matlab实验仿真得出CI/OFDM系统的比特误码率（BER）随着子载波数目增加而变低,BER与采用不同的载波干涉（CI）编码无关。并证明CI/OFDM系统的峰均比（PAPR）主要取决于子载波数的大小以及CI码的性质。     

Source-channel optimized trellis codes for bitonal imagetransmission over AWGN channels

We consider the design of trellis codes for transmission of binary images over additive white Gaussian noise (AWGN) channels. We first model the image as a binary asymmetric Markov source (BAMS) and then design source-channel optimized (SCO) trellis codes for the BAMS and AWGN channel. The SCO codes are shown to be superior to Ungerboeck's codes by approximately 1.1 dB (64-state code, 10^-5 bit error probability), We also show that a simple “mapping conversion” method can be used to improve the performance of Ungerboeck's codes by approximately 0.4 dB (also 64-state code and 10 ^-5 bit error probability). We compare the proposed SCO system with a traditional tandem system consisting of a Huffman code, a convolutional code, an interleaver, and an Ungerboeck trellis code. The SCO system significantly outperforms the tandem system. Finally, using a facsimile image, we compare the image quality of an SCO code, an Ungerboeck code, and the tandem code, The SCO code yields the best reconstructed image quality at 4-5 dB channel SNR     

A single-symbol-decodable space-time block code with full rate and low peak-to-average power ratio

Three desirable properties of a four-antenna spacetime block code are full rate, full diversity, and single-symbol decodability. Previously reported space-time codes that achieve all three properties do so at the expense of the peak-to-average power ratio (PAPR). A fourth desirable property of a space-time block code is that its PAPR be the same as that of the underlying quadrature-amplitude modulation alphabet. In this letter we introduce space-time codes for three and four transmit antennas that achieve all four properties; these codes use a diversity technique based on constellation stretching. Numerical results for quasistatic Rayleigh-fading channels show that, despite their low PAPR, the proposed codes are comparable in SNR performance to the best-performing single-symbol decodable space-time codes for three and four transmit antennas.     

An erasure-based scheme for reduction of PAPR in spatial multiplexing MIMO-OFDM using Reed-Solomon codes over GF(216 + 1)

In this paper, a novel erasure-based scheme which uses long Reed-Solomon (RS) codes over GF(65537) is proposed for the reduction of the peak-to-average power ratio (PAPR) in coded orthogonal frequency division multiplexing (OFDM). The motivation for using the field GF(65537) is to generate long code words (up to 65536 symbols in just one code word). Using long codes results in greater flexibility to search for low PAPR OFDM frames within the subsets of symbols of a code word because RS codes are maximum distance separable and any subset of a high enough number of symbols is sufficient for the recovery of data. Over this field, the lengths of code words are exponents of 2. Hence, low-complexity radix-2 fast Fourier transform can be exploited. RS codes are deployed for both PAPR reduction and error correction. Simulation results show that in similar PAPR reduction performances, the proposed scheme outperforms the previously reported work with RS codes in both error correction and computation complexity. The proposed scheme can be applied to both single-input single-output and multi-input multi-output systems.     

Successive interference cancellation algorithms for downlink W-CDMAcommunications

In this paper, successive intracell interference cancellation (IIC) of the wideband-code division multiple access (W-CDMA) signal at the mobile unit is considered. Three new interference cancellation techniques suitable for the downlink of any CDMA system with orthogonal spreading are proposed. No prior knowledge of users' spreading codes or even their spreading factors are required for interference cancellation. A new term, effective spreading code, has been introduced, which is defined as the interfering user physical code as seen by the desired user within the desired user symbol duration. The mobile receiver estimates the effective spreading codes of the interfering users regardless of their spreading factors using fast Walsh transform (FWT) correlators (instead of the regular correlators) and uses this information to suppress the intracell multiuser interference. Three different interference-suppressing techniques are studied: subtraction; combined interfering signal projection; and separate interfering signal subspace projection. The complexity of the proposed techniques is low compared to conventional interference cancellation techniques. For a W-CDMA system and the IMT-2000 vehicular channel model, a capacity increase of up to 150% of the original (without IIC) system capacity is shown     

Nonlinear Product Codes and Their Low Complexity Iterative Decoding

This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N‐dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well‐known nonlinear Nordstrom‐Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of 10^?6 when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom‐Robinson codes has an effective gain of about 0.7 dB at a BER of 10^?5 when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi‐cyclic codes.