多径CDMA信道下基于指数加权最小二乘盲空时多用户检测

本文首先在码片匹配滤波的基础上为多径CDMA信道下的接收机提出四种数据选择方案，分析了各种数据方案对多址干扰与码间干扰的影响；接着提出了基于Rosen梯度投影实现的指数加权最小二乘盲空时多用户检测方法并分析了四种数据选择方案对其运算复杂度的影响；最后通过仿真实验结果表明：本文所提出盲空时多用户检测方法在运算量、收敛速度以及接收性能具有一定的优势。     

基于新的数据选择方案下的盲空时多用户检测

该文首先在码片匹配滤波的基础上提出4种数据选择方案，分析了各种数据方案对多址干扰与字符间干扰的影响；接着提出了基于Rosen梯度投影实现的最小均方和最小二乘两种盲空时多用户检测方法，并分析了4种数据选择方案对这两种检测方法运算复杂度的影响；最后通过仿真实验结果的分析比较给出较合理的实现方法，该方法在运算量，收敛速度和性能上具有一定的优势，因而更加具有实用意义。     

多径CDMA信道下一种改进的RLS空时接收机

该文首先在码片匹配滤波的基础上提出一种次优的数据选择方案,并分析了它对多址干扰与字符间干扰的影响;接着在此基础上提出了基于约束RLS的盲空时多用户检测算法,最后通过仿真实验验证了所提出的方法的有效性。     

大多普勒下基于FFT伪码捕获技术研究

在直接序列扩频通信中,伪码的捕获一般是通过相关运算来实现的,对于具有大多普勒频移的直接序列扩频信号,采用传统的伪码捕获方法,捕获时间将会很长,同时运算量也非常大。为了实现伪码的快速捕获,研究了一种基于FFT的伪码并行捕获算法。针对伪码长度不是2的整数次幂和存在数据跳变的问题,提出一种改善方法。计算机仿真结果表明：该方法既能满足FFT快速运算的要求又能消除数据跳变的影响,从而提高了基于FFT的伪码并行捕获性能。     

SC-FDE系统的一种新型判决反馈均衡器

针对单载波频域均衡系统MMSE均衡器存在残留码间干扰的缺点,提出MMSE-RISIC判决反馈均衡器消除残留码间干扰.MMSE-RISIC均衡器采用传统MMSE均衡后的判决数据,对残留码间干扰进行估计并消除.残留码间干扰的估计主要采用FFT和IFFT运算,与其他方法相比计算量较小.对该均衡器在不同信道下进行了计算机仿真,结果表明,在频率选择性衰落信道条件下,系统性能有了较为明显的提高.     

一种新的基站空域协作干扰抑制方案

这里提出了1种新的基站空域协作干扰抑制方案,该方案根据用户受到干扰的不同情况,动态地对相邻小区基站进行划分成簇.同时对所提出的方案在不同预编码算法和不同发送天线数目的条件下用Matlab软件进行仿真验证,其中,预编码算法的选择需要根据系统性能需求和实现的复杂度进行权衡.仿真结果表明所提出的动态协作簇小区间干扰抑制方案可...     

无人机宽带数据链信道均衡技术研究

信道均衡技术是解决无人机宽带数据链码间干扰问题的关键技术之一。针对无人机宽带数据链的信道特点,在分析单载波频域均衡(SC-FDE)的基础上,提出一种时域、频域相结合的信道均衡方案,相比于SC-FDE,可以有效降低数据帧较长情况下均衡处理的整体实现复杂度。对该方案进行了仿真,结果表明,该方案可以有效抑制多径效应产生的码间干扰,具有很好的鲁棒性。基于FPGA数字信号处理平台进行了软件设计,验证了其工程应用的可行性。     

功率监测与SQM融合的GNSS欺骗干扰检测

欺骗干扰严重危害全球卫星导航系统（Global Navigation Satellite System,GNSS）的安全运行，导致位置、速度和时间信息出现错误。信号质量监测（Signal Quality Monitoring,SQM）方法实施过程简单，检测性能好，受到国内外学者广泛关注。Ratio检测量是SQM的一种经典检测量，其通过检测相关峰异常升高或平缓实现欺骗检测，被普遍应用。所提的功率监测与SQM融合（Power Combined with SQM,PCS）的欺骗检测算法在Ratio检测量的基础上改进，通过对早码、即时码和晚码的相关输出作和差运算，实现跟踪环相关输出信号功率与质量的同时监测，且可消除载波相位误差影响。利用美国得州大学的得州欺骗测试电池（Texas Spoofing Test Battery,TEXBAT）中级欺骗干扰数据集第四条功率匹配干扰数据进行实验分析，实验结果表明，与Ratio检测量和绝对功率监测相比，PCS检测量融合两者优势，检测性能更优；且PCS检测量的输出结果能够更好地体现欺骗干扰引起的信号功率变化，进而反映了干扰实施过程，并实现了更早发现欺骗干扰。     

一种DS/SS信号PN码序列估计的神经网络方法

本文提出了一种利用神经网络(N.N.)完成直接序列扩频(DS/SS)信号PN(伪噪声码)码序列估计的新方法.该方法充分利用了无监督N.N.的自适应主元提取特性,加上其高速运算能力,解决了传统方法在PN码的实时处理及实现上的困难,理论分析和数值结果表明了本方案能在较低的输入信噪比条件下完成对PN码的正确估计.     

GNSS信号数据/导频扩频码配对优化方法

为了提高载波相位跟踪的稳健性和伪码跟踪精度,现代全球卫星导航系统(Global Navigation Satellite System,GNSS)普遍采用数据/导频并存的信号结构。针对数据/导频信号的互相关性影响码跟踪性能的问题,提出了一种数据/导频扩频码配对优化方法。优化准则是:在一定的超前减滞后间距条件下,单独跟踪导频信号时通道内互相关干扰导致的码跟踪平均误差最小。以全球定位系统(Global Positioning System,GPS)L1C频点信号为例,基于接口控制文件(Interface Control Document,ICD)给出的扩频码族,进行了数据/导频扩频码的配对优化设计,并仿真对比了不同配对方案的码跟踪性能。分析结果表明,优化后的配对方案能有效削弱数据/导频通道内的互相关干扰,提高导航信号的码跟踪性能。     

A reduced-complexity maximum-likelihood method for multiuser detection

Multiuser or joint detection has recently been receiving significant research interest because of its potential for the significant increase in system capacity and performance. Among the conventional multiuser detection schemes such as the minimum mean-squared error and successive interference cancellation-based ones, maximum-likelihood multiuser detection has the best system performance. However, the complexity of maximum-likelihood detection (MLD) increases exponentially in the number of users and constellation size. In this paper, a low-complexity MLD scheme based on the use of a sensitive-bits algorithm is proposed. It is demonstrated that the proposed method can greatly reduce the computational complexity with a minimal penalty in performance compared with the exhaustive optimal MLD scheme.     

Iterative Multiuser Detection for Single-Carrier Modulation with Frequency-Domain Equalization

In this letter, we propose a new multiuser detection scheme for single-carrier modulation with frequency-domain equalization (SC-FDE). We first present mathematical formulations of multiuser detection for the SC-FDE system with user- specific interleaving. The proposed structure employs spreader and different interleaver for each user at the transmitter, and re moves multiuser interference with an iterative detection method in the frequency domain at the receiver. Simulation results show that the proposed scheme outperforms the interleave- division multiple-access (IDMA) scheme in the block error rate even for severely frequency-selective channel, while providing considerably lower computational complexity.     

Iterative space-time processing for multiuser detection in multipath CDMA channels

Space-time processing and multiuser detection are two promising techniques for combating multipath distortion and multiple-access interference in code division multiple access (CDMA) systems. To overcome the computational burden that rises very quickly with increasing numbers of users and receive antennas in applying such techniques, iterative implementations of several space-time multiuser detection algorithms are considered here. These algorithms include iterative linear space-time multiuser detection, Cholesky iterative decorrelating decision-feedback space-time multiuser detection, multistage interference canceling space-time multiuser detection, and expectation-maximization (EM)-based iterative space-time multiuser detection. A new space-time multiuser receiver structure that allows for efficient implementation of iterative processing is also introduced. Fully exploiting various types of diversity through joint space-time processing and multiuser detection brings substantial gain over single-receiver-antenna or single-user-based methods. It is shown that iterative implementation of linear and nonlinear space-time multiuser detection schemes discussed in this paper realizes this substantial gain and approaches the optimum performance with reasonable complexity. Among the iterative space-time multiuser receivers considered in this paper, the EM-based (SAGE) iterative space-time multiuser receiver introduced here achieves the best performance with excellent convergence properties.     

Selective Multiuser Detection for Cellular CDMA Systems

Multiuser detection-oriented CDMA systems have been anticipated to significantly improve system capacity in third-generation W-CDMA-based systems. However, they are greatly limited by the computational complexity of multiuser receivers. In this work, we propose a new, computationally efficient approach to multiuser detection (MUD), consisting in MUD of the subset of preselected users, and conventional detection of the rest of users, called selective multiuser detection (SMD). It allows for full exploitation of available processing power at the receiver by use of MUD and provides remedy for computational complexity of MUD techniques when the number of active users increases beyond the processing capability. We propose and examine three different criteria for selection of users to be processed by the multiuser receiver and analyze the capacity for the single-cell and the multicell CDMA cellular system. The capacity improvement with respect to the conventional CDMA detector combines the gain from MUD and reduction of other-cell interference. We apply the analysis to two SMD schemes using decorrelator and successive interference canceller (SIC) as the multiuser receiver. The results indicate that the SMD is a promising alternative for MUD-oriented CDMA systems with large numbers of active users.     

A New Algorithm for Optimum Multiuser Detection in Synchronous CDMA Systems

Optimum multiuser detection for Code Division Multiple Access (CDMA) systems requires the solution of an NP-hard combinatorial optimization problem. It is well known that the computational complexity of the optimum multiuser detector is exponential with the number of active users in the system. In order to reduce the complexity of the optimum multiuser detection, we propose a Reduced Complexity Maximum Likelihood (RCML) algorithm that includes a set of novel certain boundary rules and characteristics. We investigate the performance and complexity tradeoffs for the RCML algorithm by conducting a set of simulations; Maximum Likelihood (ML) detection as a reference for performance comparisons, and relaxation based Semidefinite Programming (SDPB) algorithm as a reference for complexity comparisons. We show that the RCML algorithm is a promising algorithm for its computational savings over relaxation based algorithms in lightly-to-moderately loaded CDMA systems, and for its optimality in highly loaded CDMA systems.     

Hybrid SNR-Adaptive Multiuser Detectors for SDMA-OFDM Systems

Multiuser detection (MUD) and channel estimation techniques in space-division multiple-access aided orthogonal frequency-division multiplexing systems recently has received intensive interest in receiver design technologies. The maximum likelihood (ML) MUD that provides optimal performance has the cost of a dramatically increased computational complexity. The minimum mean-squared error (MMSE) MUD exhibits poor performance, although it achieves lower computational complexity. With almost the same complexity, an MMSE with successive interference cancellation (SIC) scheme achieves a better bit error rate performance than a linear MMSE multiuser detector. In this paper, hybrid ML-MMSE with SIC adaptive multiuser detection based on the joint channel estimation method is suggested for signal detection. The simulation results show that the proposed method achieves good performance close to the optimal ML performance at low SNR values and a low computational complexity at high SNR values.     

一种改进的子空间盲多用户检测法

本文在常规子空间盲多用户检测方法的基础上进行改进,提出一种改进的子空间盲多用户检测方法.既考虑小区内用户的干扰,也考虑来自小区外用户的干扰,将接收信号空间可以分解成三个子空间,通过对子空间模型的修改和子空间跟踪算法的改进,解决快速矩阵分解的问题,降低接收机的复杂度,在收敛速度、稳定性方面也有所提高.     

最优多用户检测问题研究

DS-CDMA无线通信中的最优多用户检测属于NP完备组合优化问题,启发式方法是求解这类问题的有效方法,通过分析最优多用户检测问题的适应值曲面特征,研究设计了系列低计算复杂度、接近最优多用户检测性能的启发式算法.仿真结果表明,基于演化策略的多用户检测算法能够在中等规模用户数情况下提供与最优多用户检测相当的性能,而快速迭代局域搜索算法能够以较低的计算复杂度得到比其他局域搜索算法更好的解.     

Blind Adaptive Multiuser Detection for the MC‐CDMA Systems Using Orthogonalized Subspace Tracking

In this paper, we study the performance of subspace‐based multiuser detection techniques for multicarrier code‐division multiple access (MC‐CDMA) systems. We propose an improvement in the PASTd algorithm by cascading it with the classical Gram‐Schmidt procedure to orthonormalize the eigenvectors after their sequential extraction. The tracking of signal subspace using this algorithm, which we call OPASTd, has a faster convergence as the eigenvectors are orthonormalized at each discrete time sample. This improved PASTd algorithm is then used to implement the subspace blind adaptive multiuser detection for MC‐CDMA. We also show that, for multiuser detection, the complexity of the proposed scheme is lower than that of many other orthogonalization schemes found in the literature. Extensive simulation results are presented and discussed to demonstrate the performance of the proposed scheme.