共查询到19条相似文献,搜索用时 156 毫秒
1.
2.
TD-SCDMA集群系统中会存在各种干扰,一些通过抑制干扰提高系统容量的技术被考虑采纳,如智能天线、多用户检测和功率控制等。传统的功控算法无法消除来自集群群组间的用户干扰。先用波束赋形进行主波瓣外干扰抑制,然后进行多群组联合检测消除波瓣内群组间干扰,从而降低系统对功率控制的要求,提高性能。仿真证明,上述算法能有效降低系统发射功率和抑制干扰。 相似文献
3.
针对多用户蜂窝网络的下行链路,提出了基于干扰图的干扰对齐算法。首先用干扰图表示蜂窝网络的小区间干扰(ICI)分布,每五个相邻小区划分为一簇。然后在簇内先根据对称信道和不对称信道,分别设计接收波束赋形矩阵将四个ICI对齐到两个干扰子空间,再设计发送波束赋形矩阵与干扰子空间正交。最后通过簇的平移实现蜂窝网络内所有活动小区的干扰对齐。该算法减少了基站和用户的天线数及计算复杂度。仿真结果表明所提算法消除了ICI、用户间干扰(IUI)及簇间干扰,有效提高了蜂窝网络容量。 相似文献
4.
针对无线信号易受信道影响的难题,将智能反射面(Intelligent Reflecting Surface,IRS)被动波束赋形和基站(Base Station,BS)3D波束赋形进行联合设计。为最大化加权和速率,首先基于投影梯度下降法和加权均方误差等效原理,提出了一种多用户交替优化算法(Multi-User Alternative Optimization,MU-AO),其具有普适性。其次,基于高信噪比(Signal-to-Noise Ratio,SNR)近似原理,提出了一种多用户三级优化算法(Multi-User Three Stage Optimization,MUTSO),通过计算次优组合解来降低计算复杂度。最后,基于BS天线下倾角预定义策略,提出了一种多用户基于直射链路优化算法(Multi-User Direct-Link Based Optimization,MU-DLBO),能够实现复杂度与性能的均衡。实验表明,所提算法均能有效提升系统加权和速率,体现了联合波束赋形的有效性。 相似文献
5.
在下行链路传输场景中,发射机处的功率分配和波束赋形设计至关重要。考虑一个多用户Massive MIMO系统中总功率约束下最大化加权和速率问题,经典的WMMSE算法可以获取次优解,但计算复杂度过高。为了降低计算复杂度,提出了一种基于深度学习的快速波束赋形设计方法,该方法可以离线训练深度神经网络,利用训练后的神经网络求解最优波束赋形解,只需要简单的线性和非线性操作即可完成。实验结果显示,该方法可以逼近WMMSE算法精度的90%以上,同时计算复杂度和时延也大大降低。 相似文献
6.
针对加性高斯白噪声信道下的多用户非正交多脉冲调制系统,提出了基于QR分解的非相干判决反馈多用户检测器。该检测器通过QR分解矩阵变换,利用功率较强用户的判决信息来进行干扰抵消,可以有效消除用户间的多址干扰。而在各用户内,针对多脉冲调制技术,提出了一种线性解相关运算来进行非相干检测。同时,考虑解相关运算中矩阵求逆的复杂度比较高,进一步提出了一种软干扰抵消检测器。仿真结果表明所提的两种多用户检测算法可以有效消除非正交调制所造成的多址干扰,极大地提高功率较弱用户的性能,并且所提软干扰抵消检测器通过避免矩阵求逆降低了计算复杂度,同时检测性能没有损失。 相似文献
7.
针对目前3GPP R8版本协议只支持单流波束赋形的现状,3GPP提出了支持双流的波束赋形以适应更高的传输速率需求.双流波束赋形在单流波束赋性的基础上增加了多流的传输和多用户传输技术,能有效提高系统传输速率,降低多用户之间干扰,使得系统在频谱效率上有很大提高.首先对基于特征值的波束赋形作了详细阐述,然后在简要描述了双流波束赋形标准化进展的基础上重点探讨了专用导频的设计,最后对确定的三个仿真场景进行了计算机仿真分析,从仿真结果看,双流波束赋形能满足系统不同场景下对信噪比的要求. 相似文献
8.
文章介绍了3GPP Release 9中提出的双流波束赋形技术,对双流波束赋形技术的实现原理以及两种不同的应用场景进行了阐述。通过仿真,文章对单用户双流波束赋形时TM8与TM3和TM7进行了性能对比,并对单用户双流波束赋形和多用户双流波束赋形下的小区吞吐量增益进行了比较分析,分别给出了它们的信噪比适用门限。最后,文章通过外场测试评估,对仿真结果进行了验证,并给出双流波束赋形技术对系统吞吐量增益的结论。 相似文献
9.
我们提出了一种新的基于导频辅助的MC-CDMA系统的信道估计和解相关、解相关干扰消除检测器。这里的基于导频辅助的MC-CDMA系统的信道估计采用了一种新的算法.通过设计每个用户的导频信息.无需增加系统的过多负担,就可以实现较好的信道估计。解相关检测器采用了伪逆算法,解相关干扰消除检测器则用解相关检测器的输出作为一级输入,结合并行干扰消除算法。仿真结果显示了信道估计和多用户检测器的较好性能。 相似文献
10.
11.
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 相似文献
12.
L. K.K. Y.M. L. R.S. 《AEUE-International Journal of Electronics and Communications》2006,60(7):513-520
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. 相似文献
13.
14.
Jah-Ming Hsu Chin-Liang Wang 《Selected Areas in Communications, IEEE Journal on》2001,19(9):1775-1783
Optimal joint multiuser detection and decoding for direct-sequence code-division multiple-access (DS-CDMA) systems with forward error correction normally requires prohibitively high computational complexity. A suboptimal solution with low complexity is therefore appealing for use in practical applications. We propose a low-complexity iterative multiuser receiver for turbo-coded DS-CDMA systems. The proposed approach consists of a modified decorrelating decision-feedback detector (MDDFD) and K single-user turbo decoders, where K is the number of users in the DS-CDMA system. The MDDFD is derived on the basis of maximizing a likelihood probability and has a feature that it can use the reliability information from the turbo decoders' output. In addition, the MDDFD can deliver interference-cancelled soft outputs to the turbo decoders where the calculation of transition metrics is modified appropriately. Both performance analysis and computer simulation results have indicated that the reliability information from the turbo decoders' output can enhance the multiuser detection capability of the MDDFD. Computer simulations have also shown that the proposed iterative multiuser receiver outperforms the conventional DDFD-based multiuser receiver in terms of the bit-error probability 相似文献
15.
Blind multiuser detection: a subspace approach 总被引:24,自引:0,他引:24
Xiaodong Wang Poor H.V. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1998,44(2):677-690
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 相似文献
16.
该文提出了一种基于检测信息可靠度的部分软干扰消除迭代多用户检测算法。如果由从信道译码器所获得的发送字符的先验信息大于某一预定阈值,则认为对其检测具有较高的可靠度,因而可以考虑将其对应的多址干扰成分从匹配滤波器输出向量中直接消除,相当于减小了干扰用户的数目,从而可以减小迭代多用户检测算法的复杂度。该算法的计算复杂度能够随着多址干扰的减小和信道信噪比的增大而降低。 相似文献
17.
Wei-Chiang Wu Kwang-Cheng Chen 《Selected Areas in Communications, IEEE Journal on》1998,16(9):1723-1735
The level of multiple access interference (MAI) in code division multiple access (CDMA) communication systems is a time-varying parameter related to the number of active users. Almost all existing multiuser detection schemes were designed based on a priori information of the active users. In many situations, however, the multiuser receiver does not know the number of active users, and the receiver designed for the detection of all users may lead to poor performance. To develop a more efficient detection scheme in practical applications, we propose a two-stage detection structure consisting of preprocessing (identification) and postprocessing (detection). In the preprocessing, we apply the subspace concept and a method based on the multiple signal classification (MUSIC) algorithm to identify the active users while requiring only a priori knowledge of all of the users' signature sequences. The proposed preprocessor is shown to be asymptotically near-far resistant, and to have the ability to identify the active users in a simple and reliable way. While in the detection process, as we efficiently use the active users' information in every observation interval, the performance is clearly improved compared to the conventional structure without identification. Moreover, the effect of imperfect identification on the decorrelating detector is also extensively analyzed. Though the decorrelating detector's inherent near-far resistant characteristic is impaired by imperfect identification, the proposed structure still outperforms the conventional structure in the general near-far environment 相似文献
18.