MIMO Detection via Gaussian Mixture Expectation Propagation: A Bayesian Machine Learning Approach for High-Order High-Dimensional MIMO Systems

• URL: http://arxiv.org/abs/2412.09068v1
• Date: Thu, 12 Dec 2024 08:53:23 GMT
• Title: MIMO Detection via Gaussian Mixture Expectation Propagation: A Bayesian Machine Learning Approach for High-Order High-Dimensional MIMO Systems
• Authors: Shachar Shayovitz, Doron Ezri, Yoav Levinbook,
• Abstract summary: Efficient Uplink (UL) MIMO detection algorithms are crucial for decoding these signals accurately and ensuring robust communication. This algorithm outperforms state of the art detection algorithms while maintaining low computational complexity.
• Score: 0.0
• License:
• Abstract: MIMO systems can simultaneously transmit multiple data streams within the same frequency band, thus exploiting the spatial dimension to enhance performance. MIMO detection poses considerable challenges due to the interference and noise introduced by the concurrent transmission of multiple streams. Efficient Uplink (UL) MIMO detection algorithms are crucial for decoding these signals accurately and ensuring robust communication. In this paper a MIMO detection algorithm is proposed which improves over the Expectation Propagation (EP) algorithm. The proposed algorithm is based on a Gaussian Mixture Model (GMM) approximation for Belief Propagation (BP) and EP messages. The GMM messages better approximate the data prior when EP fails to do so and thus improve detection. This algorithm outperforms state of the art detection algorithms while maintaining low computational complexity.

Related papers

• Deep Unfolded Simulated Bifurcation for Massive MIMO Signal Detection [7.969977930633441]
  Various signal detectors based on deep learning techniques and quantum(-inspired) algorithms have been proposed to improve the detection performance. This paper focuses on the simulated bifurcation (SB) algorithm, a quantum-inspired algorithm.
  arXiv  Detail & Related papers  (2023-06-28T14:46:55Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• Simulated Bifurcation Algorithm for MIMO Detection [4.251210885092476]
  We study the performance of the simulated bifurcation (SB) algorithm for signal detection in multiple-input multiple-output (MIMO) system. Our results show that SB algorithm can achieve significant performance improvement over the widely used linear minimum-mean square error decoder.
  arXiv  Detail & Related papers  (2022-10-26T12:25:05Z)
• ConCrete MAP: Learning a Probabilistic Relaxation of Discrete Variables for Soft Estimation with Low Complexity [9.62543698736491]
  ConCrete MAP Detection (CMD) is an iterative detection algorithm for large inverse linear problems. We show CMD to feature a promising performance complexity trade-off compared to SotA. Notably, we demonstrate CMD's soft outputs to be reliable for decoders.
  arXiv  Detail & Related papers  (2021-02-25T09:54:25Z)
• Quantum Algorithm for DOA Estimation in Hybrid Massive MIMO [1.7404865362620803]
  Direction of arrival (DOA) estimation in array signal processing is an important research area. In this article, we present a quantum algorithm for MUSIC-based DOA estimation. Our algorithm can achieve an exponential speedup on some parameters and a speedup on others under mild conditions.
  arXiv  Detail & Related papers  (2021-02-08T02:15:07Z)
• Optimal Sequential Detection of Signals with Unknown Appearance and Disappearance Points in Time [64.26593350748401]
  The paper addresses a sequential changepoint detection problem, assuming that the duration of change may be finite and unknown. We focus on a reliable maximin change detection criterion of maximizing the minimal probability of detection in a given time (or space) window. The FMA algorithm is applied to detecting faint streaks of satellites in optical images.
  arXiv  Detail & Related papers  (2021-02-02T04:58:57Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)
• Coded Stochastic ADMM for Decentralized Consensus Optimization with Edge Computing [113.52575069030192]
  Big data, including applications with high security requirements, are often collected and stored on multiple heterogeneous devices, such as mobile devices, drones and vehicles. Due to the limitations of communication costs and security requirements, it is of paramount importance to extract information in a decentralized manner instead of aggregating data to a fusion center. We consider the problem of learning model parameters in a multi-agent system with data locally processed via distributed edge nodes. A class of mini-batch alternating direction method of multipliers (ADMM) algorithms is explored to develop the distributed learning model.
  arXiv  Detail & Related papers  (2020-10-02T10:41:59Z)
• Deep Learning Based Equalizer for MIMO-OFDM Systems with Insufficient Cyclic Prefix [11.11468231197267]
  In particular, the signal detection performance is severely impaired by inter-carrier interference (ICI) and inter-symbol interference (ISI) To tackle this problem, a deep learning-based equalizer is proposed for approximating the maximum likelihood detection. Our results reveal that the proposed receiver can achieve significant performance improvement compared to two traditional baseline schemes.
  arXiv  Detail & Related papers  (2020-07-23T02:21:24Z)
• Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding Design for Multiuser MIMO Systems [59.804810122136345]
  We propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed. An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed. We show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.
  arXiv  Detail & Related papers  (2020-06-15T02:57:57Z)
• Channel Assignment in Uplink Wireless Communication using Machine Learning Approach [54.012791474906514]
  This letter investigates a channel assignment problem in uplink wireless communication systems. Our goal is to maximize the sum rate of all users subject to integer channel assignment constraints. Due to high computational complexity, machine learning approaches are employed to obtain computational efficient solutions.
  arXiv  Detail & Related papers  (2020-01-12T15:54:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.