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

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

一种改进的基于FG-Turbo多用户检测的软干扰消除算法

基于因子图与和积算法,给出了基于LDPC的FG-Turbo多用户检测扩展模型,仿真比较了最优MAP算法和软干扰消除算法的性能,并提出了一种基于敏感比特的软干扰估计新方法。仿真结果表明,改进后的软干扰消除算法在复杂度不变的情况下,有效地改善了系统性能。     

广义分布式网络架构下的多用户联合干扰抑制

针对广义分布式网络架构中相邻小区多用户干扰抑制的理论空白，构建了干扰小区集合的系统模型，继而提出两种该架构下可行的多用户联合于扰抑制算法．其中，交叉迭代联合检测（CI-JD，Crossed Iterative Joint Detection）算法利用多用户之间的逐级干扰消除，可以在运算复杂度增加不多的情况下显著改善系统性能；全局联合检测（G-JD，Global Joint Detection）算法通过对多用户信息的统一建模，有效抑制了相邻小区用户间的干扰，同时获得系统分集增益．仿真结果验证了本文所述两种算法的可行性及有效性。     

长码CDMA系统上行链路多用户接收机设计

提出一种适用于长码CDMA移动通信系统上行链路的多用户接收机设计方案，包括多用户信道估计、多用户检测以及信道跟踪等算法。通过把用户传播时延的影响放入信道响应矩阵中，由信道估计间接得出各用户的传播时延。使用迭代运算的方式使得运算量分散，降低了对硬件平台的要求，使算法更为适用。增大观察窗的长度达到了更准确的用户信息比特判决，提高了接收机的性能。仿真结果表明文章提出的接收机设计方案具有很好的远近效应抑制能力，性能远高于传统的单用户Rake接收机。     

CS-CDMA/CP系统迭代多用户检测的密度演进分析

在有多用户于扰的情况下,为了提高多用户的循环前缀的卷积扩频码分多址(CS-CDMA/CP)系统的带宽效率,提出了一种迭代的部分多用户检测算法.文中用密度演进的分析方法阐明了干扰用户的检测质量对期望用户的影响.从分析可知,于扰用户检测的准确度是期望用户检测的根本.文中采用扩大检测窗或放弃一些检测很差的干扰用户的迭代检测的方法对部分迭代多用户检测进行了改进,改进后的算法能够在系统性能和检测器的复杂度之间进行更好地折中.     

基于量子计算方法的多址DCSK通信系统的研究

为了降低多用户之间的干扰问题,提出了一种新的混沌多址通信系统（多比特MA-DCSK）,并设计了该系统的多用户检测算法。通过仿真实验,比较了该多比特MA-DCSK系统与可变延时MA-DCSK系统的误码率性能,证明了该系统具有更低的误码率。利用量子并行运算的特性,采用Grover量子算法解决多用户检测算法的计算复杂度,这种算法可以将复杂度从 降低到 。仿真结果表明,在不影响系统性能的同时,量子算法可以有效地降低计算复杂度。     

Turbo编码STBC系统中削弱误差传播的迭代多用户检测技术

空时编码(STC)技术将天线阵列信号处理和信道编码技术联合起来实现无线信道容量的有效增加。为了抑制空时分组编码(STBC)系统的共道用户干扰,对低复杂度的多用户检测算法进行研究,该文提出了一种STBC系统的迭代(turbo)多用户接收机。该接收机由一个软入软出(SISO)基于均值的软判决多用户检测器(Soft Decision Multi-User Detector, SDMUD)和一组SISO Turbo信道解码器构成。两者之间通过迭代交换外信息,精确地估计用户信号。仿真结果表明这种接收技术经3次迭代后性能改善约2dB,并且系统性能会随着接收天线的增多而得到明显提高,从而大大增加系统容量。     

基于SRM检测算法的量子多用户检测研究

量子多用户检测为经典多用户检测最优解这一NP难解问题提供了一种有效的解决方法。本文利用量子多址通信模型,设计量子SRM检测算子,进行基于SRM检测的量子多用户检测算法的仿真及性能分析,提出了该算法的简化方法,并对各种可能影响算法性能的因素加以讨论。仿真结果表明,基于SRM算法的量子多用户检测方法具有很好的检测性能,简化后的算法计算复杂度大幅下降,算法的实用性得以增强。     

基于切比雪夫-迹迭代的大规模MIMO系统软输出信号检测

在多用户大规模多输入多输出(MIMO)系统信号检测算法中,最小均方误差(MMSE)算法可取得近似最优性能,但MMSE算法中高维矩阵求逆的复杂度过高,导致在实际应用中难以快速有效地实现.同时,对于高阶正交幅度调制(HQAM),如果符号向比特的解映射采用硬判决,将会导致后续信道译码的性能明显下降.因此,该文针对采用格雷编码的HQAM的多用户大规模MIMO系统,提出一种基于切比雪夫-迹迭代(CTI)的低复杂度软输出信号检测算法.该算法不但有效地规避了信号检测所需的高维矩阵求逆,同时,利用格雷编码的调制信号的比特翻转特性和二叉树结构,给出了一种融合三叉链表搜索的比特对数似然比(LLR)简化计算方法.仿真结果表明,该文所提的软输出信号检测算法最多需要3次迭代就能收敛并可取得接近MMSE算法的性能,在复杂度和性能之间取得了很好的折中.     

基于切比雪夫-迹迭代的大规模MIMO系统软输出信号检测

在多用户大规模多输入多输出(MIMO)系统信号检测算法中,最小均方误差(MMSE)算法可取得近似最优性能,但MMSE算法中高维矩阵求逆的复杂度过高,导致在实际应用中难以快速有效地实现。同时,对于高阶正交幅度调制(HQAM),如果符号向比特的解映射采用硬判决,将会导致后续信道译码的性能明显下降。因此,该文针对采用格雷编码的HQAM的多用户大规模MIMO系统,提出一种基于切比雪夫-迹迭代(CTI)的低复杂度软输出信号检测算法。该算法不但有效地规避了信号检测所需的高维矩阵求逆,同时,利用格雷编码的调制信号的比特翻转特性和二叉树结构,给出了一种融合三叉链表搜索的比特对数似然比(LLR)简化计算方法。仿真结果表明,该文所提的软输出信号检测算法最多需要3次迭代就能收敛并可取得接近MMSE算法的性能,在复杂度和性能之间取得了很好的折中。     

Iterative multiuser detection for turbo-coded FHMA communications

An iterative receiver structure Is proposed for turbo-coded frequency-hop multiple access (FHMA) systems. In FHMA systems, the adjacent channel interference (ACI) is the major contributor of multiple access interference (MAI) if orthogonal hopping patterns are used. The ACI is a function of the tone spacings of the adjacent subchannels and the rolloff factor of the pulse-shaping filter. The calculation of the ACI for a square-root raised-cosine pulse-shaping filter in an FHMA system is presented in this paper. In addition, a low complexity iterative multiuser detector is developed to mitigate the degradation caused by ACI in the FHMA systems. The iterative receiver structure is based on a modified turbo decoding algorithm which makes use of the a posteriori log-likelihood ratio (LLR) information of the systematic bits to obtain the a posteriori information of the turbo-encoded parity bits. Iterations of the receiver/decoder are used as the mechanism to estimate and mitigate the MAI in the FHMA system. The properties of both soft and hard interference suppressors based on the modified turbo decoding algorithm are examined and an efficient recursive implementation is derived. Compared to maximum-likelihood multiuser detection, the proposed system is more practical and its complexity is only a linear function of the number of users. Simulation results show that the proposed iterative receiver structure offers significant performance gain in bandwidth efficiency and the required signal-to-noise ratio (SNR) for a target bit-error rate (BER) over the noniterative receiver structure. Moreover, the single user performance can be achieved when imperfect power control exists     

基于串并结合策略的SCMA多用户检测

稀疏码分多址接入（SCMA）是促进第五代移动通信系统发展的重要无线空口技术支撑,能够满足海量连接的需求。针对上行SCMA通信系统接收端使用的基于串行消息传递算法（MPA）的多用户检测迭代运行时间长,导致系统时延的问题,提出一种串并结合SCMA多用户检测算法,充分融合了串并行消息传递特点。仿真结果表明,相比串行MPA多用户检测算法,所提算法可降低系统的复杂度,且每轮迭代运行时间减少,从而减小了时延,实现了误比特率性能与系统时延、系统复杂度之间理想的平衡。     

Simplified SCL decoding algorithm of polar codes based on critical sets

In order to reduce the high complexity of the successive cancellation list (SCL) algorithm for polar codes, a simplified SCL decoding algorithm based on critical sets (CS-SCL decoding algorithm) is proposed. The algorithm firstly constructs the critical sets according to the channel characteristics of the polar codes as well as comprehensively considering both the minimum Hamming weight (MHW) of the information bits and the channel reliability. The information bits within the critical sets and the path splitting are still performed by the SCL decoding algorithm while the information bits outside the critical sets are directly performed by the hard decision. Thus, the number of path ordering, copying, and deleting can be reduced during decoding. Furthermore, the computational complexity of the SCL decoding can also be reduced. Simulation results demonstrate that the decoding complexity of the proposed CS-SCL decoding algorithm, compared with the conventional SCL decoding algorithm, is reduced by at least 70%, while compared with the simplified SCL (PS-SS-SCL) algorithm which constructs the critical set with the first and second information bits of the Rate-1 nodes, its decoding complexity can also be reduced. Moreover, the loss of the error correction performance for the proposed CS-SCL decoding algorithm is minor. Therefore, the proposed CS-SCL algorithm is effective and can provide a reasonable tradeoff between the decoding performance and complexity for the decoding algorithm of polar codes.     

Near-Optimum Iterative Multiuser Receiver for FEC Encoded DS-CDMA

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.     

一种分簇无线传感器网络中的分布式信源编码算法

针对密集型无线传感器网络中信息存在大量冗余的问题,该文提出了一种适用于分簇无线传感网络的分布式信源编码算法.该算法以边信息作为初始参考信源,利用信源间的相关性来决定各信源的编码顺序和参考信源,然后由各信源相对于参考信源进行相关编码,接收端则根据编码顺序和参考信源进行相关译码.该文同时针对模值编码的方式,给出了一种低复杂度的译码算法.理论分析和仿真结果表明,将该算法应用于分簇路由协议中可以有效地降低节点的发送比特数,从而降低网络的能耗以延长网络寿命.     

基于无率纠错码和高阶QAM调制的收端速率自适应方案

现有的自适应解调方案中调制阶数最高仅限于16,且方案分析和设计中没有考虑信道编码的译码环节.本文研究适用于高阶QAM的自适应解调算法,并结合无率纠错码提出一种收端速率自适应方案.接收端有多种解调模式,每种解调模式删除一个符号中不同数量的、似然比绝对值最低的几个比特,以提高解调比特的可靠度和平均互信息.从互信息分析的角度,得到在满足要求的译码误码性能时,译码所需要的码字长度的理论结果,进一步给出在译码复杂度约束条件下解调模式的选择方案.以256-QAM调制星座和Raptor码为例对方案进行了仿真,验证了理论分析的正确性和方案的有效性.     

Joint signal detection and parameter estimation in multiusercommunications

The problem of simultaneously detecting the information bits and estimating signal amplitudes and phases in a K-user asynchronous direct-sequence spread-spectrum multiple-access communication system is addressed. The joint maximum-likelihood (ML) estimator has a computational complexity that is exponential in the total number of bits transmitted and thus does not represent a practical solution to the problem. An estimator that combines a suboptimum tree-search algorithm with a recursive least-squares estimator of complex signal amplitude is considered. The complexity of this estimator is O(K²) computations per decoded bit, and its performance is very close to that of the joint ML receiver. This receiver has the advantage that the transmitted signal powers and phases are extracted from the received signal in an adaptive fashion without using a test sequence     

可变速率多元LDPC码高阶调制系统

由于无线信道的时变性及无线频谱资源的短缺,码率自适应技术及高频谱效率的高阶调制技术均为未来高速率无线通信发展的必然方向,本文提出了一种基于多元速率兼容LDPC（RC-LDPC）码的可变速率高阶编码调制方案。该方案基于符号级的多元LDPC码缩短和打孔算法,并与高阶映射联合优化设计,获得了比二元RC-LDPC码方案优异的性能,实现了多元LDPC码率从1/3到5/6灵活变化,并且所有子码都可以共享母码的编译码器,因此相对于多元母码,基本不增加系统复杂度。仿真结果证明采用64-QAM调制时,本方案的误码率性能比二元码对应方案在各个码率分别有0.5到1.3dB的增益。      

Bio-cellular processes modeling on silicon substrate: receptor–ligand binding and Michaelis Menten reaction

Reducing transmit power is the most straightforward way towards more energy-efficient communications, but it results in lower SNRs at the receiver which can add a performance and/or complexity cost. At low SNRs, synchronization and channel estimation errors erode much of the gains achieved through powerful turbo and LDPC codes. Further expanding the turbo concept through an iterative receiver—which brings synchronization and equalization modules inside the loop—can help, but this solution is prohibitively complex and it is not clear what can and what cannot be a part of the iterative structure. This paper fills two important gaps in this field: (1) as compared to previous research which either focuses on a subset of the problem assuming perfect remaining parameters or is computationally too complex, we propose a proper partitioning of algorithm blocks in the iterative receiver for manageable delay and complexity, and (2) to the best of our knowledge, this is the first physical demonstration of an iterative receiver based on experimental radio hardware. We have found that for such a receiver to work, (1) iterative timing synchronization is impractical, iterative carrier synchronization can be avoided by using our proposed approach, while iterative channel estimation is essential, and (2) the SNR gains claimed in previous publications are validated in indoor channels. Finally, we propose a heuristic algorithm for simplifying the carrier phase synchronization in an iterative receiver such that computations of the log likelihood ratios of the parity bits can be avoided to strike a tradeoff between complexity and performance.