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.展开更多
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.展开更多
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 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.展开更多
Aiming at the problems of unreliable data transmission,poor steadiness,nonsupport of complex data types,direct couple between data transmission and exchange,a high-level method based on advanced message queuing protoc...Aiming at the problems of unreliable data transmission,poor steadiness,nonsupport of complex data types,direct couple between data transmission and exchange,a high-level method based on advanced message queuing protocol( AMQP) is proposed to integrate naval distributed tactical training simulation system after serious consideration with current information exchange features of military combat system. Transferring layer in traditional user datagram protocol is implemented by publishing and subscribing scheme of message middleware. By creating message model to standardize message structure,integration architecture is formulated to resolve potential information security risks from inconsistent data type and express data transmission. Meanwhile,a communication model is put forward based on AMQP,which is in the center position of the whole transmission framework and responsible for reliably transferring battlefield data among subsystems. Experiments show that the method can accurately post amounts of data to the subscriber without error and loss,and can get excellent real-time performance of data exchange.展开更多
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.展开更多
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).展开更多
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.展开更多
Supervisory control is a very popular paradigm for computer-controlled systems. Knowledge and tracking the control effect of every control operation is crucial to the control tasks. In the paper, we present a message-...Supervisory control is a very popular paradigm for computer-controlled systems. Knowledge and tracking the control effect of every control operation is crucial to the control tasks. In the paper, we present a message-array-based mechanism to track control effects in supervisory control software. A novel data type, message array, is designed to efficiently support this tracking mechanism. The operation algorithms, adding algorithm (AA), removing algorithm (RA), and scheduler algorithm (SA) are proposed to operate the tracking messages in message array, which forms the special first input X output (FIXO) strategy of message array. Automatically tracking, recording, and rolling back are the characteristics of our tracking mechanism. We implement this messagearray-based mechanism on the famous human machine interface (HMI) software platform-proficy iFix, and construct experiments to evaluate the performance of the mechanism in various cases. The results show our mechanism can be well satisfied with supervisory control software.展开更多
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.展开更多
Orthogonal time frequency space(OTFS)technique,which modulates data symbols in the delay-Doppler(DD)domain,presents a potential solution for supporting reliable information transmission in highmobility vehicular netwo...Orthogonal time frequency space(OTFS)technique,which modulates data symbols in the delay-Doppler(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.展开更多
基金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.
基金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.
基金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.
基金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.
基金Supported by the National Natural Science Foundation of China(No.61401496)
文摘Aiming at the problems of unreliable data transmission,poor steadiness,nonsupport of complex data types,direct couple between data transmission and exchange,a high-level method based on advanced message queuing protocol( AMQP) is proposed to integrate naval distributed tactical training simulation system after serious consideration with current information exchange features of military combat system. Transferring layer in traditional user datagram protocol is implemented by publishing and subscribing scheme of message middleware. By creating message model to standardize message structure,integration architecture is formulated to resolve potential information security risks from inconsistent data type and express data transmission. Meanwhile,a communication model is put forward based on AMQP,which is in the center position of the whole transmission framework and responsible for reliably transferring battlefield data among subsystems. Experiments show that the method can accurately post amounts of data to the subscriber without error and loss,and can get excellent real-time performance of data exchange.
基金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.
基金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).
文摘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.
文摘Supervisory control is a very popular paradigm for computer-controlled systems. Knowledge and tracking the control effect of every control operation is crucial to the control tasks. In the paper, we present a message-array-based mechanism to track control effects in supervisory control software. A novel data type, message array, is designed to efficiently support this tracking mechanism. The operation algorithms, adding algorithm (AA), removing algorithm (RA), and scheduler algorithm (SA) are proposed to operate the tracking messages in message array, which forms the special first input X output (FIXO) strategy of message array. Automatically tracking, recording, and rolling back are the characteristics of our tracking mechanism. We implement this messagearray-based mechanism on the famous human machine interface (HMI) software platform-proficy iFix, and construct experiments to evaluate the performance of the mechanism in various cases. The results show our mechanism can be well satisfied with supervisory control software.
基金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 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 delay-Doppler(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.