一种带预处理的多用户检测器

本文提出了一种带预处理的多用户检测器.其预处理器是通过二进制二次规划问题的全局最优性条件得到的.本文的预处理器只用很小的计算量就可以判断出大部分用户的信息码,而且可以保证通过预处理得到的部分用户的信息码与最佳多用户检测得到的结果相同.因为由预处理得到的用户的信息码已经是全局最优的,所以我们就可以将其从原多用户检测问题中剔除,进而得到一个相对小规模的多用户检测问题.与原问题相比,这个小规模的多用户检测问题的多址干扰减小了,然后可以用一些常用的多用户检测器来求解这个小规模的多用户检测问题.     

Lagrangian乘子法在多用户检测中的应用

将二进制二次规划问题连续化为一个带等式约束的二次规划问题,借助于求解等式约束的Lagrangian乘子法,推导出Lagrangian乘子与用户信息码及信道噪声之间的关系.同时,根据多用户检测问题的特殊性,还给出了估计Lagrangian乘子的方法,进而得到了一种新的多用户检测器.仿真结果表明,新算法的误码率与最佳多用户检测器大致相同,低于一般的次最优多用户检测器.     

一种新的低复杂度空间调制信号检测算法

空间调制技术(SM)作为一种新颖的多天线传输方案,近年来受到业界的广泛注意。它将输入信息比特分为两部分,一部分用于激活天线,另一部分用于信号调制,来共同承载发送信息。由于SM系统的最大似然(ML)最优检测算法需要穷举搜索激活天线序号和发送的数字调制符号的所有可能情况,它的检测复杂度很高。为此,人们相继提出了一些简化算法。与这些算法思路不同,本文从传统ML最优表达式出发,引入极坐标得到关于星座点幅度和相角的ML等价表达式,同时根据星座点相角的分布特性对相角进行近似,得到了一种新的次最优检测算法。新算法的检测性能比其他次优算法更接近ML,而且计算复杂度低。最后本文通过计算机仿真,验证了新算法的有效性。      

4×4 V-BLAST系统分组最大似然检测算法

对于V-BLAST系统的检测,最大似然(ML)算法有着最优的性能却也有最大的计算复杂度;经典的排序连续干扰抵消(OSIC)算法复杂度较低,但数值稳定性差,且性能与ML差距较大.因此,本文基于检测性能和计算复杂度折中的思想,针对4×4 V-BLAST系统提出了一种分组最大似然(Group ML,GML)检测算法,在保证较好检测性能的基础上,通过将四维ML检测器分成两组二维ML检测器来降低计算复杂度.此外,本文还提出了一种简化的最大似然(Simpli-fled ML,SML)检测算法,通过将每组中的二维ML检测器的搜索空间从二维降至一维,进一步降低了计算复杂度,并证明其与ML算法具有一致的性能.仿真表明,在误符号率为10~(-3)时GML算法相比OSIC算法有约7dB的性能提升.经分析知.GML算法复杂度与ML-OSIC算法相比在高阶调制方式下有着显著的降低,易于硬件实现.     

基于改进入侵杂草算法的多用户检测

由于用户的扩频序列不能时刻保持完全正交,DS-CDMA系统中不可避免地存在多址干扰。为了有效抑制多址干扰,通过映射函数将入侵杂草优化算法中父代杂草的扩散距离转换成二进制杂草的变异概率,提出基于入侵杂草优化算法的多用户检测器。针对算法的收敛速度慢和寻优精度低的问题,提出基于正切函数的正态分布标准差变化曲线。通过仿真验证了利用所提算法解决多用户检测问题的有效性,并与传统检测器、解相关检测器以及基于基本遗传算法和基本粒子群算法的多用户检测器进行了比较。仿真结果表明,该方法的性能接近最优解,且收敛速度更快。     

MIMO系统中一种改进的ZF-OSIC信号检测算法

为了寻找一个可靠性较高且复杂度较低的多输入多输出(Multiple Input Multiple Output,MIMO)检测算法,文中基于MIMO系统中传统的排序的迫零串行干扰抵消ZF-OSIC(Zero Forcing-Ordered Successive Interference Cancellation,ZF-OSIC)以及最大似然ML(Maximum Likelihood,ML)信号检测算法,提出一种将两种传统算法相结合的新算法,ZF-OSIC K-correction检测算法,该算法综合了二者的优点。运用ML算法中的枚举思想来选择性地修正ZF-OSIC算法得到的检测结果,从而在算法复杂度增加不大的情况下,得到性能的改善,准确度更加逼近ML算法。     

一种基于MIMO的改进型信号检测K-Best算法

MIMO 是一种显著降低未来塔康(TACAN)导航系统的信号检测的误码率的技术。 最大似然算法(ML)是 MIMO 无线系统的最佳硬判决检测方式,但是其会随着天线数目和调制阶数的增加,其复杂度呈指数规律增加。传统 K-Best 算法虽克服 ML 算法的缺点,降低了检测算法的计算复杂度,节约计算成本,但其 BER 性能略有下降。改进型 K-Best 算法采用最优检测快速 QR 分解、预处理技术(SE)和球型译码技术(SDA)检测手段克服传统 K-Best 算法的缺点。 仿真结果表明改进型 K-Best 算法相对于传统算法,明显提高了 BER 性能。     

一种低副瓣稳健自适应波束算法

本文提出一种新型低副瓣自适应波束形成算法,解决了传统自适应波束形成器在干扰和高信噪环境下算法性能急剧下降的问题,并降低了快拍数对算法稳健性的影响。该算法基于标准Capon波束形成器,利用消除空域噪声的方法提高期望矢量的重估精度,并结合功率估计算法重构出干扰噪声协方差矩阵;然后使用特征干扰相消算法二次重构噪声协方差矩阵得到最优权值,增强算法在低样拍下的稳定性;最后对最优权值进行切比雪夫加权和二次约束实现了零陷加宽。仿真实验结果表明：新算法计算量小,旁瓣电平低,降低了在干扰运动和导向矢量失配时快拍数和信噪比对性能的影响。     

基于±1二次规划的低复杂度球形解码算法

从MIMO检测的±1二次规划模型出发,推导了最大似然MIMO检测最优解的必要条件。在此基础上提出了一种基于必要条件的球形解码改进算法,该算法在球形解码剪枝策略的基础上利用必要条件对树型搜索的节点进行进一步剪枝,从而明显降低了运算复杂度,而不降低球形解码检测算法的误比特率性能。     

车间物流问题的布谷鸟算法

根据车间物流问题的特点建立了数学模型。设计了一种布谷鸟算法来求解问题。设计并生成了小规模的算例来验证布谷鸟算法的有效性。采用用于求解优化问题的软件CPLEX来求得各算例的全局最优解,并将其与布谷鸟算法得到的解对比。结果表明,布谷鸟算法能对小规模算例求得全局最优解,说明布谷鸟算法对该问题是有效的。     

Symbol detection in spatial multiplexing system using particle swarm optimization meta-heuristics

Symbol detection in multi-input multi-output (MIMO) communication systems using different particle swarm optimization (PSO) algorithms is presented. This approach is particularly attractive as particle swarm intelligence is well suited for real-time applications, where low complexity and fast convergence is of absolute importance. While an optimal maximum likelihood (ML) detection using an exhaustive search method is prohibitively complex, PSO-assisted MIMO detection algorithms give near-optimal bit error rate (BER) performance with a significant reduction in ML complexity. The simulation results show that the proposed detectors give an acceptable BER performance and computational complexity trade-off in comparison with ML detection. These detection techniques show promising results for MIMO systems using high-order modulation schemes and more transmitting antennas where conventional ML detector becomes computationally non-practical to use. Hence, the proposed detectors are best suited for high-speed multi-antenna wireless communication systems. Copyright © 2008 John Wiley & Sons, Ltd.     

广义空间调制系统的正则化OMP检测算法

在广义空间调制（GSM）系统中,最大似然（ML）检测可以取得最优的检测性能,然而其计算复杂度随激活天线数的增加急剧增长。针对这一问题,提出了一种基于稀疏重构理论的低复杂度检测算法——正则化正交匹配追踪（ROMP）算法。该算法首先根据信道矩阵和当前残差的内积选取多个候选激活天线索引,接着对候选天线索引按正则化标准进行可靠性验证,剔除错误索引,缩小信号的搜索空间,最后通过求解最小二乘问题估计信号。仿真结果表明,与经典的正交匹配追踪（OMP）算法相比,所提算法以少许复杂度的增加为代价极大提升了检测性能,能够在检测性能与复杂度之间取得更好的折中。     

An application of univariate marginal distribution algorithm in MIMO communication systems

The paper discusses a sequence detector based on univariate marginal distribution algorithm (UMDA) that jointly estimates the symbols transmitted in a multiple input multiple output (MIMO) communication system. While an optimal maximum likelihood detection using an exhaustive search method is prohibitively complex, it has been shown that sphere decoder (SD) achieves the optimal bit error rate (BER) performance with polynomial time complexity for smaller array sizes. However, the worst‐case complexity of SD is exponential in the problem dimensions, this brings in question its practical implementation for larger number of spatial layers and for higher‐order signal constellation. The proposed detector shows promising results for this overly difficult and complicated operating environment, confirmed through simulation results. A performance comparison of the UMDA detector with SD is presented for higher‐order complex MIMO architectures with limited average transmit power. The proposed detector achieves substantial performance gain for higher‐order systems attaining a near optimal BER performance with reduced computational complexity as compared with SD. Copyright © 2009 John Wiley & Sons, Ltd.     

A Simplified Maximum Likelihood Detector with the Aid of Reduced-Size Searching Set for MIMO Systems

In this paper, a simplified maximum likelihood (ML) detector is proposed for multi-input multi-output (MIMO) systems over the Rayleigh flat-fading channels. The main idea of the proposed method is to pre-construct a reduced-size searching set for the optimal ML detection to reduce its computational load without significant performance loss. This can be done by a two-stage searching algorithm combined with the ordered successive interference cancellation scheme. Computer simulations show that with an adequate size of searching set, the proposed simplified ML detection can outperform the conventional MIMO detectors and achieve the same performance as that of the optimal ML detection.     

Zero forcing based sphere decoder for generalized spatial modulation systems

To reduce the number of radio frequency (RF) chains in multiple input multiple output (MIMO) systems, generalized spatial modulation (GSM) techniques have been proposed in the literature. In this paper, we propose a zero‐forcing (ZF)‐based detector, which performs an initial pruning of the search tree that will be considered as the initial condition in a sphere decoding (SD) algorithm. The proposed method significantly reduces the computational complexity of GSM systems while achieving a near maximum likelihood (ML) performance. We analyze the performance of the proposed method and provide an analytic performance difference between the proposed method and the ML detector. Simulation results show that the performance of the proposed method is very close to that of the ML detector, while achieving a significant computational complexity reduction in comparison with the conventional SD method, in terms of the number of visited nodes. We also present some simulations to assess the accuracy of our theoretical results.     

A simple low-complexity algorithm for generalized spatial modulation

Generalized spatial modulation (GSM) is an extension of spatial modulation which is significant for the next generation communication systems. Optimal detection process for the GSM is the maximum-likelihood (ML) detection which jointly detects the antenna combinations and transmitted symbols. However, the receiver is much more complicated than SM due to inter-antenna interference and/or increased number of combinations. Therefore, the computational complexity of the ML detection grows with the number of transmit antennas and the signal constellation size. In this letter, we introduce a novel and simple detection algorithm which uses sub-optimal method based on the least squares solution to detect likely antenna combinations. Once the antenna indices are detected, ML detection is utilized to identify the transmitted symbols. For obtaining near-ML performance while keeping lower complexity than ML detection, sphere decoding is applied. Our proposed algorithm reduces the search complexity while achieving a near optimum solution. Computer simulation results show that the proposed algorithm performs close to the optimal (ML) detection resulting in a significant reduction of computational complexity.     

二进制猫群算法在大规模MIMO天线选择中的应用

在多输入多输出(MIMO)系统中,天线选择技术平衡了系统的性能和硬件开销,但大规模MI-MO系统收发端天线选择复杂度问题一直没有得到很好的解决.基于信道容量最大化的准则,采用两个二进制编码字符串分别表示发射端和接收端天线被选择的状态,提出将二进制猫群算法(BCSO)应用于多天线选择中,以MIMO系统信道容量公式作为猫群的适应度函数,将收发端天线选择问题转化为猫群的位置寻优过程.建立了基于BCSO的天线选择模型,给出了算法的实现步骤.仿真结果表明所提算法较之于基于矩阵简化的方法、粒子优化算法具有更好的收敛性和较低的计算复杂度,选择后的系统信道容量接近于最优算法,非常适用于联合收发端天线选择的大规模MIMO系统中.     

MIMO Transmit Beamforming Under Uniform Elemental Power Constraint

We consider multi-input multi-output (MIMO) transmit beamforming under the uniform elemental power constraint. This is a nonconvex optimization problem, and it is usually difficult to find the optimal transmit beamformer. First, we show that for the multi-input single-output (MISO) case, the optimal solution has a closed-form expression. Then we propose a cyclic algorithm for the MIMO case which uses the closed-form MISO optimal solution iteratively. The cyclic algorithm has a low computational complexity and is locally convergent under mild conditions. Moreover, we consider finite-rate feedback methods needed for transmit beamforming. We propose a simple scalar quantization method, as well as a novel vector quantization method. For the latter method, the codebook is constructed under the uniform elemental power constraint and the method is referred as VQ-UEP. We analyze VQ-UEP performance for the MISO case. Specifically, we obtain an approximate expression for the average degradation of the receive signal-to-noise ratio (SNR) caused by VQ-UEP. Numerical examples are provided to demonstrate the effectiveness of our proposed transmit beamformer designs and the finite-rate feedback techniques.     

Soft quasi-maximum-likelihood detection for multiple-antenna wireless channels

The paper addresses soft maximum-likelihood (ML) detection for multiple-antenna wireless communication channels. We propose a soft quasi-ML detector that maximizes the log-likelihood function by deploying a semi-definite relaxation (SDR). Given perfect channel state information at the receiver, the quasi-ML SDR detector closely approximates the performance of the optimal ML detector in both coded and uncoded multiple-input, multiple-output (MIMO) channels with quadrature phase-shift keying (QPSK) modulation and frequency-flat Rayleigh fading. The complexity of the quasi-ML SDR detector is much less than that of the optimal ML detector, thus offering more favorable performance/complexity characteristics. In contrast to the existing sphere decoder, the new quasi-ML detector enjoys guaranteed polynomial worst-case complexity. The two detectors exhibit quite comparable performance in a variety of ergodic QPSK MIMO channels, but the complexity of the quasi-ML detector scales better with increasing number of transmit and receive antennas, especially in the region of low signal-to-noise ratio (SNR).