Performance analysis of multi‐stage interference cancellation for ultra‐wide band multiple‐access communication systems

In this contribution, a novel particle swarm optimization (PSO)‐based multi‐user detector (MUD) aided time‐hopping ultra‐wide band (TH‐UWB) system has been investigated in the multi‐path channel model. In this approach, the PSO‐based MUD employs the output of the Rake receiver as its initial value to search for the best solution which results in a formulated optimization mechanism. By taking advantage of the heuristic values and the collective intelligence of PSO technique, the proposed detector offers almost the same bit error rate (BER) performance as the full‐search‐based optimum MUD does, while greatly reducing the potentially computational complexity. Simulation results have been provided to examine the evolutionary behavior and the detection performance of the proposed PSO‐based MUD in both the additive white Gaussian noise and the multi‐path fading channel. Copyright © 2011 John Wiley & Sons, Ltd.     

Multiuser Detection Based on Adaptive LMS and Modified Genetic Algorithm in DS-CDMA Communication Systems

In this paper, we present an efficient evolutionary algorithm for the multi-user detection (MUD) problem in direct sequence-code division multiple access (DS-CDMA) communication systems. The optimum detector for MUD is the maximum likelihood (ML) detector, but its complexity is very high and involves an exhaustive search to reach the best fitness of transmitted and received data. Thus, there has been considerable interest in suboptimal multiuser detectors with less complexity and reasonable performance. The proposed algorithm is a combination of adaptive LMS Algorithm and modified genetic algorithm (GA). Indeed the LMS algorithm provides a good initial response for GA, and GA will be applied for this response to reach the best answer. The proposed GA reduces the dimension of the search space and provides a suitable framework for future extension to other optimization algorithms. Our algorithm is compared to ML detector, Matched Filter (MF) detector, conventional detector with GA; and Adaptive LMS detector which have been used for MUD in DS-CDMA. Simulation results show that the performance of this algorithm is close to the optimal detector with very low complexity, and it works better in comparison to other algorithms.     

Fuzzy step size least mean square algorithm tuned linearly constrained constant modulus algorithm for multi‐carrier code division multiple access blind multiuser detector

Adaptive fuzzy logic step size least mean square algorithm (FLCLMS) tuning unit is designed to adjust the step size of the linear constrained constant modulus algorithm for blind multiuser detection (MUD) in multi‐carrier code division multiple access (MC‐CDMA) systems is presented. In wireless communications system, the conventional constant modulus algorithm for blind MUD has some disadvantages such as slow convergence speed and phase rotation. To overcome these shortages, a modified constant modulus algorithm was developed for blind multiuser detector. On the basis of the deterministic behavior of the FLCLMS algorithm, it has also proposed simplification over the cost function calculation, obtaining more efficient algorithm and creating new perspective for the MUD implementation. The proposed algorithm ensures the algorithm convergence to the desired user and suppresses the multiple access interference in this cost function. Thus, the performance of the system is improved. The computational experiments show that the proposed FLCLMS not only can find optimal or closed‐to‐optimal solutions but also can obtain the low computation complexity both better and more robust results than existing algorithm reported recently in the literature. Copyright © 2013 John Wiley & Sons, Ltd.     

基于离散粒子群算法的CDMA多用户检测方法

研究了离散粒子群算法，并将其应用于CDMA多用户检测问题，提出一种基于离散粒子群优化算法的CDMA多用户检测的方法。该方法应用一种新的选择和分区搜索的策略，改进搜索的质量和效率。分析以及实验仿真表明该方法具有计算复杂度低且可以得到较好误码率性能的特点，为寻求新的多用户检测方法提供了思路。     

Genetically modified multiuser detection for code division multipleaccess systems

The problem of multiple access interference (MAI) and intersymbol interference (ISI) suppression in code division multiple access (CDMA) systems is considered. By combining the theory of multiuser detection (MUD) and evolutionary computation, a hybrid genetic engine is proposed, suitable for the detection of CDMA signals in the presence of MAI and ISI. The proposed hybrid detector structure can be extended to most multiuser detectors and used as the base detector within the structure. Using random selection, mutation and crossover operators and a unique chromosome structure, the genetic algorithm evolves the base detector to a group of more efficient detectors in terms of bit-error rate performance. First, a new packet-level genetic MUD technique, using a conventional single user detector as the base detector, is proposed for asynchronous CDMA (ACDMA) with negligible ISI. Then the signal-subspace-based minimum mean square error detector is chosen as a base detector and wrapped inside the hybrid genetic engine to evolve to a better structure nearly to eliminate both ISI and MAI. The novelty of the proposed structure is the way the deterministic closed-form solution of the base detector is mapped to a genetic engine resulting in a group of more efficient and adaptive detectors     

Performance of multiuser detectors based on EM-like method for ultra-wideband communications systems in multipath fading channel

An adaptive multiuser detector (MUD) is proposed for direct-sequence ultra-wideband (DS-UWB) multiple access communication systems to suppress both multiple access interference (MAI) and inter-symbol interference (ISI). In this contribution, considering the MUD from a combination viewpoint, we proposed a MUD based on electromagnetism-like (EM) method, which applied the concept of EM search to Hopfield neural network (EMHNN) for solving optimization problems. We analyze the performance of the EMHNN MUD in multipath fading channel, and compare it with the optimum detector and several suboptimum schemes such as conventional, decorrelator detector (DD), minimum-mean-squared error (MMSE) and HNN MUD. Simulation results will demonstrate that the proposed EMHNN MUD, which alleviates the detrimental effects of the MAI problem, can significantly improve the system performance.     

An efficient tabu search for cell planning problem in mobile communication

During the past decades, mobile communication is in the vigorous development, where the cell planning problem (CPP) is one of impressive research issues. CPP has been proved to be NP‐Complete, and many works develop intelligent heuristic search strategies to solve it. Among many factors to affect the cell planning, the major one is the signaling cost, where the location management is critical to the cost. In this paper, we focus on how to tackle CPP such that the signaling cost can be minimized. We adopt a meta‐heuristic iterative search algorithm, Tabu Search (TS), to deal with the cell planning issue for the base station and propose novel designs to improve the TS capability, including initialization and neighbor swap strategy. The simulation results reveal that our TS outperforms traditional TS, genetic algorithms, and several previous works in CPP. Copyright © 2014 John Wiley & Sons, Ltd.     

Memory search multiuser detector in DS/CDMA systems

The optimal multiuser detector (MUD) in DS/CDMA systems requires the solution of a NP-hard combinatorial optimisation problem (COP). A near optimal MUD based on solving the COP with memory search method is proposed. With almost the same computational complexity as the parallel interference cancellation (PIC) MUD, it produces a better performance gain than PIC-MUD     

一种基于可变禁忌长度的多用户检测方法

CDMA系统的性能很大程度上受多用户干扰影响。多用户检测是抑制多用户干扰的有效方法。文中介绍一种基于可变禁忌长度的多用户检测方法。该方法以传统匹配滤波器的判决输出为初始解,采用禁忌长度可变的禁忌搜索(TS)算法,使禁忌长度与搜索空间的崎岖程度相适应,以避免搜索限入局部最优。仿真实验证明,该方法具有较好的误比特性能和抗远近效应能力,并具有多项式复杂度。     

A low complexity multiuser detector for synchronous CDMA system

In a code-division multiple-access (CDMA) system, multiuser detection (MUD) can exploit the information of signals from other interfering users to increase the system capacity. However, the optimum MUD for 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 this paper, we apply a hybrid algorithm to develop a suboptimal MUD strategy. The result of symmetric successive overrelaxation (SSOR) preconditioned conjugate-gradient method is first used to initialize the reduced-complexity recursive (RCR) multiuser detector. Then, RCR algorithm is applied to detect the received data bit by optimizing an objective function in relation with the linear system of decorrelating detector. Simulation results for the synchronous case show that the performance of our proposed SSOR-RCR multiuser detector is promising and outperform the decorrelator and linear minimum mean squared error multiuser detector with lower computational complexity.     

Fast Meta-heuristics for Multiuser Detection in DS-CDMA Systems

In [1], an evolution strategy (ES) multiuser detector was proposed and exhibits good performance. This letter analyzes the search behavior of the ES detector and points out it can be greatly enhanced via a simple technique. A heuristic multiuser detection algorithm is presented, which employs the neighborhood structure characteristics of the optimum multiuser detection (OMD) problem and produces local optima efficiently. A well-chosen perturbation strategy is applied to improve the solution quality in the following step. Simulations results show the meta-heuristic algorithm proposed can find the (near) optimum solution rapidly with lower computational complexity and has better bit error rate (BER) performance.     

A maximum-likelihood bound approaching minimum bit error rate linear multiuser detector for frequency-selective DS-CDMA systems

In this letter, a minimum bit error rate (MBER) linear multiuser detector (MUD) is considered for direct-sequence code-division multiple-access (DS-CDMA) communication systems, distorted by time-varying and frequency-selective multipath fading channels. Based on the approach for finding filter coefficients of the proposed MBER MUD, an efficient Newton method with a barrier parameter is developed. The BER performance of the MBER MUD is compared to other conventional detectors. The study finds that the proposed MBER MUD has more than 2 dB gain over the linear minimum mean-squared error (LMMSE) detector. Furthermore, in the high SNR region, the BER performance of the proposed MBER MUD approaches the performance of the maximum-likelihood (ML) detector.     

Capacity assessment of a cellular radio system using a narrowband multiuser detector

With a narrowband multiuser detector (MUD), multiple users can simultaneously share the same channel without using a bandwidth-expanding signature code when sufficient power differences at the receiver are maintained. In this paper, we assess the capacity gain that can be achieved in a hypothetical cellular system with centralized power control, using a narrowband MUD based on successive cancellation. The power-control algorithm is adapted to multiple users per channel in a cell. Simulation results are presented for two heuristic carrier-to-interference ratio-based channel-assignment schemes. The MUD allows for a substantial capacity gain due to a tighter packing of users in a channel. The observed gain compared with a conventional single user-per-channel system, ranges from 1.4 to 5 for cluster sizes C = 1 and 7, respectively.     

一种适用于TD-SCDMA系统的多用户检测算法

利用逐次干扰抵消多用户检测结构,结合空时RAKE接收机,提出一种空时逐次干扰抵消多用户检测算法.仿真结果表明,该算法相比传统空时RAKE接收机有近5 dB的增益,误码率有了相当的改进.     

基于禁止搜索的非线性时间匹配优化算法

动态时间规整算法DTW(Dynamic Time Warping)作为一种非线性时间匹配技术已成功地应用于语音识别系统中。DTW算法使用动态规划技术来搜索两个时间序列的最优规整路径,虽然这种算法计算量小,运算时间较短,但只是一种局部优化算法。禁止搜索TS(Tabu Search)算法是一种具有短期记忆的广义启发式全局搜索技术,适用于解决许多非线性优化问题。本文将该技术用于语音识别系统中,提出了基于禁止搜索的非线性时间规整的优化算法TSTW,使得时间规整函数尽可能逼近全局最优。仿真结果表明,TSTW比DTW有更高的识别率,且运行时间比遗传时间规整算法GTW大大减少。     

Improved hybrid MMSE detection for turbo-trellis-coded modulation-assisted multi-user OFDM systems

A genetic algorithm assisted minimum mean-square error (MMSE) multi-user detector (MUD) is proposed for a turbo-trellis-coded modulation-based space division multiple access aided orthogonal frequency division multiplexing system. The simulation results show that the system employing the concatenated MMSE-GA MUD was capable of achieving a similar performance to that attained by its optimum counterpart employing the maximum likelihood MUD, while maintaining a significantly lower complexity, especially when supporting a high number of users.     

基于分数低阶统计量的盲多用户检测算法

多用户检测算法是抑制CDMA系统中多址干扰的重要手段,但广泛存在的非高斯信道噪声会降低以往的基于高斯噪声模型假设的算法性能.本文采用α稳定分布作为噪声模型,提出了基于分数低阶统计量的盲多用户检测算法,并对该算法进行了理论分析.仿真和分析表明,该算法具有很好的韧性,同时适用于高斯噪声和脉冲噪声环境.     

Comparing Three Heuristic Search Methods for Functional Partitioning in Hardware–Software Codesign

This paper compares three heuristic search algorithms: genetic algorithm (GA), simulated annealing (SA) and tabu search (TS), for hardware–software partitioning. The algorithms operate on functional blocks for designs represented as directed acyclic graphs, with the objective of minimising processing time under various hardware area constraints. Thecomparison involves a model for calculating processing time based on a non-increasing first-fit algorithm to schedule tasks, given that shared resource conflicts do not occur. The results show that TS is superior to SA and GA in terms of both search time and quality of solutions. In addition, we have implemented an intensification strategy in TS called penalty reward, which can further improve the quality of results.     

基于拟生态优化算法的CDMA多用户检测方法

拟生态优化算法是一类模拟自然生态系统运行机制,求解复杂优化问题的智能计算方法,其中的蚁群算法和粒子群算法是较新出现的两种具有不同特点的方法。该文研究基本蚁群算法和离散粒子群算法,并结合CDMA多用户检测问题,改变算法的搜索机制,提出两种CDMA多用户检测的方法。从理论分析以及实验仿真的角度对比两种方法,表明两种方法的计算复杂度低且可以得到较好误码率性能,同时又各有特点。     

Tabu机--一种新的全局优化神经网络

Ｔａｂｕ搜索是一种极其有效的广义启发式全局搜索技术,已经广泛地用于求解许多领域中的全局优化问题。本文设法构造一种基于Ｔａｂｕ搜索策略的神经网络结构,详细介绍了这种神经网络的各个组成部分,说明了该网络的优缺点。最后,用两个例子检验这种神经网络,证明了它的有效性。