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

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

基于解相关判决反馈检测的迭代多用户接收器

提出了一种基于解相关判决反馈检测的迭代多用户接收器,它同时实现多用户检测,信道译码和信道参数估计,数据检测、译码与参数估计相辅相成。随着迭代次数的增加,比特误码率减低;同时,参数估计值也趋于最优值。     

Turbo MUD技术在TD-SCDMA系统中的应用

TD-SCDMA已成为第3代移动通信国际标准之一,它采用联合检测技术来抑制符号间干扰(ISI)和多址干扰(MAI)。介绍了Turbo多用户检测(MUD)技术在TD-SCDMA系统中的应用,该技术将Turbo迭代译码思想引入到联合检测,有机结合多用户检测和信道译码2种技术,通过在软MUD和软信道译码间多次进行迭代并及时交换软信息(如后验概率)来提高系统性能。研究表明,采用TurboMUD可使系统性能显著提高。     

编码的多载波CDMA系统中Turbo时空多用户检测

联合MAP多用户检测和信道译码的迭代多用户检测技术可显著提高多载波CDMA系统的容量和性能,本文给出了结合智能天线和迭代MAP多用户检测的Turbo时空多用户检测算法,该方法进一步提高了系统的性能.Turbo时空多用户检测算法不仅极大减小了传统最优MAP多用户检测算法的运算量,而且,此算法性能在AWGN和频率选择性衰落信道中都能逼近单用户编码多载波CDMA系统多天线接收的性能.     

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

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

差分空时编码CDMA系统的多用户接收机设计

利用码分多址和互满正交设计,该文针对多天线系统提出了非相干空时传输方案。它可支持满分集通信,并能有效抑制多用户干扰。基于平坦Rayleigh衰落信道,给出了差分解相关接收机,它不仅隔离了不同用户的检测,而且使不同数据符号的译码彼此独立。     

低复杂度上行多用户MIMO检测算法

针对上行多用户MIMO系统,提出了一种新的空时检测算法.算法首先对接收信号进行线性重组,然后采用正交于各用户干扰集的匹配滤波向量来消除多用户间干扰,最后各用户利用等效信道的正交性实现线性译码.给出了非理想信道环境下算法的设计.理论分析及仿真结果表明,该算法具有复杂度低和顽健性好的优势,且性能优于其他检测算法.     

MC-CDMA系统迭代检测中的均衡

本文研究在同步MC- CDMA系统中的上行链路中的均衡技术。接收机采用多用户检测和译码相结合的迭代检测技术;其中,串行干扰消除用于多用户检测,一个SISO译码器用于信道译码。仿真给出在不同的均衡策略下如ORC、EGC、MRC、MMSE,迭代检测接收机的性能     

MC-CDMA系统迭代检测中的一种信道估计算法

在DS—CDMA系统中，联合译码的迭代多用户检测是克服多址干扰增加系统容量的有效方法。本文将多用户检测和译码相结合的迭代检测技术应用于MC—CDMA系统，其中，多用户检测器由串行干扰消除和其后的MMSE滤波器组成。文中提出一种时域信道估计作为迭代初始值的频域信道估计算法，比单纯的频域信道估计方法节约导频符号数量，并且由于信道估计性能的改善，加快了迭代检测的收敛速度。     

5G大规模天线基站下的多用户性能测试技术

在当前5G系统全球商用化的时代,针对基站大规模天线下的多用户技术,对基站和终端进行性能测试是实现产品升级迭代的重要环节。首先,介绍5G多用户技术的主要特点并说明了多用户性能测试的意义。其次,为了实现不同信道环境的大规模天线基站下的多用户性能测试,给出多用户无线信道建模技术。最后,通过对建立的信道模型进行实现,给出了大规模天线多用户性能测试的主要技术方案和测试建议。     

Iterative multiuser detection for turbo-coded synchronous CDMA inGaussian and non-Gaussian impulsive noise

We develop an iterative multiuser receiver for decoding turbo-coded synchronous code-division multiple-access signals in both Gaussian and non-Gaussian noise. A soft-input soft-output nonlinear multiuser detector is combined with a set of single-user channel decoders in an iterative detection/decoding structure. The nonlinear multiuser detector utilizes the prior probabilities of each user's bits to form soft estimates used for multiple-access interference cancellation. The channel decoders perform turbo-code decoding and produce posterior probabilities which are fed back to the multiuser detector for use as prior probabilities. Simulation results show that the proposed multiuser receiver performs well in both Gaussian and non-Gaussian noise. In particular, single-user turbo-code performance can be approached within a few iterations with medium to low cross correlation (ρ⩽0.5)     

Soft multiuser decoding for vector quantization over a CDMA channel

An approach to optimal soft decoding for vector quantization (VQ) over a code-division multiple-access (CDMA) channel is presented. The decoder of the system is soft in the sense that the unquantized outputs of the matched filters are utilized directly for decoding (no decisions are taken), and optimal according to the minimum mean-squared error (MMSE) criterion. The derived decoder utilizes a priori source information and knowledge of the channel characteristics to combat channel noise and multiuser interference in an optimal fashion. Hadamard transform representations for the user VQs are employed in the derivation and for the implementation of the decoder. The advantages of this approach are emphasized. Suboptimal versions of the optimal decoder are also considered. Simulations show the soft decoders to outperform decoding based on maximum-likelihood (ML) multiuser detection. Furthermore, the suboptimal versions are demonstrated to perform close to the optimal, at a significantly lower complexity in the number of users. The introduced decoders are, moreover, shown to exhibit near-far resistance. Simulations also demonstrate that combined source-channel encoding, with joint source-channel and multiuser decoding, can significantly outperform a tandem source-channel coding scheme employing multiuser detection plus table lookup source decoding     

Suboptimum soft-output detection algorithms for coded multiuser systems

In this paper, we consider coded asynchronous multiuser signals in an additive white Gaussian noise channel. Since optimum joint multiuser detection (MUD) and forward error correction (FEC) decoding is characterized with a very high computational complexity, we consider disjoint MUD and FEC decoding. The optimum disjoint multiuser detector is the soft-output maximum a posteriori detector that provides sequences of a posteriori probabilities to the corresponding FEC decoders. It involves backward and forward recursions resulting in high complexity and processing delay. In this paper, we consider several suboptimum soft output disjoint multiuser detectors that involve only forward recursions and have reduced complexity and delay.     

Iterative multiuser detection

Communication channels that involve both error-control coding and multiple-access signaling are of increasing interest in applications such as cellular telephony, wireless computer networks, and broadband local access. Optimal data detection and decoding in such channels generally require a level of computational complexity that is prohibitive for these types of applications. Turbo multiuser detection (MUD) addresses this problem by applying turbo principle of iteration among constituent decision algorithms, with intermediate exchanges of soft information about tentative decisions. This principle is applied in this paper by considering MUD and error-control decoding as the two constituent decision algorithms. The resulting iteration between soft MUD and soft channel decoding yields good results. This article reviews this area outlining both the basic principles involved and the basis for low-complexity turbo multiuser detectors that require minimal increased complexity over that of the standard channel decoder.     

Iterative (turbo) soft interference cancellation and decoding forcoded CDMA

The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath code-division multiple-access (CDMA) channels. In this paper, an iterative receiver structure is proposed for decoding multiuser information data in a convolutionally coded asynchronous multipath DS-CDMA system. The receiver performs two successive soft-output decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process. At each iteration, extrinsic information is extracted from detection and decoding stages and is then used as a priori information in the next iteration, just as in turbo decoding. Given the multipath CDMA channel model, a direct implementation of a sliding-window SISO multiuser detector has a prohibitive computational complexity. A low-complexity SISO multiuser detector is developed based on a novel nonlinear interference suppression technique, which makes use of both soft interference cancellation and instantaneous linear minimum mean-square error filtering. The properties of such a nonlinear interference suppressor are examined, and an efficient recursive implementation is derived. Simulation results demonstrate that the proposed low complexity iterative receiver structure for interference suppression and decoding offers significant performance gain over the traditional noniterative receiver structure. Moreover, at high signal-to-noise ratio, the detrimental effects of MAI and ISI in the channel can almost be completely overcome by iterative processing, and single-user performance can be approached     

一种满速率空时分组编码CDMA系统及多用户接收方案

通过引入满速率空时分组码方案, 该文给出一种满速率空时分组编码CDMA系统模型, 并针对现有空时编码CDMA系统过高的译码复杂度, 提出一种低复杂度的多用户接收方案。该方案在通过类似多用户检测方法有效抑制多用户干扰后, 充分利用空时分组码的复正交性来简化原有方案高译码复杂度。与原有指数性译码复杂度相比, 该方案有着线性复杂度, 而且与满分集空时分组编码CDMA系统相比, 可实现满速率、低复杂度和部分分集, 有着相对多的空间冗余信息, 从而级联信道编码后可有效弥补部分分集所带来的性能损失。仿真结果表明在相同系统容量和级联码的情况下, 所给系统比相应的满分集空时编码CDMA系统有着低的误比特率。     

The throughput of some wireless multiaccess systems

We compute the throughput of some multiaccess wireless systems for delay-tolerant data communications, characterized by an infinite population of uncoordinated users accessing a common channel. The channel is affected by block fading, and the channel state is perfectly known to the receiver but unknown to the transmitters. To cope with multiaccess interference (MAI) and fading, the users employ retransmission of erroneously received packets. We consider unspread and randomly spread (code-division multiple-access (CDMA)) systems with decentralized (single-user) decoding and a system where the receiver employs joint multiuser decoding. The following conclusions can be drawn from our analysis: (a) unspread systems with packet retransmission outperforms CDMA systems with conventional detection, but are outperformed by CDMA with linear minimum mean-square error (MMSE) detection. (b) For all systems based on single-user decoding (SUD), there exists a threshold value of (E/sub b//N/sub o/) below which the throughput is maximized by an infinite number of users per dimension transmitting at vanishing rate, and above which the throughput is maximized by a finite average number of users per dimension transmitting at nonvanishing rate. Moreover, as (E/sub b//N/sub o/) increases, the optimal average number of users per dimension tends to one. In this sense, we say that the optimized systems "self-orthogonalize." (c) For the system based on joint multiuser decoding, a simple slotted ALOHA strategy is able to recover the throughput penalty due to fading in the limit for high (E/sub b//N/sub o/), while an incremental redundancy (INR) strategy recovers the fading penalty for any (E/sub b//N/sub o/).