English
Related papers

Related papers: Coded Many-User Multiple Access via Approximate Me…

200 papers

Efficient signal detectors are rather important yet challenging to achieve satisfactory performance for large-scale communication systems. This paper considers a non-orthogonal sparse code multiple access (SCMA) configuration for…

Signal Processing · Electrical Eng. & Systems 2023-03-16 Yao Ge , Lei Liu , Shunqi Huang , David González G. , Yong Liang Guan , Zhi Ding

This paper considers a discrete-valued signal estimation scheme based on a low-complexity Bayesian optimal message passing algorithm (MPA) for solving massive linear inverse problems under highly correlated measurements. Gaussian belief…

Signal Processing · Electrical Eng. & Systems 2024-11-14 Tomoharu Furudoi , Takumi Takahashi , Shinsuke Ibi , Hideki Ochiai

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

Sparse regression codes (SPARCs) are a promising coding scheme that can approach the Shannon limit over Additive White Gaussian Noise (AWGN) channels. Previous works have proven the capacity-achieving property of SPARCs with Gaussian design…

Information Theory · Computer Science 2023-03-16 Yizhou Xu , YuHao Liu , ShanSuo Liang , Tingyi Wu , Bo Bai , Jean Barbier , TianQi Hou

This paper provides comprehensive coding and outer bound for the half-duplex multiple access channel with generalized feedback (MAC-GF). Two users communicate with one destination over a discrete memoryless channel using time division. Each…

Information Theory · Computer Science 2011-08-02 Ahmad Abu Al Haija , Mai Vu

A $K$-user secure Gaussian Multiple-Access-Channel (MAC) with an external eavesdropper is considered in this paper. An achievable rate region is established for the secure discrete memoryless MAC. The secrecy sum capacity of the degraded…

Information Theory · Computer Science 2010-03-04 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

We consider the estimation of an i.i.d. (possibly non-Gaussian) vector $\xbf \in \R^n$ from measurements $\ybf \in \R^m$ obtained by a general cascade model consisting of a known linear transform followed by a probabilistic componentwise…

Information Theory · Computer Science 2012-12-04 Ulugbek S. Kamilov , Sundeep Rangan , Alyson K. Fletcher , Michael Unser

In this paper, a new approach for multiple access (MA) in fifth generation (5G) of cellular networks called power domain sparse code multiple access (PSMA) is proposed. In PSMA, we adopt both the power domain and the code domain to transmit…

Information Theory · Computer Science 2017-06-21 Nader Mokari , Mohammad. R Javan , Mohammad Moltafet , Hamid Saeedi , Hossein Pishro-Nik

Coded caching is an information theoretic scheme to reduce high peak hours traffic by partially prefetching files in the users local storage during low peak hours. This paper considers heterogeneous decentralized caching systems where cache…

Information Theory · Computer Science 2020-01-17 Mozhgan Bayat , Kai Wan , Mingyue Ji , Giuseppe Caire

The coded caching scheme originally proposed by Maddah-Ali and Niesen (MAN) transmits coded multicast messages from a server to users equipped with caches via a capacitated shared-link and was shown to be information theoretically optimal…

Information Theory · Computer Science 2020-08-21 Mozhgan Bayat , Kai Wan , Giuseppe Caire

Convergence constrained power allocation (CCPA) in single carrier multiuser (MU) single-input multiple-output (SIMO) systems with turbo equalization is considered in this paper. In order to exploit full benefit of the iterative receiver,…

Information Theory · Computer Science 2016-11-17 Valtteri Tervo , Antti Tölli , Juha Karjalainen , Tad Matsumoto

This article seeks to advance coded compressed sensing (CCS) as a practical scheme for unsourced random access. The original CCS algorithm features a concatenated structure where an inner code is tasked with support recovery, and an outer…

Information Theory · Computer Science 2020-10-23 Jamison R. Ebert , Vamsi K. Amalladinne , Jean-Francois Chamberland , Krishna R. Narayanan

We study sparse regression codes (SPARC) for multiple access channels with multiple receive antennas, in non-coherent flat fading channels. We propose a novel practical decoder, referred to as maximum likelihood matching pursuit (MLMP),…

Signal Processing · Electrical Eng. & Systems 2025-07-16 V S V Sandeep , Sai Dinesh Kancharana , Arun Pachai Kannu

This article introduces a novel communication scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error…

Signal Processing · Electrical Eng. & Systems 2019-06-26 Vamsi K. Amalladinne , Jean-Francois Chamberland , Krishna R. Narayanan

We consider the detection of correlated information sources in the ubiquitous Code-Division Multiple-Access (CDMA) scheme. We propose a message-passing based scheme for detecting correlated sources directly, with no need for source coding.…

Information Theory · Computer Science 2010-03-24 Hadar Efraim , Nadav Yacov , Ori Shental , Ido Kanter

Approximate Message Passing (AMP) has been shown to be a superior method for inference problems, such as the recovery of signals from sets of noisy, lower-dimensionality measurements, both in terms of reconstruction accuracy and in…

Information Theory · Computer Science 2015-06-10 Andre Manoel , Florent Krzakala , Eric W. Tramel , Lenka Zdeborová

This paper presents the first Network-Coded Multiple Access (NCMA) system with multiple users adopting different signal modulations, referred to as rate-diverse NCMA. A distinguishing feature of NCMA is the joint use of physical-layer…

Information Theory · Computer Science 2016-10-05 Haoyuan Pan , Lu Lu , Soung Chang Liew

Motivated by the recent interest in approximate message passing (AMP) for matrix-valued linear observations with superposition of \emph{multiple statistically asymmetric signal sources}, we introduce a multi-source AMP framework in which…

Information Theory · Computer Science 2025-01-22 Burak Çakmak , Giuseppe Caire

We consider unsourced random access (uRA) in a cell-free (CF) user-centric wireless network, where a large number of potential users compete for a random access slot, while only a finite subset is active. The random access users transmit…

Information Theory · Computer Science 2025-05-01 Burak Çakmak , Eleni Gkiouzepi , Manfred Opper , Giuseppe Caire

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2008-03-31 Ender Tekin , Aylin Yener
‹ Prev 1 4 5 6 7 8 10 Next ›