一种频选衰落信道下的Turbo多用户检测算法

联合MAP多用户检测与信道解码的迭代多用户检测(MUD)技术可显著提高宽带移动CDMA系统的容量和性能.在多径时变衰落的编码信道下,提出一种迭代实现干扰抑制、符号估计、信道解码的Turbo多用户检测算法.在每次迭代中,MUD自适应地实现干扰抑制并输出符号估计的软信息,软输入软输出的信道解码器使用LOG MAP方法实现信道解码并反馈符号估计的软信息作为下一次TurboMUD迭代的先验信息.仿真结果证实了该算法在频选衰落信道下经两次迭代就能逼近单用户编码CDMA系统的接收性能.     

Turbo译码原理及其在CDMA多用户检测中的应用

研究了Turbo(并行级联码)译码原理及其在CDMA多用户检测中的应用。文中简述了Turbo译码原理及逐符号最大后验算法(symbol-by-symbol MAP),并将Turbo译码原理应用于CDMA系统的多用户检测,提出了基于Turbo译码原理的多用户检测接收机方案,通过计算机仿真验证该方案的性能。结果表明,本文所提出的方案经过4次迭代之后,其误码率接近单用户界,说明这种接收机可去除多址干扰(MAI)的影响。     

DS/CDMA同步信道中的多用户联合检测和译码

将迭代(Turbo)处理的思想应用于DS/CDMA系统同步信道的多用户检测和译码中,接收机利用信道译码的先验信息进行多用户前端处理,而其输出又作为信道译码器软输入,从而使多用户检测和信道译码联合进行,通过迭代逐渐逼近单用户性能,减少多址干扰的影响。仿真结果给出了迭代处理方法在不同信噪比条件下的比特误码率性能。     

一种低复杂度的Turbo多用户检测技术

基于Turbo原理,提出了一种适合于同步DS－CDMA系统的迭代多用户接收机结构,它通过在反复迭代的软输入出多用户检测器和一组信道译码之间获得连续的软判决,从而得到一种低复杂度的多用户检测算法－软MMSE干扰消除。     

Turbo编码DS/CDMA系统中的迭代多用户接收器

本文提出了一种用于Turbo编码DS/CDMA系统的迭代多用户接收器。该接收器由一个软输入/软输出（SISO）的多用户检测器和一组单用户SISO信道译码器组成。每次迭代过程中，多用户检测器和信道译码器都输出信息作为下一代迭代的先验信息，仿真结果表明，这种接收器的比特误码性能接近Turbo编码系统的单用户限。     

不完全信道状态信息条件下多用户Turbo-BLAST迭代检测算法

该文将空时多用户检测技术和Turbo-BLAST方案相结合,构造了基于CDMA技术的多用户Turbo- BLAST系统模型,提出了不完全信道状态信息条件下的解相关算法和迭代检测算法。在发送端将V-BLAST结构与CDMA技术相结合实现多路复用,在接收端利用空时多用户检测算法去除用户间干扰,得到期望用户的接收信号,然后采用考虑信道估计误差的软干扰抵消迭代检测算法,对期望用户的接收信号进行检测以去除天线间干扰。仿真结果说明,所提算法对于多用户Turbo-BLAST系统是有效的,可在不增加复杂度的条件下达到良好的迭代效果。     

多径信道下一种线性空时多用户检测方法

给出了用于DS/CDMA系统的线性空时多用户接收机的数学模型,分析了在多用户空时接收机中空域处理和时域匹配滤波的作用,引入SOR算法,并将其改进应用到多径信道下的线性空时多用户检测中。通过迭代避免了直接求逆运算,显著降低了运算复杂度。仿真表明:线性空时多用户接收机能够明显提高接收机性能,并且随着接收机天线数的增加性能明显提高。     

异步多径条件下空时CDMA多用户检测

本文利用最小均方误差准则,推导了异步多径条件下空时CDMA多用户检测算法,分析了多用户检测与单用户检测关系,提出空时CDMA多用户检测接收机结构。基于SAGE迭代算法进行空时多用户检测,并利用CDMA信号的有限字符特性和上行信道的导频信息对SAGE算法提出改进。仿真结果说明了本文提出的空时CDMA多用户检测算法性能。     

无人飞行器通信中联合信道估计和Turbo均衡

Turbo均衡技术能有效克服信道多径、消除符号间干扰(ISI),从而提高接收机整体性能。针对无人飞行器地空视距链路信道这种快时变多径信道,提出了一种联合信道估计和Turbo均衡的迭代接收算法。该算法采用单载波调制体制,通过信道估计和Turbo均衡之间相互反馈软信息来消除ISI。Matlab仿真结果表明,经过2次以上的迭代后,相比较于传统的单载波频域Turbo均衡算法,新算法的误码率性能得到了显著改善。     

短波COFDM空、时、频系统迭代检测算法

短波信道是一个复杂的时变信道,多径效应、本振频偏、多普勒频移和时变衰落都为OFDM技术的应用造成了很大困难.本文设计的COFDM短波多天线接收系统,分别采用了多天线接收,串行级联卷积码(SCCC)编码,OFDM调制,可以分别达到空间、时间和频率上面的分集,从而改善了系统的性能.采用基于期望最大化(EM)算法与MAP译码算法相结合的迭代频偏、信道跟踪和信号检测算法.可以有效地克服短波时变信道的影响.计算机仿真结果表明,本文算法随着迭代次数的增多系统性能得到优化,而且,多天线系统比单天线系统有更好频偏、信道跟踪和信号检测性能.     

Space-time turbo multiuser detection for coded MC-CDMA

The system capacity and performance of multicarrier code-division multiple-access (MC-CDMA) communication systems can be significantly enhanced by jointly employing MAP-based multiuser detection (MUD) and channel decoding techniques. In this paper, a group-oriented soft iterative MUD based on the combination of smart antennas and iterative MAP-based MUD is presented. The proposed method is featured as a novel technique for further increasing the system capacity and performance. In this method, all the users are first grouped into several groups according to their impinging direction of arrivals (DOAs). All users with similar DOAs are classified into the same group and then low-complexity MAP-based iterative MUD is employed in each group. Because spatial filtering cannot suppress all the interference between the groups, interference cancellation among the groups is used prior to MUD within each group. It is shown that the proposed group-oriented soft iterative MUD algorithm can significantly reduce the computational complexity compared with the conventional optimal MAP-based MUD schemes. It is also demonstrated that the performance of the proposed algorithm can approach that of a single-user coded MC-CDMA system with an antenna array in additive white Gaussian noise and frequency selective fading channels.     

A novel bandwidth efficient SOC-based turbo coding scheme mid reduced complexity MUD for SA-based MC-CDMA systems

Multiuser-detection (MUD), turbo coding and smart-antennas (SA) are powerful techniques for enhancing the performance and capacity of MC-CDMA systems. Among the MUD algorithms, the maximum-likelihood (ML) method has the best performance but its complexity increases exponentially with the number of users and constellation size. In this paper, we first propose a novel bandwidth-efficient-channel-coding-scheme (BECCS) for a super-orthogonal-code (SOC)-based serially concatenated turbo code (SCSOC) so that by using it, the coded system without extra bandwidth significantly improves the performance of an uncoded system over a fading channel. Second, in order to reduce the complexity of the ML-based turbo MUD technique, an ML algorithm based on the sensitive-bits-algorithm (SBA) and a less-complex-norm-approximation (LCNA) based Euclidean distance is proposed for a SCSOC-based BECCS assisted coded MC-CDMA system accompanied by SA techniques at the receiver. Our analytical and simulation results show that from a performance perspective, at BER=10^?2, the proposed SCSOC-based BECCS assisted MC-CDMA system performs 4?dB better than SOC-based coded systems. The latter system has 5?dB gain in comparison with an uncoded one, all in the same bandwidth and over fading channels.     

CDMA系统中基于T-H网络的空时多用户检测算法

CDMA技术已经在当前第三代通信（3G）标准中得到广泛采用,其中多用户检测技术能明显地改善CDMA通信性能,提高其系统容量。本文充分利用空时二维信息来增强CDMA系统的性能,提出一种基于Tank-Hopfield网络多用户检测算法：利用T-H网络快速计算LS的能力,来求解空时多用户检测问题。分析和仿真实验表明该算法的有效性,相比传统的子空间等方法,该方法具备更好的收敛速度和检测性能。     

基于伪并行遗传算法的MC-CDMA多用户检测技术研究

介绍MC-CDMA的多用户检测技术。在分析频率选择衰落信道中单小区MC-CDMA系统上行多址干扰的基础上,引入基于＂联姻＂策略的伪并行遗传算法用于多用户检测技术。通过仿真表明,与解相关和MMSE检测器以及传统遗传算法应用于MUD中相比,其在误比特率性能上更加优秀,而运行时间却明显小于最佳多用户检测。     

FD-MC-CDMA: A Frequency-Based Multiple Access Architecture for High Performance Wireless Communication

Multi-carrier code division multiple access (MC-CDMA) demonstrates good probability of error performances in frequency selective fading channels, a direct result of its ability to resolve the available frequency diversity. However, MC-CDMA performances may be limited by degradation due to large multiple-access interference (MAI). Frequency division multi-carrier code division multiple access (FD-MC-CDMA), a novel multiple access architecture proposed in this paper, exploits the available frequency diversity benefits while reducing MAI. Specifically, instead of transmitting all users' information bits over all carriers, FD-MC-CDMA employs a subset of carriers to support a subset of users (while maintaining the same overall system capacity and throughput as in MC-CDMA). By careful selection of each subset of carriers, the available frequency diversity benefits are fully exploited, while the MAI experienced by each user is reduced. Furthermore, since the number of carriers employed by each user is significantly reduced, the complexity of the truly optimal multiuser detection (MUD) receiver for FD-MC-CDMA is low. An optimal MUD based on the maximum likelihood (ML) criteria is employed to optimize the system performance of FD-MC-CDMA. The proposed FD-MC-CDMA (with MUD) provides significantly better bit error rate (BER) performances than traditional MC-CDMA systems with little increase in system complexity.     

Downlink capacity of interference-limited MIMO systems with joint detection

The capacity of downlink cellular multiple-input multiple-output (MIMO) systems, where co-channel interference is the dominant channel impairment, is investigated in this paper, mainly from a signal-processing perspective. Turbo space-time multiuser detection (ST MUD) is employed for intracell communications and is shown to closely approach the ultimate capacity limits in Gaussian ambient noise for an isolated cell. Then, it is combined with various multiuser detection methods for combating intercell interference. Among various multiuser detection techniques examined, linear minimum-mean-square-error (MMSE) MUD and successive interference cancellation are shown to be feasible and effective. Based on these two multiuser detection schemes, one of which may outperform the other for different settings, an adaptive detection scheme is developed, which together with a Turbo ST MUD structure offers substantial performance gain over the well-known V-BLAST techniques with coding in this interference-limited cellular environment. The obtained multiuser capacity is excellent in the high to medium signal-to-interference ratio scenario. Nonetheless, numerical results also indicate that a further increase in system complexity, using base-station cooperation, could lead to further significant increases of the system capacity. The asymptotic multicell MIMO capacity with linear MMSE MUD preprocessing is also derived, and this analysis agrees well with the simulation results.     

Reduced-complexity MAP-based iterative multiuser detection for coded multicarrier CDMA systems

In recent years, combining multiuser detection (MUD) and channel decoding has received considerable attention. The maximum a posteriori (MAP) criterion-based iterative multiuser detector greatly improves the system performance and can approach the performance of single-user coded systems. However, its complexity increases exponentially with the number of users and can become prohibitive for systems with a medium-to-large number of users. In this paper, a reduced complexity MAP-based iterative MUD based on the use of a soft sensitive bits algorithm is proposed for coded multicarrier code-division multiple-access systems. It is shown that it can greatly reduce the computational complexity with a minimal penalty in performance compared to the conventional optimal scheme.     

High-Speed Recursion Architectures for MAP-Based Turbo Decoders

The maximum a posterior probability (MAP) algorithm has been widely used in Turbo decoding for its outstanding performance. However, it is very challenging to design high-speed MAP decoders because of inherent recursive computations. This paper presents two novel high-speed recursion architectures for MAP-based Turbo decoders. Algorithmic transformation, approximation, and architectural optimization are incorporated in the proposed designs to reduce the critical path. Simulations show that neither of the proposed designs has observable decoding performance loss compared to the true MAP algorithm when applied in Turbo decoding. Synthesis results show that the proposed Radix-2 recursion architecture can achieve comparable processing speed to that of the state-of-the-art recursion (Radix-4) architecture with significantly lower complexity while the proposed Radix-4 architecture is 32% faster than the best existing design     

BER analysis of the optimum multiuser detection with channel mismatch in MC-CDMA systems

In this paper, we analyze the bit-error-rate (BER) performance of the optimum multiuser detection (MUD) with channel mismatch in multicarrier code-division-multiple-access (MC-CDMA) systems. The BER performance of the optimum MUD without channel mismatch in MC-CDMA systems has been recently derived using the replica method. However, it is left unjustified, since the replica method is not a rigorous approach. In addition, it is NP-hard to implement an optimum MUD algorithm. To justify the BER performance and to make the optimum MUD feasible, based on Pearl's belief propagation (BP) scheme, we put together a low-complexity iterative MUD algorithm for MC-CDMA systems. Furthermore, channel mismatch is introduced into the BP-based MUD algorithm to make the scenario general. With channel mismatch, the analytical results of the BP-based MUD algorithm conform perfectly to, and the simulation results of the BP-based MUD algorithm conform very closely to the BER performance of the optimum MUD derived using the replica method, which is a nontrivial extension of the existing replica approach mentioned above. Without channel mismatch, the problem becomes a special case of our contribution.