共查询到20条相似文献,搜索用时 15 毫秒
1.
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. 相似文献
2.
This paper introduces a new multiuser detection algorithm based on a gradient guided search that can achieve near-optimum performance while its implementation complexity is linear in the number of users. The new algorithm attempts to perform jointly optimum multiuser detection by updating one user's bit decision each iteration in the best possible way. When a decorrelating multiuser detector is employed to initialize the proposed algorithm, in all cases tested the gradient guided search converges to a solution with performance very close to optimum. Further, tests indicate that the proposed algorithm provides excellent performance for cases where other suboptimum algorithms perform poorly. Although we focus only on synchronous multiuser detection, the algorithm is equally applicable to asynchronous multiuser detection problems 相似文献
3.
针对粒子群优化算法易早熟的问题,提出了一种混合粒子群优化算法(HPSO)。首先在算法中采用惯性权重的分段递减策略,以提高算法的全局搜索能力;然后在算法后期,引入拉伸技术剔除比局部极值大的点,缩小搜索空间,使算法能及时跳出局部最优从而加速收敛,最后提出了基于HPSO算法的多用户检测器。仿真结果表明在信噪比相同的条件下,该多用户检测器的误码率和抗远近效应性能更接近于最佳多用户检测器,有效解决了码分多址通信系统中的多址干扰问题。 相似文献
4.
DS-CDMA无线通信中的最优多用户检测属于NP完备组合优化问题,启发式方法是求解这类问题的有效方法,通过分析最优多用户检测问题的适应值曲面特征,研究设计了系列低计算复杂度、接近最优多用户检测性能的启发式算法.仿真结果表明,基于演化策略的多用户检测算法能够在中等规模用户数情况下提供与最优多用户检测相当的性能,而快速迭代局域搜索算法能够以较低的计算复杂度得到比其他局域搜索算法更好的解. 相似文献
5.
本文提出一种实现码分多址(CDMA)系统上多用户检测(MUD)的禁忌搜索(tabusearch)的方法。 该方法利用传统检测方法的输出作为初始解,直接应用禁忌搜索算法来解决最佳多用户检测的非线性优化组合问题。通过分析以及对同步和异步情况的仿真表明,该方法简单易于实现,具有多项式的计算复杂度,对远近问题不敏感,并且能够得到与最佳检测方法(OD)非常接近的误码率性能和抗多址干扰性能. 相似文献
6.
The powerful iterative algorithm of Turbo code is employed in the proposed iterative multiuser receiver for the downlink of a forward error correction (FEC) coded direct-sequence code-division multiple access (DS-CDMA) environment. The receiver iterates between the 2 coding dimensions, namely the spreading codes and the FEC codes. The optimum iterative multiuser receiver uses the optimum decentralised single-user detector to generate the single-user extrinsic information for the single-user decoders. This paper suggests a near-optimum detector using a folded trellis preselection stage for the multiuser signal detection, in order to reduce the dominating complexity of the optimum decentralised detector. Simulation results show that performance is close to optimum. The effect of the single-user decoders' extrinsic information on the signal detection stage is also investigated and it is found that extrinsic information improves performance. 相似文献
7.
In this paper we present a population declining ant colony optimization (PDACO) multiuser detector for asynchronous CDMA communications.
Ant colony optimization (ACO) algorithms have already been used in multiuser detection in CDMA systems; however, as the pheromone
accumulates, we may not get a global optimum because it stops searching early. PDACO can enlarge searching range through increasing
the initial population of the ant colony, and the population declines in successive iterations. So, the performance of PDACO
is superior with the same computational complexity. PDACO is applied to multiuser detection in asynchronous CDMA systems over
slowly multipath Rayleigh-fading channels in this paper. Via computer simulations it is shown that the performance of PDACO
detector is much better in bit-error rate and near-far effect resistance than conventional detector, ACO detector and genetic
algorithm detector, and is close the optimal multiuser detector. 相似文献
8.
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. 相似文献
9.
We propose a new suboptimum multiuser detector for synchronous and asynchronous multiuser communications. In this approach, a greedy strategy is used to maximize the cost function, the maximum-likelihood (ML) metric. The coefficients of the ML metric are utilized as weights indicating in which order bits can be estimated. The complexity of the algorithm is approximately K/sup 2/ log K per bit, where K is the number of users. We analyze the performance of the greedy multiuser detection in the additive white Gaussian noise channel as well as in the frequency-nonselective Rayleigh fading channel, and compare it with the optimum detector and several suboptimum schemes such as conventional, successive interference cancellation, decorrelator, sequential, and multistage detectors. The proposed greedy approach considerably outperforms these suboptimum schemes, especially for moderate and high loads in low and moderate signal-to-noise ratio regions. The results show that when there is a significant imbalance in the values of the coefficients of the ML metric due to moderate to high noise, fading, and asynchronous transmission, near-optimum performance is achieved by the greedy detection. 相似文献
10.
The prohibitive - exponential in the number of users - computational complexity of the maximum-likelihood multiuser detector for direct-sequence code-division multiple-access communications has fueled an extensive research effort for the development of low-complexity multiuser detection alternatives. We show that we can efficiently and effectively approach the error rate performance of the optimum multiuser detector as follows. We utilize a multiuser zero-forcing or minimum mean-square error (MMSE) linear filter as a preprocessor and we establish that the output magnitudes, when properly scaled, provide a reliability measure for each user bit decision. Then, we prepare an ordered, reliability-based error search sequence of length linear in the number of users; it returns the most likely user bit vector among all visited options. Numerical and simulation studies for moderately loaded systems that permit exact implementation of the optimum detector indicate that the error rate performance of the optimum and the proposed detector are nearly indistinguishable over the whole predetection. signal-to-noise ratio range of practical interest. Similar studies for higher user loads (that prohibit comparisons with the optimum detector) demonstrate error rate performance gains of orders of magnitude in comparison with straight decorrelating or MMSE multiuser detection. 相似文献
11.
本文提出一种基于压缩投影逼近子空间跟踪(PASTd)算法与Kalman滤波算法相结合的盲自适应多用户检测算法.基于本算法,仅使用期望用户的特征波形和定时信息,多用户检测器可以盲获得.仿真实验表明,在多径非频率选择性衰落信道和用户数目变化的动态环境中,本文提出的盲多用户检测算法虽然在计算量上较LMS算法略为提高,但其收敛性能却优于后者,与RLS算法和Kalman滤波算法相比,本文提出的算法具有更低的计算复杂度和更优的收敛性能. 相似文献
12.
A new decorrelator-based neighbour-searching (DENS) multiuser detector is proposed for synchronous CDMA systems. It is shown that the DENS multiuser detector with neighbour-searching radius r=2 can achieve good bit-error-rate performance close to that of an optimum multiuser-detector 相似文献
13.
针对加性高斯白噪声信道下的多用户非正交多脉冲调制系统,提出了基于QR分解的非相干判决反馈多用户检测器。该检测器通过QR分解矩阵变换,利用功率较强用户的判决信息来进行干扰抵消,可以有效消除用户间的多址干扰。而在各用户内,针对多脉冲调制技术,提出了一种线性解相关运算来进行非相干检测。同时,考虑解相关运算中矩阵求逆的复杂度比较高,进一步提出了一种软干扰抵消检测器。仿真结果表明所提的两种多用户检测算法可以有效消除非正交调制所造成的多址干扰,极大地提高功率较弱用户的性能,并且所提软干扰抵消检测器通过避免矩阵求逆降低了计算复杂度,同时检测性能没有损失。 相似文献
14.
A novel multiuser code division multiple access (CDMA) receiver based on genetic algorithms is considered, which jointly estimates the transmitted symbols and fading channel coefficients of all the users. Using exhaustive search, the maximum likelihood (ML) receiver in synchronous CDMA systems has a computational complexity that is exponentially increasing with the number of users and, hence, is not a viable detection solution. Genetic algorithms (GAs) are well known for their robustness in solving complex optimization problems. Based on the ML rule, GAs are developed in order to jointly estimate the users' channel impulse response coefficients as well as the differentially encoded transmitted bit sequences on the basis of the statistics provided by a bank of matched filters at the receiver. Using computer simulations, we showed that the proposed receiver can achieve a near-optimum bit-error-rate (BER) performance upon assuming perfect channel estimation at a significantly lower computational complexity than that required by the ML optimum multiuser detector. Furthermore, channel estimation can be performed jointly with symbol detection without incurring any additional computational complexity and without requiring training symbols. Hence, our proposed joint channel estimator and symbol detector is capable of offering a higher throughput and a shorter detection delay than that of explicitly trained CDMA multiuser detectors 相似文献
15.
The large scale multiuser multiple input multiple output (MU-MIMO) is one of the promising communication technology for 5G wireless networks as it offers reliability, high spectral efficiency and high throughput. The lattice reduction (LR) precoding based user level local likelihood ascent search (ULAS) detection scheme is proposed in this paper for efficient signal detection in large scale MU-MIMO system. The initial solution of ULAS algorithm is obtained from the LR precoding assisted zero forcing detector. The LR precoding transforms the non-orthogonal channel matrix into nearly orthogonal channel, which helps to mitigate inter antenna interference (IAI) exists at each user. The remaining multiuser interference (MUI) imposed to each user from undesired users is cancelled by the proposed ULAS multiuser detection scheme. Thus, the proposed LR precoding assisted ULAS mitigates both IAI and MUI unlike the classical detector, those try to moderate either IAI or MUI. By contrast, the proposed ULAS detector provides performance close to optimal maximum likelihood detector with just a fraction of its complexity. 相似文献
16.
根据矩阵的Cholesky分解原理和并行运算的思想,提出了基于分组并行最大似然检测的多用户信号检测器。这种检测器的特点是:1.“化整为零”,即将全体用户信号检测转化为多组部分用户信号检测;2.“相互并行”,即各组部分用户信号检测过程相互并行。计算机体育场结果表明:这种检测器的性能接近最佳多用户信号检测器的性能。 相似文献
17.
We introduce a multiuser receiver based on the Kalman filter, which can be used for joint symbol detection and channel estimation. The proposed algorithm has the advantage of working even when the spreading codes used have a period larger than one symbol interval (“long codes”), unlike adaptive equalizer-type detectors. Simulation results which demonstrate the performance advantage of the proposed receiver over the conventional detector, the minimum mean squared error (MMSE) detector and a recursive least squares (RLS) multiuser detector are presented. A thorough comparison of the MMSE detector and the proposed detector is attempted because the Kalman filter also solves the MMSE parameter estimation problem, and it is concluded that, because the state space model assumed by the Kalman filter fits the code division multiple access (CDMA) system exactly, a multiuser detector based on the Kalman filter must necessarily perform better than a nonrecursive, finite-length MMSE detector. The computational complexity of the detector and its use in channel estimation are also studied 相似文献
18.
A new multiuser detection scheme based on signal subspace estimation is proposed. It is shown that under this scheme, both the decorrelating detector and the linear minimum-mean-square-error (MMSE) detector can be obtained blindly, i.e., they can be estimated from the received signal with the prior knowledge of only the signature waveform and timing of the user of interest. The consistency and asymptotic variance of the estimates of the two linear detectors are examined. A blind adaptive implementation based on a signal subspace tracking algorithm is also developed. It is seen that compared with the previous minimum-output-energy blind adaptive multiuser detector, the proposed subspace-based blind adaptive detector offers lower computational complexity, better performance, and robustness against signature waveform mismatch. Two extensions are made within the framework of signal subspace estimation. First, a blind adaptive method is developed for estimating the effective user signature waveform in the multipath channel. Secondly, a multiuser detection scheme using spatial diversity in the form of an antenna array is considered. A blind adaptive technique for estimating the array response for diversity combining is proposed. It is seen that under the proposed subspace approach, blind adaptive channel estimation and blind adaptive array response estimation can be integrated with blind adaptive multiuser detection, with little attendant increase in complexity 相似文献
19.
为了解决CDMA系统最佳多用户检测的高计算复杂度问题,基于免疫克隆选择理论和新的遗传量子算法,该文提出了免疫克隆量子算法。该算法把根据神经网络制作的疫苗接种到克隆量子算法的每一代中,通过接种疫苗到CQA中,可以加快CQA的收敛速度减少计算复杂度。另外,CQA所提供的好的初值可以改善疫苗的性能,接种的疫苗还改善了CQA的性能,文中给出了在免疫克隆量子算法中使用随机神经网络制作疫苗的统一理论框架结构。仿真结果证明了该方法不仅能够快速收敛到全局最优解,并且无论抗多址干扰能力和抗远近效应能力都优于传统检测器和一些应用以前智能计算算法的多用户检测器。 相似文献
20.
针对STBC-MIMO MC-CDMA多用户检测方法存在计算复杂度高、工程实现困难的问题,提出利用一种混合量子进化算法(HQEA)解决STBC-MIMO MC-CDMA多用户检测问题,该算法不仅具有较低的计算复杂度,而且解决了量子进化算法容易陷入局部最优解、参数个数较多和通过查表来更新量子门的问题。仿真表明,该算法在STBC-MIMO MC-CDMA系统多用户检测问题上,具有比其他智能算法更强的跳出局部最优和寻找全局最优的能力。 相似文献
|