Gaussian Mixture-Learned Approximate Message Passing(GM-LAMP)Based Hybrid Precoders for mmWave Massive MIMO Systems

Hybrid precoder design is a key technique providing better antenna gain and reduced hardware complexity in millimeter-wave(mmWave)massive multiple-input multiple-output(MIMO)systems.In this paper,Gaussian Mixture learned approximate message passing(GM-LAMP)network is presented for the design of optimal hybrid precoders suitable for mmWave Massive MIMO systems.Optimal hybrid precoder designs using a compressive sensing scheme such as orthogonal matching pursuit(OMP)and its derivatives results in high computational complexity when the dimensionality of the sparse signal is high.This drawback can be addressed using classical iterative algorithms such as approximate message passing(AMP),which has comparatively low computational complexity.The drawbacks of AMP algorithm are fixed shrinkage parameter and non-consideration of prior distribution of the hybrid precoders.In this paper,the fixed shrinkage parameter problem of the AMP algorithm is addressed using learned AMP(LAMP)network,and is further enhanced as GMLAMP network using the concept of Gaussian Mixture distribution of the hybrid precoders.The simula-tion results show that the proposed GM-LAMP network achieves optimal hybrid precoder design with enhanced achievable rates,better accuracy and low computational complexity compared to the existing algorithms.

Speech Enhancement Based on Approximate Message Passing

To overcome the limitations of conventional speech enhancement methods, such as inaccurate voice activity detector(VAD) and noise estimation, a novel speech enhancement algorithm based on the approximate message passing(AMP) is adopted. AMP exploits the difference between speech and noise sparsity to remove or mute the noise from the corrupted speech. The AMP algorithm is adopted to reconstruct the clean speech efficiently for speech enhancement. More specifically, the prior probability distribution of speech sparsity coefficient is characterized by Gaussian-model, and the hyper-parameters of the prior model are excellently learned by expectation maximization(EM) algorithm. We utilize the k-nearest neighbor(k-NN) algorithm to learn the sparsity with the fact that the speech coefficients between adjacent frames are correlated. In addition, computational simulations are used to validate the proposed algorithm, which achieves better speech enhancement performance than other four baseline methods-Wiener filtering, subspace pursuit(SP), distributed sparsity adaptive matching pursuit(DSAMP), and expectation-maximization Gaussian-model approximate message passing(EM-GAMP) under different compression ratios and a wide range of signal to noise ratios(SNRs).

基于GA-MP的低复杂度OTFS检测算法

针对正交时频空(Orthogonal Time Frequency Space,OTFS)通信系统信号检测复杂度高的问题,提出一种改进的高斯近似消息传递(Gaussian Approximate Message Passing,GA-MP)检测算法。依据最大后验概率检测准则,对发送信号及隐变量进行逐符号高斯近似,基于置信传播算法与联合因子图进行消息传递,用边缘后验概率替代GA-MP中的外部信息以减少运算量,结合阻尼因子提升收敛速度,同时引入概率阈值减少后续更新的节点数,从而使运算复杂度得到有效降低。实验结果表明,改进后的GA-MP算法在保证误码率性能的前提下具有更低的复杂度。

基于混合消息传递和部分高斯近似的联合信道估计MIMO-OFDM接收机

本文提出了一种基于混合消息传递和部分高斯近似(Partial Gaussian Approximation,PGA)的多用户干扰消除方法,并应用到联合信道估计MIMO-OFDM接收机中。由于多用户干扰模型中存在的"乘积-求和"结构,使得选择标准消息传递规则,如置信传播(Belief Propagation,BP),期望传播(Expectation Propagation,EP),平均场规则(Mean Field,MF),或者联合方法时只能在性能或复杂度方面有所取舍。现有根据标准消息传递规则得到的最优性能接收机复杂度高,而近似程度大的低复杂度接收机性能损失严重。本文根据多用户干扰模型的自身特点,对标准消息传递规则进行了修改,提出了一种基于混合消息传递规则和部分高斯近似的多用户干扰消除方法。依据信道估计过程中不同用户的信道权重,采用不同的消息传递规则,可以实现复杂度和性能的均衡调整。仿真结果表明,本文提出的多用户干扰消除方法,在性能接近已知最优接收机的情况下,能够大幅降低复杂度。

一种低复杂度SCMA多用户检测算法

为了进一步降低稀疏码多址接入系统中多用户检测算法的复杂度,提出了一种基于部分资源块高斯近似的多用户检测算法.首先对资源块优势等级进行比较;然后选择译码优势等级高的n个资源块使用加权消息传递算法,剩下的资源块使用高斯近似消息传递算法.同时联合资源块和用户优势等级,在每次迭代后对译码优势等级较高的用户直接译码并剔除,使得后续每轮迭代的复杂度依次降低.仿真结果表明,通过合理选择资源块个数,可以在保证检测性能的同时,有效地降低检测复杂度.因此,提出的算法较好地实现了译码性能和复杂度之间的平衡.

一种改进的图像压缩感知稀疏恢复算法

稀疏信号的分布模型是影响基于近似信息传递(AMP)的压缩感知(CS)信号重建效果的关键因素。因实际图像的小波近似系数、各级的水平细节系数、垂直细节系数以及对角细节系数的模型参数存在较大差异,现有基于拉普拉斯、贝努力高斯(BG)和高斯混合等模型的AMP方法因未考虑此差异而影响重建效果。为了提高模型估计的准确性,将各级小波系数的BG模型参数分开估计,进而提出了一种改进的图像压缩感知稀疏重建的新方法,即期望最大分段贝努力高斯近似信息传递算法(EM-SSBG-AMP)。仿真结果表明,相同采样率下,新算法的峰值信噪比(PSNR)明显高于5阶期望最大高斯混合近似信息传递算法(EM-GM-AMP),重建时间与5阶EM-GM-AMP相当。

基于压缩感知的期望最大化贝努利非对称高斯近似信息传递算法

期望最大化贝努利高斯（BG）近似信息传递（EM-BG-AMP）算法中的BG模型因为具有对称性,在逼近实际信号先验分布时会受到限制;而期望最大化高斯混合近似信息传递（EM-GM-AMP）算法中的GM模型是BG模型的高阶形式,复杂度较高。为了解决以上问题,提出贝努利不对称高斯模型（BAG）,进而推导得到期望最大化贝努利不对称高斯近似信息传递（EM-BAG-AMP）算法。该算法的主要思路是假设输入信号服从BAG模型,然后使用广义近似信息传递（GAMP）重构信号并在算法迭代中同时更新模型参数。实验证明,在处理不同图像数据时,EM-BAG-AMP和EM-BG-AMP相比,时间增加了1.2%,峰值信噪比（PSNR）值提升了0.1~0.5 d B,尤其在处理纹理较少以及色差变化明显的图像时峰值信噪比（PSNR）值提升了0.4~0.5 d B。EM-BAG-AMP是对EM-BG-AMP算法的扩展和延伸,更适合实际信号的处理。

基于临近信息传递算法的大规模MIMO信号检测

为了应对大规模MIMO系统由于天线数量庞大带来信号检测计算复杂度高的问题，提出了改进的临近信息传递算法。首先通过在因子图上建立大规模MIMO概率系统模型实现符号检测；然后通过对干扰信号与噪声进行高斯临近能够降低信息计算的数量与复杂度；最后为了使临近信息传递算法应用在高阶调制系统，采用高斯树临近方法临近信息。通过仿真发现当系统调制方式为BPSK时，两种方法随着天线数量的增加其误码率均逼近最大似然检测器，当系统调制方式为高阶调制（如16QAM）时，高斯树临近方法优于高斯临近。