English
Related papers

Related papers: Low Complexity MIMO Detection based on Belief Prop…

200 papers

Compressed sensing (CS) demonstrates that sparse signals can be recovered from underdetermined linear measurements. We focus on the joint sparse recovery problem where multiple signals share the same common sparse support sets, and they are…

Information Theory · Computer Science 2011-02-17 Jongmin Kim , Woohyuk Chang , Bangchul Jung , Dror Baron , Jong Chul Ye

Multiple-input multiple-output (MIMO) is a key ingredient of next-generation wireless communications. Recently, various MIMO signal detectors based on deep learning techniques and quantum(-inspired) algorithms have been proposed to improve…

Information Theory · Computer Science 2023-07-25 Satoshi Takabe

Graph convolution is a fundamental building block for many deep neural networks on graph-structured data. In this paper, we introduce a simple, yet very effective graph convolutional network with skip connections for semi-supervised anomaly…

Machine Learning · Computer Science 2023-10-17 Mahsa Mesgaran , A. Ben Hamza

We present an algorithm to identify sparse dependence structure in continuous and non-Gaussian probability distributions, given a corresponding set of data. The conditional independence structure of an arbitrary distribution can be…

Machine Learning · Computer Science 2017-11-07 Rebecca E. Morrison , Ricardo Baptista , Youssef Marzouk

We propose a joint channel estimation and data detection algorithm for massive multilple-input multiple-output systems based on diffusion models. Our proposed method solves the blind inverse problem by sampling from the joint posterior…

Signal Processing · Electrical Eng. & Systems 2023-11-20 Nicolas Zilberstein , Ananthram Swami , Santiago Segarra

Cell-Free (CF) Massive Multiple-Input Multiple-Output (MaMIMO) is considered one of the leading candidates for enabling next-generation wireless communication. With the growing interest in the Internet of Things (IoT), the Grant-Free (GF)…

Information Theory · Computer Science 2025-08-05 Zilu Zhao , Christian Forsch , Laura Cottatellucci , Dirk Slock

We propose the use of non-parametric, graph-based tests to assess the distributional balance of covariates in observational studies with multi-valued treatments. Our tests utilize graph structures ranging from Hamiltonian paths that connect…

Methodology · Statistics 2022-08-11 Eric A. Dunipace

Symbol detection for Massive Multiple-Input Multiple-Output (MIMO) is a challenging problem for which traditional algorithms are either impractical or suffer from performance limitations. Several recently proposed learning-based approaches…

Signal Processing · Electrical Eng. & Systems 2019-06-12 Mehrdad Khani , Mohammad Alizadeh , Jakob Hoydis , Phil Fleming

Gaussian graphical models are nowadays commonly applied to the comparison of groups sharing the same variables, by jointy learning their independence structures. We consider the case where there are exactly two dependent groups and the…

Methodology · Statistics 2024-10-14 Saverio Ranciati , Alberto Roverato

This work considers multiple-input multiple-output (MIMO) communication systems using hierarchical modulation. A disadvantage of the maximum-likelihood (ML) MIMO detector is that computational complexity increases exponentially with the…

Information Theory · Computer Science 2016-02-24 Yigit Ugur , Ali Ozgur Yilmaz

Gaussian Graphical Models (GGM) are often used to describe the conditional correlations between the components of a random vector. In this article, we compare two families of GGM inference methods: nodewise edge selection and penalised…

We consider the task of detecting a hidden bipartite subgraph in a given random graph. This is formulated as a hypothesis testing problem, under the null hypothesis, the graph is a realization of an Erd\H{o}s-R\'{e}nyi random graph over $n$…

Data Structures and Algorithms · Computer Science 2024-03-07 Asaf Rotenberg , Wasim Huleihel , Ofer Shayevitz

Graphical models are popular tools for exploring relationships among a set of variables. The Gaussian graphical model (GGM) is an important class of graphical models, where the conditional dependence among variables is represented by nodes…

Methodology · Statistics 2025-05-30 José Á. Sánchez Gómez , Weibin Mo , Junlong Zhao , Yufeng Liu

We consider joint detection of co-channel signals---specifically, signals which do not possess a natural separability due to, for example, the multiple access technique or the use of multiple antennas. Iterative joint detection and decoding…

Information Theory · Computer Science 2015-08-17 Daniel J. Jakubisin , R. Michael Buehrer

Graphical network inference is used in many fields such as genomics or ecology to infer the conditional independence structure between variables, from measurements of gene expression or species abundances for instance. In many practical…

Methodology · Statistics 2018-03-22 Geneviève Robin , Christophe Ambroise , Stéphane Robin

Belief propagation is a fundamental message-passing algorithm for probabilistic reasoning and inference in graphical models. While it is known to be exact on trees, in most applications belief propagation is run on graphs with cycles.…

Machine Learning · Computer Science 2019-05-27 Frederic Koehler

Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-Nyquist signal acquisition. When a statistical…

Information Theory · Computer Science 2009-06-25 Dror Baron , Shriram Sarvotham , Richard G. Baraniuk

Gaussian graphical models are widely used to represent conditional dependence among random variables. In this paper, we propose a novel estimator for data arising from a group of Gaussian graphical models that are themselves dependent. A…

Machine Learning · Statistics 2016-09-01 Yuying Xie , Yufeng Liu , William Valdar

Minimum mean square error (MMSE) signal detection algorithm is near- optimal for uplink multi-user large-scale multiple input multiple output (MIMO) systems, but involves matrix inversion with high complexity. In this letter, we firstly…

Information Theory · Computer Science 2015-07-17 Xinyu Gao , Linglong Dai , Yongkui Ma , Zhaocheng Wang

In this work, we study the maximum matching problem from the perspective of sensitivity. The sensitivity of an algorithm $A$ on a graph $G$ is defined as the maximum Wasserstein distance between the output distributions of $A$ on $G$ and on…

Data Structures and Algorithms · Computer Science 2025-11-24 Yuichi Yoshida , Zihan Zhang