A NEW DECODER OF SYNCHRONOUS OPTICAL CODE DIVISION MULTIPLE ACCESS SYSTEMS USING SEGMENTED CORRELATION

A new segmented correlating decoder of synchronous optical CDMA using modified prime sequence codes is proposed. The performance of the proposed system is analyzed under the assumption of Poisson shot noise model for the receiver photodetector. The decoder technique is shown to be more effective to improve the bit error probability performance than the method using an optical hard-limiter.

Joint power control based on service factor for code division multiple access system

An important feature of the traffic in mobile networks is burstiness. Drawbacks of conventional power control algorithms for time division duplex （TDD）-code division multiple access （CDMA） systems are analyzed. A joint power control algorithm based on service factor is presented to address the TDD-CDMA mobile services in the burst mode according to the Markov modulated Bernoulli process. The joint power control equation is derived. A function model is developed to verify the new algorithm and evaluate its performance. Simulation results show that the new power control algorithm can estimate interference strength more precisely, speed up convergence of power control, and enhance power efficiency and system capacity. It is shown that the proposed algorithm is more robust against link gain changes, and outperforms the reference algorithms.

A multiple copyright identification watermarking algorithm based on code division multiple access

A multiple watermarking algorithm is presented according to the multiple accessing technique of thecode division multiple access (CDMA) system.Multiple watermarks are embedded into digital images inthe wavelet transform domain.Each of the watermarks is embedded and extracted independently withoutimpacts to each other.Multiple watermarks are convolution encoded and block interleaved,and the or-thogonal Gold sequences are used to spread spectrum of the copyright messages.CDMA encoded water-mark messages are embedded into the wavelet sub-bands excluding the wavelet HH1 sub-bands.The em-bedment amplitude is decided by Watson's perceptual model of wavelet transform domain,and the em-bedment position in the selected wavelet sub-bands is decided randomly by a pseudo-random noise (PN)sequence.As a blind watermarking algorithm,watermarks are extracted without original image.The wa-termarking capacity of proposed algorithm is also discussed.When two watermarks are embedded in animage at the same time,the capacity is larger than the capacity when a single watermark is embedded,and is smaller than the sum of the capacity of two separately embedded watermarks.Experimental resultsshow that the proposed algorithm improves the detection bits error rate (BER) observably,and the multi-pie watermarks have a preferable robustness and invisibility.

HYBRID ORTHOGONAL/RANDOM MULTIPLE ACCESS SCHEME WITH IMPROVED PERFORMANCE FOR DOWNLINK CDMA SYSTEMS

In this paper, a hybrid orthogonal and random multiple access scheme with improved performance for capacity-enhanced downlink Code-Division Multiple-Access (CDMA) systems is presented, which is in fact a combination of the conventional orthogonal spreading scheme and the synchronous Interleave Division Multiple Access (IDMA) scheme. The proposed scheme can achieve near single user performance for very large number of users by the iterative turbo like detection. Analysis and simulation results show that the proposed scheme performs better than the synchronous IDMA scheme for the same time complexity. Meanwhile, larger capacity can be provided compared with the conventional orthogonal schemes.

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 comtational pucomplexity. In addition, it can be blindly received without any side information.

IMPROVING THE CAPACITY OF MULTI-CODE MULTIMEDIA CDMA SYSTEM

A novel method for improving the capacity of multi-code multimedia Code Division Mul- tiple Access (CDMA) systems is proposed. By factitiously improving the transmission bit rate of the call, the number of the orthogonal codes used by a user is increased which leads to the decreasing of the interference. Simulation results shows that the proposed scheme results in better throughput than traditional multi-code CDMA systems.

Modeling and Simulation of CDMA Codes in Scilab

Prior to hardware implementation, simulation is an important step in the study of systems such as Direct Sequence Code Division Multiple Access (DS-CDMA). A useful technique is presented, allowing to model and simulate Linear Feedback Shift Register (LFSR) for CDMA. It uses the Scilab package and its modeling tool for dynamical systems Xcos. PN-Generators are designed for the quadrature-phase modulation and the Gold Code Generator for Global Positioning System (GPS). This study gives a great flexibility in the conception of LFSR and the analysis of Maximum Length Sequences (MLS) used by spread spectrum systems. Interesting results have been obtained, which allow the verification of generated sequences and their exploitation by signal processing tools.

CONVOLUTIONAL CODED DS/CDMA WITH TWO SETS OF ORTHOGONAL SPREADING SEQUENCES AND ITERATIVE DETECTION

In this letter a convolutional coded Direct-Sequence Code-Division Multiple Ac-cess(DS/CDMA) concept is introduced. The number of the users it can accommodate is greater than the spreading factor N. Each of the available orthogonal spreading sequences of length N is assigned to one of the first N users which employ a common Pseudo-Noise (PN) scrambling sequence. When the number of users K exceeds N, say K= N + M with M < N, the M additional users reuse M of those orthogonal spreading sequences but in combination with another PN scrambling sequence. An iterative multistage detection technique aided by Viterbi decoding is used to cancel the interference between the two sets of users when K > N. The proposed technique thus accommodates N users without any mutual interference and a number of additional users almost without signal-to-noise ratio penalty.

THE STUDY OF AN M-ARY MC-CDMA SYSTEM BASED ON CYCLIC SPREADING CODES & PRE-EQUALIZATION

A novel fast despreading scheme for M-ary Multi-Carrier Code-Division Multiple Access (MC-CDMA) system is proposed based on cyclic spreading codes and pre-equalizer. In the transmitter, the M spreading codes of each user are generated by circularly shifting the prototype spreading code. A feedback pre-equalizer is employed to process the M-ary MC- CDMA signal before transmitted. The received signal is multiplied by the Inverse Discrete Fourier Transform (IDFT) result of the mirror image code of the prototype spreading code, and then demodulated by Orthogonal Frequency-Division Multiplexing (OFDM) demodulator. Compared with the conventional M-ary MC-CDMA receiver, the proposed scheme increases bandwidth efficiency, meanwhile, it achieves M-ary despread spectrum and multi-carrier demodulation, which reduces computation complexity remarkably.

CLOSED-FORM SPACE-TIME CHANNEL BLIND ESTIMATION FOR SPACE-TIME CODED MC-CDMA SYTEMS WITH UNIFORM LINEAR ARRAY

This paper proposes a closed-form joint space-time channel and Direction Or Arrival (DOA) blind estimation algorithm for space-time coded Multi-Carrier Code Division Multiple Access (MC-CDMA) systems equipped with a Uniform Linear Array (ULA) at the base station in frequency-selective fading environments. The algorithm uses an ESPRIT-like method to separate multiple co-channel users with different impinging DOAs. As a result, the DOAs for multiple users are obtained. In particular, a set of signal subspaces, every one of which is spanned by the space-time vector channels of an individual user, are also obtained. From these signal subspaces, the space-time channels of multiple users are estimated using the subspace method. Computer simulations illustrate both the validity and the overall performance of the proposed scheme.

基于CDMA-TDOA的室内超声波定位系统

针对国内外对室内定位技术中定位精度不高问题,提出一种基于CDMA(Code Division Multiple Access)-TDOA(Time Difference of Arrival)的室内超声波定位系统,并给出实时性差异等缺点,进行了其工作原理和超声波信号的分析。该系统基于射频和超声波传感器的固有性质,对超声波信号采用CDMA技术进行编码,以便在目标节点上能区分各个信标发来的超声波信号,并结合射频信号实现TDOA测距算法,最终实现三维定位。采用Matlab/Simulink模块对3个信标的超声波信号进行发射仿真与分析。仿真结果表明,该系统在目标节点上能被接收并识别相对应的超声波信号。

基于CDMA技术的无线监控系统的研究与应用

利用CDMA技术,可以完成控制中心对移动终端设备的无线监控,从而实现监控系统的高质量性,高效率性以及高抗干扰性。本文给出了一种基于CDMA技术的无线监控系统方案,主要介绍了这种无线监控系统在警犬机器人中的应用,其中重点讨论了该应用系统的硬件组成以及软件的设计与功能实现。

基于无线CDMA通信的馈线纵联保护研究

提出了一种配电网馈电线路的多断路器间纵联保护方案,在该方案中保护设备之间的通信采用了以公用移动CDMA系统为基础的通信模型。为满足继电保护的选择性、速动性、灵敏性和可靠性的要求,不仅修改了多路通信同步技术以大大降低用户间的干扰,还提出了快速建立通信链接的方案。最后对保护的可靠性和快速性进行了评价,结果表明该方案能够实现馈线保护的全线速动。

基于自调整器的CDMA系统盲自适应干扰抑制

本文给出一种能同时抑制DS CDMA系统多址干扰 (MAI)和窄带干扰 (NBI)的盲自适应算法 .此方法基于遗忘因子具有自调整器的迭代最小二乘算法 (SR RLS) ,根据系统的变化自动调整遗忘因子 ,当系统趋于静态时 ,遗忘因子趋于 1,以提高稳态精度 ,在动态系统中 ,遗忘因子减小 ,使算法能有效的跟踪系统参数 .与其它的迭代最小二乘相比 ,具有较小的稳态误差和良好的动态跟踪能力 .文章从理论上分析了算法的收敛性 .最后 ,对算法在静态环境和动态环境中的性能分别进行了仿真分析 .

基于混沌寻优的CDMA最佳多用户检测方法

混沌运动广泛存在于非线性系统中，它具有遍历性与随机性等优良性质，且在某个域内不可重复的走向每个状态。本文利用混沌的这些优良品质提出了实现码分多址（ＣＤＭＡ）系统上最佳多用户检测的一种混沌寻优方法。计算机模拟表明：我们提出的算法具有能克服多址干扰，能寻优到全局极小点，以及能抑制噪声干扰等优点，这为研究ＣＤＭＡ系统上的最佳多用户检测器开辟了一条新的途径。

基于CDMA-TDMA结合的室内超声波定位方法

采用码分多址(CDMA)方式进行室内超声波定位,其相关运算量较大。针对这一问题,该文提出了基于码分多址-时分多址(CDMA-TDMA)结合的室内超声波定位方法。通过TDMA技术分时段发射经过CDMA编码后的超声波信号,利用到达时间差(TDOA)测距算法计算出未知目标的位置。采用MATLAB进行仿真,仿真试验中对4个信标分两个时间段发送的超声波信号进行发射与接收。结果表明,基于CDMA-TDMA结合的室内超声波定位方法能有效识别出信标节点,同时降低超声波CDMA定位方法中相关运算的计算量。

利用阵列天线的CDMA辐射源雷达目标检测方法

针对码分多址(code division multiple access,CDMA)移动通信网中,一个区域内存在多个CDMA基站以同样的频率发射不同的信号,一般很难确定多个基站的能量强弱和方向,提出一种利用阵列天线的CDMA辐射源雷达目标检测方法。利用级联相消消除各个基站的干扰。首先,通过导频搜索确认每一阶段当前具有最强能量的基站,并给出一种精确测量该基站方向的方法;然后,消去各个天线阵子接收到的该基站干扰,再依次循环进行,将各个基站干扰按能量从大到小依次消除,直到干扰充分消除;最后,进行波束扫描和距离多普勒相关以检测目标。计算机仿真验证了该目标检测方法的有效性。

基于矩阵填充和三阶相关的长短码DS-CDMA信号多伪码盲估计

由于长短码直扩码分多址(LSC-DS-CDMA)信号包含了多个用户的长码和短码,已有的直扩码分多址信号的盲伪码估计方法不再适用。为此该文提出一种基于矩阵填充和三阶相关的伪码估计方法。首先从理论上将结构复杂的LSC-DS-CDMA信号构建为多用户短码扩频的缺失矩阵模型,将复合码矩阵估计建模为盲源信号分离问题;然后将矩阵填充理论应用于复合码矩阵估计,提出基于奇异值阈值算法和快速独立成分分析算法的各用户复合码序列估计方法;最后利用m序列的移位相加性特性,提出延迟三阶相关算法,从各用户复合码序列中估计其包含的长短伪码序列。仿真表明,当信噪比高于-2 d B时,该文算法的长短伪码估计平均误码率低于0.1%。

多径衰落信道下MC-CDMA信号扩频序列周期盲估计

针对多径衰落信道下多载波码分多址(multi-carrier-code division multiple access,MC-CDMA)信号扩频序列周期盲估计问题,提出自相关二阶矩和循环自相关两种算法。通过分析多径衰落信道条件下MC-CDMA信号的自相关二阶矩,估计出MC-CDMA信号的扩频序列周期。通过分析多径衰落信道条件下MC-CDMA信号的循环自相关,估计出MC-CDMA信号的扩频序列周期。最后在不同信道条件下分别对这两种算法进行仿真,并对两种算法的性能进行对比分析。理论和仿真实验表明,在较低信噪比下,循环自相关算法在估计MC-CDMA信号扩频序列周期时具有良好的性能,但自相关二阶矩算法比循环自相关算法计算复杂度低,易于实现。

一类适用于多小区CDMA系统的互补码集

针对多小区码分多址(code division multiple access,CDMA)系统,构造了一类具有大容量和优异相关性能的多子集互补码集。该码集基于循环移位的完美码集和相互正交的传统互补码集,可以获得多个互补码子集,每个子集中码的数目都达到了互补码集的理论界。这些子集内的码具有理想的相关性能,同时子集之间的码具有近似理想的相关性能。将不同的子集分配给多小区CDMA系统中不同的小区,既可以满足大容量用户的需要,也可以有效抑制小区内部和小区之间的干扰。