English
Related papers

Related papers: On-Off Random Access Channels: A Compressed Sensin…

200 papers

Low complexity joint estimation of synchronization impairments and channel in a single-user MIMO-OFDM system is presented in this letter. Based on a system model that takes into account the effects of synchronization impairments such as…

Information Theory · Computer Science 2013-04-30 Renu Jose , Sooraj K. Ambat , K. V. S. Hari

This paper considers the forward error correction (FEC) code design for approaching the capacity of a dynamic multiple access channel (MAC) where both the number of users and their respective signal powers keep constantly changing,…

Information Theory · Computer Science 2019-07-22 Xiaojie Wang , Sebastian Cammerer , Stephan ten Brink

Distributed compressive sensing is a framework considering jointly sparsity within signal ensembles along with multiple measurement vectors (MMVs). The current theoretical bound of performance for MMVs, however, is derived to be the same…

Information Theory · Computer Science 2016-09-12 Sung-Hsien Hsieh , Wei-Jie Liang , Chun-Shien Lu , Soo-Chang Pei

This paper investigates the sparse channel estimation for holographic multiple-input multiple-output (HMIMO) systems. Given that the wavenumber-domain representation is based on a series of Fourier harmonics that are in essence a series of…

Signal Processing · Electrical Eng. & Systems 2024-06-14 Yuqing Guo , Yuanbin Chen , Ying Wang

We investigate a coded uplink non-orthogonal multiple access (NOMA) configuration in which groups of co-channel users are modulated in accordance with orthogonal time frequency space (OTFS). We take advantage of OTFS characteristics to…

Information Theory · Computer Science 2021-02-10 Yao Ge , Qinwen Deng , P. C. Ching , Zhi Ding

In this paper, we investigate a spectrum sensing algorithm for detecting spatial dimension holes in Multiple Inputs Multiple Outputs (MIMO) transmissions for OFDM systems using Compressive Sensing (CS) tools. This extends the energy…

Information Theory · Computer Science 2018-10-16 Yahya H. Ezzeldin , Radwa A. Sultan , Karim G. Seddik

This paper considers the joint channel estimation and device activity detection in the grant-free random access systems, where a large number of Internet-of-Things devices intend to communicate with a low-earth orbit satellite in a sporadic…

Signal Processing · Electrical Eng. & Systems 2022-08-10 Boxiao Shen , Yongpeng Wu , Jianping An , Chengwen Xing , Lian Zhao , Wenjun Zhang

With the increasing popularity of large-scale antenna arrays, the subarraying technology becomes more attractive. In this paper, we propose two effective subarraying methods right after formulating the subarray synthesis as a compressive…

Signal Processing · Electrical Eng. & Systems 2022-01-03 Songjie Yang , Wanting Lyu , Zhongpei Zhang

In oversampled adaptive sensing (OAS), noisy measurements are collected in multiple subframes. The sensing basis in each subframe is adapted according to some posterior information exploited from previous measurements. The framework is…

Information Theory · Computer Science 2019-12-11 Ali Bereyhi , Ralf R. Müller

As an extension of orthogonal matching pursuit (OMP) improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm…

Information Theory · Computer Science 2015-06-15 Jian Wang , Suhyuk Kwon , Ping Li , Byonghyo Shim

In this paper, we propose a MIMO receiver algorithm that exploits {\em channel hardening} that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of the ${\bf H}^H{\bf H}$ matrix become…

Information Theory · Computer Science 2014-01-13 T. Lakshmi Narasimhan , A. Chockalingam

Various studies that address the compressed sensing problem with Multiple Measurement Vectors (MMVs) have been recently carried. These studies assume the vectors of the different channels to be jointly sparse. In this paper, we relax this…

Machine Learning · Computer Science 2016-11-14 Hamid Palangi , Rabab Ward , Li Deng

In this paper, we investigate power-constrained sensing matrix design in a sparse Gaussian linear dimensionality reduction framework. Our study is carried out in a single--terminal setup as well as in a multi--terminal setup consisting of…

Information Theory · Computer Science 2015-10-28 Amirpasha Shirazinia , Subhrakanti Dey

One of the key challenges in sensor networks is the extraction of information by fusing data from a multitude of distinct, but possibly unreliable sensors. Recovering information from the maximum number of dependable sensors while…

Machine Learning · Statistics 2015-05-20 Vassilis Kekatos , Georgios B. Giannakis

Differential spatial modulation (DSM) exploits the time dimension to facilitate the differential modulation, which can perfectly avoid the challenge in acquiring of heavily entangled channel state information of visible light communication…

Signal Processing · Electrical Eng. & Systems 2024-09-11 Zichun Shi , Pu Miao , Peng Chen , Lei Xue , Li-Yang Zheng , Laiyuan Wang , Gaojie Chen

In cloud radio access network (C-RAN), remote radio heads (RRHs) and users are uniformly distributed in a large area such that the channel matrix can be considered as sparse. Based on this phenomenon, RRHs only need to detect the relatively…

Information Theory · Computer Science 2017-08-22 Yuhao Chi , Lei Liu , Guanghui Song , Chau Yuen , Yong Liang Guan , Ying Li

Conventional power-domain non-orthogonal multiple access (NOMA) relies on precise power control, which requires real-time channel state information at transmitters. This requirement severely limits its application to future wireless…

Information Theory · Computer Science 2020-03-13 Zhaoji Zhang , Ying Li , Guanghui Song , Chau Yuen , Yong Liang Guan

This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally…

Information Theory · Computer Science 2018-06-04 Vamsi K. Amalladinne , Avinash Vem , Dileep Kumar Soma , Krishna R. Narayanan , Jean-Francois Chamberland

Orthogonal matching pursuit (OMP) is a greedy algorithm widely used for the recovery of sparse signals from compressed measurements. In this paper, we analyze the number of iterations required for the OMP algorithm to perform exact recovery…

Information Theory · Computer Science 2016-02-23 Jian Wang , Byonghyo Shim

We analyze multiuser detection under the assumption that the number of users accessing the channel is unknown by the receiver. In this environment, users' activity must be estimated along with any other parameters such as data, power, and…

Information Theory · Computer Science 2016-11-15 Adrià Tauste Campo , Albert Guillén i Fàbregas , Ezio Biglieri