In this paper,we focus on the channel estimation for multi-user MIMO-OFDM systems in rich scattering environments.We find that channel sparsity in the delay-angle domain is severely compromised in rich scattering envi...In this paper,we focus on the channel estimation for multi-user MIMO-OFDM systems in rich scattering environments.We find that channel sparsity in the delay-angle domain is severely compromised in rich scattering environments,so that most existing compressed sensing(CS)based techniques can harvest a very limited gain(if any)in reducing the channel estimation overhead.To address the problem,we propose the learning-based turbo message passing(LTMP)algorithm.Instead of exploiting the channel sparsity,LTMP is able to efficiently extract the channel feature via deep learning as well as to exploit the channel continuity in the frequency domain via block-wise linear modelling.More specifically,as a component of LTMP,we develop a multi-scale parallel dilated convolutional neural network(MPDCNN),which leverages frequency-space channel correlation in different scales for channel denoising.We evaluate the LTMP’s performance in MIMO-OFDM channels using the 3rd generation partnership project(3GPP)clustered delay line(CDL)channel models.Simulation results show that the proposed channel estimation method has more than 5 dB power gain than the existing algorithms when the normalized mean-square error of the channel estimation is-20 dB.The proposed algorithm also exhibits strong robustness in various environments.展开更多
This paper investigates the fundamental data detection problem with burst interference in massive multiple-input multiple-output orthogonal frequency division multiplexing(MIMO-OFDM) systems. In particular, burst inte...This paper investigates the fundamental data detection problem with burst interference in massive multiple-input multiple-output orthogonal frequency division multiplexing(MIMO-OFDM) systems. In particular, burst interference may occur only on data symbols but not on pilot symbols, which means that interference information cannot be premeasured. To cancel the burst interference, we first revisit the uplink multi-user system and develop a matrixform system model, where the covariance pattern and the low-rank property of the interference matrix is discussed. Then, we propose a turbo message passing based burst interference cancellation(TMP-BIC) algorithm to solve the data detection problem, where the constellation information of target data is fully exploited to refine its estimate. Furthermore, in the TMP-BIC algorithm, we design one module to cope with the interference matrix by exploiting its lowrank property. Numerical results demonstrate that the proposed algorithm can effectively mitigate the adverse effects of burst interference and approach the interference-free bound.展开更多
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.展开更多
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.展开更多
Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerf...Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerful toolkit in tackling hard computational tasks in optimization,inference,and learning problems.In the context of constraint satisfaction problems(CSPs),when a control parameter(such as constraint density)is tuned,multiple threshold phenomena emerge,signaling fundamental structural transitions in their solution space.Finding solutions around these transition points is exceedingly challenging for algorithm design,where message passing algorithms suffer from a large message fiuctuation far from convergence.Here we introduce a residual-based updating step into message passing algorithms,in which messages with large variation between consecutive steps are given high priority in the updating process.For the specific example of model RB(revised B),a typical prototype of random CSPs with growing domains,we show that our algorithm improves the convergence of message updating and increases the success probability in finding solutions around the satisfiability threshold with a low computational cost.Our approach to message passing algorithms should be of value for exploring their power in developing algorithms to find ground-state solutions and understand the detailed structure of solution space of hard optimization problems.展开更多
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).展开更多
Relative navigation is a key feature in the joint tactical information distribution system（JTIDS）.A parametric message passing algorithm based on factor graph is proposed to perform relative navigation in JTIDS.Firs...Relative navigation is a key feature in the joint tactical information distribution system（JTIDS）.A parametric message passing algorithm based on factor graph is proposed to perform relative navigation in JTIDS.First of all,the joint posterior distribution of all the terminals＇ positions is represented by factor graph.Because of the nonlinearity between the positions and time-of-arrival（TOA） measurement,messages cannot be obtained in closed forms by directly using the sum-product algorithm on factor graph.To this end,the Euclidean norm is approximated by Taylor expansion.Then,all the messages on the factor graph can be derived in Gaussian forms,which enables the terminals to transmit means and covariances.Finally,the impact of major error sources on the navigation performance are evaluated by Monte Carlo simulations,e.g.,range measurement noise,priors of position uncertainty and velocity noise.Results show that the proposed algorithm outperforms the extended Kalman filter and cooperative extended Kalman filter in both static and mobile scenarios of the JTIDS.展开更多
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.展开更多
The development of deep learning has made non-biochemical methods for molecular property prediction screening a reality,which can increase the experimental speed and reduce the experimental cost of relevant experiment...The development of deep learning has made non-biochemical methods for molecular property prediction screening a reality,which can increase the experimental speed and reduce the experimental cost of relevant experiments.There are currently two main approaches to representing molecules:(a)representing molecules by fixing molecular descriptors,and(b)representing molecules by graph convolutional neural networks.Currently,both of these Representative methods have achieved some results in their respective experiments.Based on past efforts,we propose a Dual Self-attention Fusion Message Neural Network(DSFMNN).DSFMNN uses a combination of dual self-attention mechanism and graph convolutional neural network.Advantages of DSFMNN:(1)The dual self-attention mechanism focuses not only on the relationship between individual subunits in a molecule but also on the relationship between the atoms and chemical bonds contained in each subunit.(2)On the directed molecular graph,a message delivery approach centered on directed molecular bonds is used.We test the performance of the model on eight publicly available datasets and compare the performance with several models.Based on the current experimental results,DSFMNN has superior performance compared to previous models on the datasets applied in this paper.展开更多
Watermarking system based on quantization index modulation （QIM） is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronizati...Watermarking system based on quantization index modulation （QIM） is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronization attacks of QIM digital watermarking,a low density parity check （LDPC） code-aided QIM watermarking algorithm is proposed,and the performance of QIM watermarking system can be improved by incorporating LDPC code with message passing estimation/detection framework.Using the theory of iterative estimation and decoding,the watermark signal is decoded by the proposed algorithm through iterative estimation of amplitude scaling parameters and decoding of watermark.The performance of the proposed algorithm is closer to the dirty paper Shannon limit than that of repetition code aided algorithm when the algorithm is attacked by the additive white Gaussian noise.For constant amplitude scaling attacks,the proposed algorithm can obtain the accurate estimation of amplitude scaling parameters.The simulation result shows that the algorithm can obtain similar performance compared to the algorithm without desynchronization.展开更多
The alternate-direction implicit finite difference beam propagation method （FD-BPM） is used to analyze the two-dimensional （2D） symmetrical multimode interference （MMI） couplers. The positions of the images at t...The alternate-direction implicit finite difference beam propagation method （FD-BPM） is used to analyze the two-dimensional （2D） symmetrical multimode interference （MMI） couplers. The positions of the images at the output plane and the length of multimode waveguide are accurately determined numerically. In order to reduce calculation time, the parallel processing of the arithmetic is implemented by the message passing interface and the simulation is accomplished by eight personal computers.展开更多
Implementing video applications on emerging multi-core processors is a promising technique for personal, real-time multi-media applications. However, when porting the legacy parallel video encoders developed for clust...Implementing video applications on emerging multi-core processors is a promising technique for personal, real-time multi-media applications. However, when porting the legacy parallel video encoders developed for clusters to shared-memory multi-cores, the existing parallel algorithms result in workload imbalances on different cores and communication inefficiencies. This paper describes a strip-wise parallel scheme to balance workloads and a hybrid communication mechanism to reduce communication overhead. The implementation of the H.264 parallel encoder on an eight CPU Intel Xeon system achieves 5x to 6x speed-up over a single thread encoder and achieves a 29% performance improvement over the commonly used master-slave schemes on clusters. The paper also gives further analysis on scalability, parallel efficiency, workload balance, and communication overhead as the number of cores varies.展开更多
In this paper the limitations of the standard Message Passing Interface (MPI) are analyzed, then the technique of multithreading is introduced and a stand alone LWP (light weight process) extension to MPI is impleme...In this paper the limitations of the standard Message Passing Interface (MPI) are analyzed, then the technique of multithreading is introduced and a stand alone LWP (light weight process) extension to MPI is implemented. Experimental results show that system overhead is considerably diminished.展开更多
In this paper,an index modulation(IM)aided uplink orthogonal time frequency space modulation(OTFS)structure for sparse code multiple access(SCMA)is proposed.To be more specific,the information bits are firstly partiti...In this paper,an index modulation(IM)aided uplink orthogonal time frequency space modulation(OTFS)structure for sparse code multiple access(SCMA)is proposed.To be more specific,the information bits are firstly partitioned for transmit antenna(TA)selection and sparse codeword mapping,respectively.Subsequently,the codewords deployed on the 2-dimensional(2D)delay-Doppler(DD)plane are transmitted by the selected TA,and the superimposed signals are jointly detected at the receiver.Furthermore,a low-complexity zero-embedded expectation propagation(ZE-EP)detector is conceived,where the codebooks are extended with zero vectors to reflect the silent indices.The simulation results demonstrate that the proposed IM-OTFS-SCMA system is capable of providing significant performance gain over the OTFS-SCMA counterpart.展开更多
In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the e...In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.展开更多
The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has bec...The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.展开更多
The high-resolution DEM-IMB-LBM model can accurately describe pore-scale fluid-solid interactions,but its potential for use in geotechnical engineering analysis has not been fully unleashed due to its prohibitive comp...The high-resolution DEM-IMB-LBM model can accurately describe pore-scale fluid-solid interactions,but its potential for use in geotechnical engineering analysis has not been fully unleashed due to its prohibitive computational costs.To overcome this limitation,a message passing interface(MPI)parallel DEM-IMB-LBM framework is proposed aimed at enhancing computation efficiency.This framework utilises a static domain decomposition scheme,with the entire computation domain being decomposed into multiple subdomains according to predefined processors.A detailed parallel strategy is employed for both contact detection and hydrodynamic force calculation.In particular,a particle ID re-numbering scheme is proposed to handle particle transitions across sub-domain interfaces.Two benchmarks are conducted to validate the accuracy and overall performance of the proposed framework.Subsequently,the framework is applied to simulate scenarios involving multi-particle sedimentation and submarine landslides.The numerical examples effectively demonstrate the robustness and applicability of the MPI parallel DEM-IMB-LBM framework.展开更多
The Message Passing Interface (MPI) is a widely accepted standard for parallel computing on distributed memorysystems.However, MPI implementations can contain defects that impact the reliability and performance of par...The Message Passing Interface (MPI) is a widely accepted standard for parallel computing on distributed memorysystems.However, MPI implementations can contain defects that impact the reliability and performance of parallelapplications. Detecting and correcting these defects is crucial, yet there is a lack of published models specificallydesigned for correctingMPI defects. To address this, we propose a model for detecting and correcting MPI defects(DC_MPI), which aims to detect and correct defects in various types of MPI communication, including blockingpoint-to-point (BPTP), nonblocking point-to-point (NBPTP), and collective communication (CC). The defectsaddressed by the DC_MPI model include illegal MPI calls, deadlocks (DL), race conditions (RC), and messagemismatches (MM). To assess the effectiveness of the DC_MPI model, we performed experiments on a datasetconsisting of 40 MPI codes. The results indicate that the model achieved a detection rate of 37 out of 40 codes,resulting in an overall detection accuracy of 92.5%. Additionally, the execution duration of the DC_MPI modelranged from 0.81 to 1.36 s. These findings show that the DC_MPI model is useful in detecting and correctingdefects in MPI implementations, thereby enhancing the reliability and performance of parallel applications. TheDC_MPImodel fills an important research gap and provides a valuable tool for improving the quality ofMPI-basedparallel computing systems.展开更多
基金supported in part by the National Key Research and Development Program of China under Grant 2020YFB1804800.
文摘In this paper,we focus on the channel estimation for multi-user MIMO-OFDM systems in rich scattering environments.We find that channel sparsity in the delay-angle domain is severely compromised in rich scattering environments,so that most existing compressed sensing(CS)based techniques can harvest a very limited gain(if any)in reducing the channel estimation overhead.To address the problem,we propose the learning-based turbo message passing(LTMP)algorithm.Instead of exploiting the channel sparsity,LTMP is able to efficiently extract the channel feature via deep learning as well as to exploit the channel continuity in the frequency domain via block-wise linear modelling.More specifically,as a component of LTMP,we develop a multi-scale parallel dilated convolutional neural network(MPDCNN),which leverages frequency-space channel correlation in different scales for channel denoising.We evaluate the LTMP’s performance in MIMO-OFDM channels using the 3rd generation partnership project(3GPP)clustered delay line(CDL)channel models.Simulation results show that the proposed channel estimation method has more than 5 dB power gain than the existing algorithms when the normalized mean-square error of the channel estimation is-20 dB.The proposed algorithm also exhibits strong robustness in various environments.
基金supported by the National Key Laboratory of Wireless Communications Foundation,China (IFN20230204)。
文摘This paper investigates the fundamental data detection problem with burst interference in massive multiple-input multiple-output orthogonal frequency division multiplexing(MIMO-OFDM) systems. In particular, burst interference may occur only on data symbols but not on pilot symbols, which means that interference information cannot be premeasured. To cancel the burst interference, we first revisit the uplink multi-user system and develop a matrixform system model, where the covariance pattern and the low-rank property of the interference matrix is discussed. Then, we propose a turbo message passing based burst interference cancellation(TMP-BIC) algorithm to solve the data detection problem, where the constellation information of target data is fully exploited to refine its estimate. Furthermore, in the TMP-BIC algorithm, we design one module to cope with the interference matrix by exploiting its lowrank property. Numerical results demonstrate that the proposed algorithm can effectively mitigate the adverse effects of burst interference and approach the interference-free bound.
文摘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 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 Guangdong Major Project of Basic and Applied Basic Research No.2020B0301030008Science and Technology Program of Guangzhou No.2019050001+2 种基金the Chinese Academy of Sciences Grant QYZDJ-SSWSYS018the National Natural Science Foundation of China(Grant No.12171479)supported by the National Natural Science Foundation of China(Grant Nos.11301339 and 11491240108)。
文摘Message passing algorithms,whose iterative nature captures complicated interactions among interconnected variables in complex systems and extracts information from the fixed point of iterated messages,provide a powerful toolkit in tackling hard computational tasks in optimization,inference,and learning problems.In the context of constraint satisfaction problems(CSPs),when a control parameter(such as constraint density)is tuned,multiple threshold phenomena emerge,signaling fundamental structural transitions in their solution space.Finding solutions around these transition points is exceedingly challenging for algorithm design,where message passing algorithms suffer from a large message fiuctuation far from convergence.Here we introduce a residual-based updating step into message passing algorithms,in which messages with large variation between consecutive steps are given high priority in the updating process.For the specific example of model RB(revised B),a typical prototype of random CSPs with growing domains,we show that our algorithm improves the convergence of message updating and increases the success probability in finding solutions around the satisfiability threshold with a low computational cost.Our approach to message passing algorithms should be of value for exploring their power in developing algorithms to find ground-state solutions and understand the detailed structure of solution space of hard optimization problems.
基金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).
基金supported by the National Natural Science Foundation of China(6120118161471037+1 种基金61571041)the Foundation for the Author of National Excellent Doctoral Dissertation of China(201445)
文摘Relative navigation is a key feature in the joint tactical information distribution system（JTIDS）.A parametric message passing algorithm based on factor graph is proposed to perform relative navigation in JTIDS.First of all,the joint posterior distribution of all the terminals＇ positions is represented by factor graph.Because of the nonlinearity between the positions and time-of-arrival（TOA） measurement,messages cannot be obtained in closed forms by directly using the sum-product algorithm on factor graph.To this end,the Euclidean norm is approximated by Taylor expansion.Then,all the messages on the factor graph can be derived in Gaussian forms,which enables the terminals to transmit means and covariances.Finally,the impact of major error sources on the navigation performance are evaluated by Monte Carlo simulations,e.g.,range measurement noise,priors of position uncertainty and velocity noise.Results show that the proposed algorithm outperforms the extended Kalman filter and cooperative extended Kalman filter in both static and mobile scenarios of the JTIDS.
基金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.
文摘The development of deep learning has made non-biochemical methods for molecular property prediction screening a reality,which can increase the experimental speed and reduce the experimental cost of relevant experiments.There are currently two main approaches to representing molecules:(a)representing molecules by fixing molecular descriptors,and(b)representing molecules by graph convolutional neural networks.Currently,both of these Representative methods have achieved some results in their respective experiments.Based on past efforts,we propose a Dual Self-attention Fusion Message Neural Network(DSFMNN).DSFMNN uses a combination of dual self-attention mechanism and graph convolutional neural network.Advantages of DSFMNN:(1)The dual self-attention mechanism focuses not only on the relationship between individual subunits in a molecule but also on the relationship between the atoms and chemical bonds contained in each subunit.(2)On the directed molecular graph,a message delivery approach centered on directed molecular bonds is used.We test the performance of the model on eight publicly available datasets and compare the performance with several models.Based on the current experimental results,DSFMNN has superior performance compared to previous models on the datasets applied in this paper.
基金National Natural Science Foundation of China(No.61272432)Qingdao Science and Technology Development Plan(No.12-1-4-6-(10)-jch)
文摘Watermarking system based on quantization index modulation （QIM） is increasingly popular in high payload applications,but it is inherently fragile against amplitude scaling attacks.In order to resist desynchronization attacks of QIM digital watermarking,a low density parity check （LDPC） code-aided QIM watermarking algorithm is proposed,and the performance of QIM watermarking system can be improved by incorporating LDPC code with message passing estimation/detection framework.Using the theory of iterative estimation and decoding,the watermark signal is decoded by the proposed algorithm through iterative estimation of amplitude scaling parameters and decoding of watermark.The performance of the proposed algorithm is closer to the dirty paper Shannon limit than that of repetition code aided algorithm when the algorithm is attacked by the additive white Gaussian noise.For constant amplitude scaling attacks,the proposed algorithm can obtain the accurate estimation of amplitude scaling parameters.The simulation result shows that the algorithm can obtain similar performance compared to the algorithm without desynchronization.
文摘The alternate-direction implicit finite difference beam propagation method （FD-BPM） is used to analyze the two-dimensional （2D） symmetrical multimode interference （MMI） couplers. The positions of the images at the output plane and the length of multimode waveguide are accurately determined numerically. In order to reduce calculation time, the parallel processing of the arithmetic is implemented by the message passing interface and the simulation is accomplished by eight personal computers.
基金Supported by the National Natural Science Foundation of China(No. 60236020)
文摘Implementing video applications on emerging multi-core processors is a promising technique for personal, real-time multi-media applications. However, when porting the legacy parallel video encoders developed for clusters to shared-memory multi-cores, the existing parallel algorithms result in workload imbalances on different cores and communication inefficiencies. This paper describes a strip-wise parallel scheme to balance workloads and a hybrid communication mechanism to reduce communication overhead. The implementation of the H.264 parallel encoder on an eight CPU Intel Xeon system achieves 5x to 6x speed-up over a single thread encoder and achieves a 29% performance improvement over the commonly used master-slave schemes on clusters. The paper also gives further analysis on scalability, parallel efficiency, workload balance, and communication overhead as the number of cores varies.
文摘In this paper the limitations of the standard Message Passing Interface (MPI) are analyzed, then the technique of multithreading is introduced and a stand alone LWP (light weight process) extension to MPI is implemented. Experimental results show that system overhead is considerably diminished.
基金supported in part by the National Key Research and Development Program of China with Grant number 2021YFB2900502。
文摘In this paper,an index modulation(IM)aided uplink orthogonal time frequency space modulation(OTFS)structure for sparse code multiple access(SCMA)is proposed.To be more specific,the information bits are firstly partitioned for transmit antenna(TA)selection and sparse codeword mapping,respectively.Subsequently,the codewords deployed on the 2-dimensional(2D)delay-Doppler(DD)plane are transmitted by the selected TA,and the superimposed signals are jointly detected at the receiver.Furthermore,a low-complexity zero-embedded expectation propagation(ZE-EP)detector is conceived,where the codebooks are extended with zero vectors to reflect the silent indices.The simulation results demonstrate that the proposed IM-OTFS-SCMA system is capable of providing significant performance gain over the OTFS-SCMA counterpart.
文摘In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.
文摘The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.
基金financially supported by the National Natural Science Foundation of China(Grant Nos.12072217 and 42077254)the Natural Science Foundation of Hunan Province,China(Grant No.2022JJ30567).
文摘The high-resolution DEM-IMB-LBM model can accurately describe pore-scale fluid-solid interactions,but its potential for use in geotechnical engineering analysis has not been fully unleashed due to its prohibitive computational costs.To overcome this limitation,a message passing interface(MPI)parallel DEM-IMB-LBM framework is proposed aimed at enhancing computation efficiency.This framework utilises a static domain decomposition scheme,with the entire computation domain being decomposed into multiple subdomains according to predefined processors.A detailed parallel strategy is employed for both contact detection and hydrodynamic force calculation.In particular,a particle ID re-numbering scheme is proposed to handle particle transitions across sub-domain interfaces.Two benchmarks are conducted to validate the accuracy and overall performance of the proposed framework.Subsequently,the framework is applied to simulate scenarios involving multi-particle sedimentation and submarine landslides.The numerical examples effectively demonstrate the robustness and applicability of the MPI parallel DEM-IMB-LBM framework.
基金the Deanship of Scientific Research at King Abdulaziz University,Jeddah,Saudi Arabia under the Grant No.RG-12-611-43.
文摘The Message Passing Interface (MPI) is a widely accepted standard for parallel computing on distributed memorysystems.However, MPI implementations can contain defects that impact the reliability and performance of parallelapplications. Detecting and correcting these defects is crucial, yet there is a lack of published models specificallydesigned for correctingMPI defects. To address this, we propose a model for detecting and correcting MPI defects(DC_MPI), which aims to detect and correct defects in various types of MPI communication, including blockingpoint-to-point (BPTP), nonblocking point-to-point (NBPTP), and collective communication (CC). The defectsaddressed by the DC_MPI model include illegal MPI calls, deadlocks (DL), race conditions (RC), and messagemismatches (MM). To assess the effectiveness of the DC_MPI model, we performed experiments on a datasetconsisting of 40 MPI codes. The results indicate that the model achieved a detection rate of 37 out of 40 codes,resulting in an overall detection accuracy of 92.5%. Additionally, the execution duration of the DC_MPI modelranged from 0.81 to 1.36 s. These findings show that the DC_MPI model is useful in detecting and correctingdefects in MPI implementations, thereby enhancing the reliability and performance of parallel applications. TheDC_MPImodel fills an important research gap and provides a valuable tool for improving the quality ofMPI-basedparallel computing systems.
