Turbo Message Passing Based Burst Interference Cancellation for Data Detection in Massive MIMO-OFDM Systems

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.

Vector Approximate Message Passing with Sparse Bayesian Learning for Gaussian Mixture Prior

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.

An MPI parallel DEM-IMB-LBM framework for simulating fluid-solid interaction problems

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.

Static Analysis Techniques for Fixing Software Defects in MPI-Based Parallel Programs

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.

An End-To-End Hyperbolic Deep Graph Convolutional Neural Network Framework

Graph Convolutional Neural Networks(GCNs)have been widely used in various fields due to their powerful capabilities in processing graph-structured data.However,GCNs encounter significant challenges when applied to scale-free graphs with power-law distributions,resulting in substantial distortions.Moreover,most of the existing GCN models are shallow structures,which restricts their ability to capture dependencies among distant nodes and more refined high-order node features in scale-free graphs with hierarchical structures.To more broadly and precisely apply GCNs to real-world graphs exhibiting scale-free or hierarchical structures and utilize multi-level aggregation of GCNs for capturing high-level information in local representations,we propose the Hyperbolic Deep Graph Convolutional Neural Network(HDGCNN),an end-to-end deep graph representation learning framework that can map scale-free graphs from Euclidean space to hyperbolic space.In HDGCNN,we define the fundamental operations of deep graph convolutional neural networks in hyperbolic space.Additionally,we introduce a hyperbolic feature transformation method based on identity mapping and a dense connection scheme based on a novel non-local message passing framework.In addition,we present a neighborhood aggregation method that combines initial structural featureswith hyperbolic attention coefficients.Through the above methods,HDGCNN effectively leverages both the structural features and node features of graph data,enabling enhanced exploration of non-local structural features and more refined node features in scale-free or hierarchical graphs.Experimental results demonstrate that HDGCNN achieves remarkable performance improvements over state-ofthe-art GCNs in node classification and link prediction tasks,even when utilizing low-dimensional embedding representations.Furthermore,when compared to shallow hyperbolic graph convolutional neural network models,HDGCNN exhibits notable advantages and performance enhancements.

UAMP-Based Delay-Doppler Channel Estimation for OTFS Systems

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.

QIM digital watermarkingbased on LDPC code and messagepassingunder scalingattacks

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.

Efficient Recovery of Structured Sparse Signals via Approximate Message Passing with Structured Spike and Slab Prior

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.

Speech Enhancement Based on Approximate Message Passing

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

Parametric message passing-based relative navigation in joint tactical information distribution system

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.

Thread-Oriented Message-Passing Interface

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.

Message Passing Based Detection for Orthogonal Time Frequency Space Modulation

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.

Multi-Panel Extra-Large Scale MIMO Based Joint Activity Detection and Channel Estimation for Near-Field Massive IoT Access

The extra-large scale multiple-input multiple-output(XL-MIMO)for the beyond fifth/sixth generation mobile communications is a promising technology to provide Tbps data transmission and stable access service.However,the extremely large antenna array aperture arouses the channel near-field effect,resulting in the deteriorated data rate and other challenges in the practice communication systems.Meanwhile,multi-panel MIMO technology has attracted extensive attention due to its flexible configuration,low hardware cost,and wider coverage.By combining the XL-MIMO and multi-panel array structure,we construct multi-panel XL-MIMO and apply it to massive Internet of Things(IoT)access.First,we model the multi-panel XL-MIMO-based near-field channels for massive IoT access scenarios,where the electromagnetic waves corresponding to different panels have different angles of arrival/departure(AoAs/AoDs).Then,by exploiting the sparsity of the near-field massive IoT access channels,we formulate a compressed sensing based joint active user detection(AUD)and channel estimation(CE)problem which is solved by AMP-EM-MMV algorithm.The simulation results exhibit the superiority of the AMP-EM-MMV based joint AUD and CE scheme over the baseline algorithms.

UAMP-Based Delay-Doppler Channel Estimation for OTFS Systems

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.

Iterative Receiver for Orthogonal Time Frequency Space with Index Modulation via Structured Prior-Based Hybrid Belief and Expectation Propagation

Orthogonal Time Frequency Space(OTFS)signaling with index modulation(IM)is a promising transmission scheme characterized by high transmission efficiency for high mobility scenarios.In this paper,we study the receiver for coded OTFS-IM system.First,we construct the corresponding factor graph,on which the structured prior incorporating activation pattern constraint and channel coding is devised.Then we develop a iterative receiver via structured prior-based hybrid belief propagation(BP)and expectation propagation(EP)algorithm,named as StrBP-EP,for the coded OTFS-IM system.To reduce the computational complexity of discrete distribution introduced by structured prior,Gaussian approximation conducted by EP is adopted.To further reduce the complexity,we derive two variations of the proposed algorithm by using some approximations.Simulation results validate the superior performance of the proposed algorithm.

Model-Driven Deep Learning for Massive Space-Domain Index Modulation MIMO Detection

In this paper,a powerful model-driven deep learning framework is exploited to overcome the challenge of multi-domain signal detection in spacedomain index modulation(SDIM)based multiple input multiple output(MIMO)systems.Specifically,we use orthogonal approximate message passing(OAMP)technique to develop OAMPNet,which is a novel signal recovery mechanism in the field of compressed sensing that effectively uses the sparse property from the training SDIM samples.For OAMPNet,the prior probability of the transmit signal has a significant impact on the obtainable performance.For this reason,in our design,we first derive the prior probability of transmitting signals on each antenna for SDIMMIMO systems,which is different from the conventional massive MIMO systems.Then,for massive MIMO scenarios,we propose two novel algorithms to avoid pre-storing all active antenna combinations,thus considerably improving the memory efficiency and reducing the related overhead.Our simulation results show that the proposed framework outperforms the conventional optimization-driven based detection algorithms and has strong robustness under different antenna scales.

Combined UAMP and MF Message Passing Algorithm for Multi-Target Wideband DOA Estimation with Dirichlet Process Prior

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.

Development of Ubiquitous Simulation Service Structure Based on High Performance Computing Technologies

The simulation field became essential in designing or developing new casting products and in improving manufacturing processes within limited time, because it can help us to simulate the nature of processing, so that developers can make ideal casting designs. To take the prior occupation at commercial simulation market, so many development groups in the world are doing their every effort. They already reported successful stories in manufacturing fields by developing and providing the high performance simulation technologies for multipurpose. But they all run at powerful desk-side computers by well-trained experts mainly, so that it is hard to diffuse the scientific designing concept to newcomers in casting field. To overcome upcoming problems in scientific casting designs, we utilized information technologies and full-matured hardware backbones to spread out the effective and scientific casting design mind, and they all were integrated into Simulation Portal on the web. It professes scientific casting design on the NET including ubiquitous access way represented by ＂Anyone, Anytime, Anywhere＂ concept for casting designs.

A New Design and Implementation of an Attendance Checking Node for Coal Mines

A novel design and implementation of an attendance checking node for coal mines based on the CAN bus is presented in this paper. Hardware circuits and programming methods for the attendance checking node are discussed,including the single-chip computer with CAN controller AT89C51CC03,the CAN bus transceiver TJA1050,the large capacity DataFlash memory,the real-time clock DS1302,the voice chip ISD2560 and the card-reading circuit in Wie-gand format. All the extended hardware satisfies the requirements for intrinsically safe circuits (GB3836.4-2000) and intrinsically safe authentication promoted by the national explosion-proof institute. Further,the software programming methods for the CAN controller (AT89C51CC03) and the implementation of the CAN communications protocol are presented as well.

A Survey on Low Complexity Detectors for OTFS Systems

The newly emerging orthogonal time frequency space(OTFS)modulation can ob⁃tain delay-Doppler diversity gain to significantly improve the system performance in high mobility wireless communication scenarios such as vehicle-to-everything(V2X),high-speed railway and unmanned aerial vehicles(UAV),by employing inverse symplectic finite Fouri⁃er transform(ISFFT)and symplectic finite Fourier transform(SFFT).However,OTFS modu⁃lation will dramatically increase system complexity,especially at the receiver side.Thus,de⁃signing low complexity OTFS receiver is a key issue for OTFS modulation to be adopted by new-generation wireless communication systems.In this paper,we review low complexity OTFS detectors and provide some insights on future researches.We firstly present the OTFS system model and basic principles,followed by an overview of OTFS detector structures,classifications and comparative discussion.We also survey the principles of OTFS detection algorithms.Furthermore,we discuss the design of hybrid OTFS and orthogonal frequency di⁃vision multiplexing(OFDM)detectors in single user and multi-user multi-waveform commu⁃nication systems.Finally,we address the main challenges in designing low complexity OT⁃FS detectors and identify some future research directions.