Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate ...Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.展开更多
Due to limited volume, weight and power consumption, micro-satellite has to reduce data transmission and storage capacity by image compression when performs earth observation missions. However, the quality of images m...Due to limited volume, weight and power consumption, micro-satellite has to reduce data transmission and storage capacity by image compression when performs earth observation missions. However, the quality of images may be unsatisfied. This paper considers the problem of recovering sparse signals by exploiting their unknown sparsity pattern. To model structured sparsity, the prior correlation of the support is encoded by imposing a transformed Gaussian process on the spike and slab probabilities. Then, an efficient approximate message-passing algorithm with structured spike and slab prior is derived for posterior inference, which, combined with a fast direct method, reduces the computational complexity significantly. Further, a unified scheme is developed to learn the hyperparameters using expectation maximization(EM) and Bethe free energy optimization. Simulation results on both synthetic and real data demonstrate the superiority of the proposed algorithm.展开更多
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 passi...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).展开更多
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 lear...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.展开更多
The orthogonal time frequency space(OTFS)modulation has emerged as a promis⁃ing modulation scheme for wireless communications in high-mobility scenarios.An efficient detector is of paramount importance to harvesting t...The orthogonal time frequency space(OTFS)modulation has emerged as a promis⁃ing modulation scheme for wireless communications in high-mobility scenarios.An efficient detector is of paramount importance to harvesting the time and frequency diversities promised by OTFS.Recently,some message passing based detectors have been developed by exploiting the features of the OTFS channel matrices.In this paper,we provide an overview of some re⁃cent message passing based OTFS detectors,compare their performance,and shed some light on potential research on the design of message passing based OTFS receivers.展开更多
When estimating the direction of arrival (DOA) of wideband signals from multiple sources, the performance of sparse Bayesian methods is influenced by the frequency bands occupied by signals in different directions. Th...When estimating the direction of arrival (DOA) of wideband signals from multiple sources, the performance of sparse Bayesian methods is influenced by the frequency bands occupied by signals in different directions. This is particularly true when multiple signal frequency bands overlap. Message passing algorithms (MPA) with Dirichlet process (DP) prior can be employed in a sparse Bayesian learning (SBL) framework with high precision. However, existing methods suffer from either high complexity or low precision. To address this, we propose a low-complexity DOA estimation algorithm based on a factor graph. This approach introduces two strong constraints via a stretching transformation of the factor graph. The first constraint separates the observation from the DP prior, enabling the application of the unitary approximate message passing (UAMP) algorithm for simplified inference and mitigation of divergence issues. The second constraint compensates for the deviation in estimation angle caused by the grid mismatch problem. Compared to state-of-the-art algorithms, our proposed method offers higher estimation accuracy and lower complexity.展开更多
针对现有正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统信道估计和迭代检测算法中频谱效率低和鲁棒性差等问题,提出了一种基于酉近似消息传递和叠加导频的信道估计与联合检测方法。首先,在软调制/解调中叠加导频...针对现有正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统信道估计和迭代检测算法中频谱效率低和鲁棒性差等问题,提出了一种基于酉近似消息传递和叠加导频的信道估计与联合检测方法。首先,在软调制/解调中叠加导频对正交幅度调制的星座点进行预处理,检测时将叠加的导频作为频域符号的先验分布,利用置信传播算法进行调制和解调,实现检测模型的简化。然后,应用因子图-消息传递算法对OFDM传输系统和信道进行建模和全局优化,引入酉变换加强信道估计算法的鲁棒性。最后,建立OFDM仿真环境对现有方法进行仿真分析。仿真结果表明,相对于现有的独立导频类算法,所提算法能够以相同复杂度显著提升OFDM系统的频谱效率和鲁棒性。展开更多
针对正交时频空(Orthogonal Time Frequency Space,OTFS)通信系统信号检测复杂度高的问题,提出一种改进的高斯近似消息传递(Gaussian Approximate Message Passing,GA-MP)检测算法。依据最大后验概率检测准则,对发送信号及隐变量进行逐...针对正交时频空(Orthogonal Time Frequency Space,OTFS)通信系统信号检测复杂度高的问题,提出一种改进的高斯近似消息传递(Gaussian Approximate Message Passing,GA-MP)检测算法。依据最大后验概率检测准则,对发送信号及隐变量进行逐符号高斯近似,基于置信传播算法与联合因子图进行消息传递,用边缘后验概率替代GA-MP中的外部信息以减少运算量,结合阻尼因子提升收敛速度,同时引入概率阈值减少后续更新的节点数,从而使运算复杂度得到有效降低。实验结果表明,改进后的GA-MP算法在保证误码率性能的前提下具有更低的复杂度。展开更多
Orthogonal time frequency space(OTFS)technique, which modulates data symbols in the delayDoppler(DD) domain, presents a potential solution for supporting reliable information transmission in highmobility vehicular net...Orthogonal time frequency space(OTFS)technique, which modulates data symbols in the delayDoppler(DD) domain, presents a potential solution for supporting reliable information transmission in highmobility vehicular networks. In this paper, we study the issues of DD channel estimation for OTFS in the presence of fractional Doppler. We first propose a channel estimation algorithm with both low complexity and high accuracy based on the unitary approximate message passing(UAMP), which exploits the structured sparsity of the effective DD domain channel using hidden Markov model(HMM). The empirical state evolution(SE) analysis is then leveraged to predict the performance of our proposed algorithm. To refine the hyperparameters in the proposed algorithm,we derive the update criterion for the hyperparameters through the expectation-maximization(EM) algorithm. Finally, Our simulation results demonstrate that our proposed algorithm can achieve a significant gain over various baseline schemes.展开更多
针对正交时频空(Orthogonal Time Frequency Space,OTFS)调制系统采用矩形窗函数时,信道矩阵结构复杂导致的鲁棒性差的问题,提出了一种基于时域处理和酉近似消息传递的检测算法。该算法首先添加循环前缀,将时域信道转换为分块对角矩阵;...针对正交时频空(Orthogonal Time Frequency Space,OTFS)调制系统采用矩形窗函数时,信道矩阵结构复杂导致的鲁棒性差的问题,提出了一种基于时域处理和酉近似消息传递的检测算法。该算法首先添加循环前缀,将时域信道转换为分块对角矩阵;然后应用酉变换和近似消息传递建立迭代检测算法。仿真结果表明,所提检测算法能够在不增加复杂度的条件下有效提升检测精度和鲁棒性,特别是存在信道编码的条件下表现出2 dB的性能增益,使得该算法更适用于杂散多径、高速移动等环境,具有较高的应用价值。展开更多
基金supported by NSFC projects(61960206005,61803211,61871111,62101275,62171127,61971136,and 62001056)Jiangsu NSF project(BK20200820)+1 种基金Postgraduate Research&Practice Innovation Program of Jiangsu Province(KYCX210106)Research Fund of National Mobile Communications Research Laboratory.
文摘Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.
基金partially supported by the National Nature Science Foundation of China(Grant No.91438206 and 91638205)supported by Zhejiang Province Natural Science Foundation of China(Grant No.LQ18F010001)
文摘Due to limited volume, weight and power consumption, micro-satellite has to reduce data transmission and storage capacity by image compression when performs earth observation missions. However, the quality of images may be unsatisfied. This paper considers the problem of recovering sparse signals by exploiting their unknown sparsity pattern. To model structured sparsity, the prior correlation of the support is encoded by imposing a transformed Gaussian process on the spike and slab probabilities. Then, an efficient approximate message-passing algorithm with structured spike and slab prior is derived for posterior inference, which, combined with a fast direct method, reduces the computational complexity significantly. Further, a unified scheme is developed to learn the hyperparameters using expectation maximization(EM) and Bethe free energy optimization. Simulation results on both synthetic and real data demonstrate the superiority of the proposed algorithm.
基金supported by National Natural Science Foundation of China(NSFC)(No.61671075)Major Program of National Natural Science Foundation of China(No.61631003)。
文摘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).
文摘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.
基金supported by the National Natural Science Foundation of Chi⁃na(61901417,U1804152,61801434)Science and Technology Re⁃search Project of Henan Province(212102210556,212102210566,212400410179).
文摘The orthogonal time frequency space(OTFS)modulation has emerged as a promis⁃ing modulation scheme for wireless communications in high-mobility scenarios.An efficient detector is of paramount importance to harvesting the time and frequency diversities promised by OTFS.Recently,some message passing based detectors have been developed by exploiting the features of the OTFS channel matrices.In this paper,we provide an overview of some re⁃cent message passing based OTFS detectors,compare their performance,and shed some light on potential research on the design of message passing based OTFS receivers.
基金supported in part by the National Natural Science Foundation of China(Nos.6202780103 and 62033001)the Innovation Key Project of Guangxi Province(No.AA22068059)+2 种基金the Key Research and Development Program of Guilin(No.2020010332)the Natural Science Foundation of Henan Province(No.222300420504)Academic Degrees and Graduate Education Reform Project of Henan Province(No.2021SJGLX262Y).
文摘When estimating the direction of arrival (DOA) of wideband signals from multiple sources, the performance of sparse Bayesian methods is influenced by the frequency bands occupied by signals in different directions. This is particularly true when multiple signal frequency bands overlap. Message passing algorithms (MPA) with Dirichlet process (DP) prior can be employed in a sparse Bayesian learning (SBL) framework with high precision. However, existing methods suffer from either high complexity or low precision. To address this, we propose a low-complexity DOA estimation algorithm based on a factor graph. This approach introduces two strong constraints via a stretching transformation of the factor graph. The first constraint separates the observation from the DP prior, enabling the application of the unitary approximate message passing (UAMP) algorithm for simplified inference and mitigation of divergence issues. The second constraint compensates for the deviation in estimation angle caused by the grid mismatch problem. Compared to state-of-the-art algorithms, our proposed method offers higher estimation accuracy and lower complexity.
文摘针对现有正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统信道估计和迭代检测算法中频谱效率低和鲁棒性差等问题,提出了一种基于酉近似消息传递和叠加导频的信道估计与联合检测方法。首先,在软调制/解调中叠加导频对正交幅度调制的星座点进行预处理,检测时将叠加的导频作为频域符号的先验分布,利用置信传播算法进行调制和解调,实现检测模型的简化。然后,应用因子图-消息传递算法对OFDM传输系统和信道进行建模和全局优化,引入酉变换加强信道估计算法的鲁棒性。最后,建立OFDM仿真环境对现有方法进行仿真分析。仿真结果表明,相对于现有的独立导频类算法,所提算法能够以相同复杂度显著提升OFDM系统的频谱效率和鲁棒性。
文摘针对正交时频空(Orthogonal Time Frequency Space,OTFS)通信系统信号检测复杂度高的问题,提出一种改进的高斯近似消息传递(Gaussian Approximate Message Passing,GA-MP)检测算法。依据最大后验概率检测准则,对发送信号及隐变量进行逐符号高斯近似,基于置信传播算法与联合因子图进行消息传递,用边缘后验概率替代GA-MP中的外部信息以减少运算量,结合阻尼因子提升收敛速度,同时引入概率阈值减少后续更新的节点数,从而使运算复杂度得到有效降低。实验结果表明,改进后的GA-MP算法在保证误码率性能的前提下具有更低的复杂度。
基金supported by the Key Scientific Research Project in Colleges and Universities of Henan Province of China(Grant Nos.21A510003)Science and the Key Science and Technology Research Project of Henan Province of China(Grant Nos.222102210053)。
文摘Orthogonal time frequency space(OTFS)technique, which modulates data symbols in the delayDoppler(DD) domain, presents a potential solution for supporting reliable information transmission in highmobility vehicular networks. In this paper, we study the issues of DD channel estimation for OTFS in the presence of fractional Doppler. We first propose a channel estimation algorithm with both low complexity and high accuracy based on the unitary approximate message passing(UAMP), which exploits the structured sparsity of the effective DD domain channel using hidden Markov model(HMM). The empirical state evolution(SE) analysis is then leveraged to predict the performance of our proposed algorithm. To refine the hyperparameters in the proposed algorithm,we derive the update criterion for the hyperparameters through the expectation-maximization(EM) algorithm. Finally, Our simulation results demonstrate that our proposed algorithm can achieve a significant gain over various baseline schemes.
文摘针对正交时频空(Orthogonal Time Frequency Space,OTFS)调制系统采用矩形窗函数时,信道矩阵结构复杂导致的鲁棒性差的问题,提出了一种基于时域处理和酉近似消息传递的检测算法。该算法首先添加循环前缀,将时域信道转换为分块对角矩阵;然后应用酉变换和近似消息传递建立迭代检测算法。仿真结果表明,所提检测算法能够在不增加复杂度的条件下有效提升检测精度和鲁棒性,特别是存在信道编码的条件下表现出2 dB的性能增益,使得该算法更适用于杂散多径、高速移动等环境,具有较高的应用价值。
