English
Related papers

Related papers: Many Access for Small Packets Based on Precoding a…

200 papers

Massive multiple-input multiple-output (MIMO) systems deploying a large number of antennas at the base station considerably increase the spectrum efficiency by serving multiple users simultaneously without causing severe interference.…

Information Theory · Computer Science 2019-02-19 Yu Han , Qi Liu , Chao-Kai Wen , Shi Jin , Kai-Kit Wong

We study the problem of recovering the sparsity pattern of block-sparse signals from noise-corrupted measurements. A simple, efficient recovery method, namely, a block-version of the orthogonal matching pursuit (OMP) method, is considered…

Information Theory · Computer Science 2011-09-27 Jun Fang , Hongbin Li

We present an algorithm, dubbed Multi-Branch Matching Pursuit (MBMP), to solve the sparse recovery problem over redundant dictionaries. MBMP combines three different paradigms: being a greedy method, it performs iterative signal support…

Information Theory · Computer Science 2014-07-03 Marco Rossi , Alexander M. Haimovich , Yonina C. Eldar

Multipath interference is an ubiquitous phenomenon in modern communication systems. The conventional way to compensate for this effect is to equalize the channel by estimating its impulse response by transmitting a set of training symbols.…

Information Theory · Computer Science 2016-11-18 M. Salman Asif , William Mantzel , Justin Romberg

A non-orthogonal multiple access (NOMA)-inspired integrated sensing and communication (ISAC) framework is proposed, where a dual-functional base station (BS) transmits the composite communication and sensing signals. In contrast to treating…

Information Theory · Computer Science 2022-08-02 Zhaolin Wang , Xidong Mu , Yuanwei Liu , Zhiguo Ding

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

Recovery algorithms play a key role in compressive sampling (CS). Most of current CS recovery algorithms are originally designed for one-dimensional (1D) signal, while many practical signals are two-dimensional (2D). By utilizing 2D…

Information Theory · Computer Science 2011-04-27 Yong Fang , Bormin Huang , Jiaji Wu

This paper considers a challenging scenario of machine type communications, where we assume internet of things (IoT) devices send short packets sporadically to an access point (AP) and the devices are not synchronized in the packet level.…

Information Theory · Computer Science 2024-06-12 Yuanyuan Zhang , Zhengdao Yuan , Qinghua Guo , Zhongyong Wang , Jiangtao Xi , Yanguang Yu , Yonghui Li

This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…

Information Theory · Computer Science 2023-07-04 Alexander Fengler , Alejandro Lancho , Yury Polyanskiy

Since most components of sparse multi-path channel (SMPC) are zero, impulse response of SMPC can be recovered from a short training sequence. Though the ordinary orthogonal matching pursuit (OMP) algorithm provides a very fast…

Information Theory · Computer Science 2010-05-24 Ruiming Yang , Qun Wan , Yipeng Liu , Wanlin Yang

Low-power ambient backscatter communication (AmBC) relying on radio-frequency (RF) energy harvesting is an energy-efficient solution for batteryless Internet of things (IoT). However, ambient backscatter signals are severely faded by dyadic…

Information Theory · Computer Science 2018-06-11 Tae Yeong Kim , Dong In Kim

Wireless communication systems must increasingly support a multitude of machine-type communications (MTC) devices, thus calling for advanced strategies for active user detection (AUD). Recent literature has delved into AUD techniques based…

In this work, we analyze modulated sampling schemes, such as the Nyquist Folding Receiver, which are highly efficient, readily implementable, non-uniform sampling schemes that allows for the blind estimation of a narrow-band signal's…

Information Theory · Computer Science 2012-08-01 Ray Maleh , Gerald L. Fudge

Non-orthogonal multiple access (NOMA) is capable of serving different numbers of users in the same time-frequency resource element, and this feature can be leveraged to carry additional information. In the orthogonal frequency division…

Information Theory · Computer Science 2022-10-25 Ziyi Xie , Wenqiang Yi , Xuanli Wu , Yuanwei Liu , Arumugam Nallanathan

This work introduces, for the first time, non-orthogonal multiple access (NOMA) into short-packet communications to achieve low latency in wireless networks. Specifically, we address the optimization of transmission rates and power…

Information Theory · Computer Science 2017-09-20 Xiaofang Sun , Shihao Yan , Nan Yang , Zhiguo Ding , Chao Shen , Zhangdui Zhong

The orthogonal matching pursuit (OMP) algorithm is a commonly used algorithm for recovering $K$-sparse signals $\x\in \mathbb{R}^{n}$ from linear model $\y=\A\x$, where $\A\in \mathbb{R}^{m\times n}$ is a sensing matrix. A fundamental…

Information Theory · Computer Science 2019-04-23 Jinming Wen , Wei Yu

In this paper, we explore the use of machine learning methods as an efficient alternative to correlation in performing packet detection. Targeting satellite-based massive machine type communications and internet of things scenarios, our…

Networking and Internet Architecture · Computer Science 2020-08-26 Estefania Recayte , Andrea Munari , Federico Clazzer

Multiple-input multiple-output (MIMO) techniques have recently demonstrated significant potentials in visible light communications (VLC), as they can overcome the modulation bandwidth limitation and provide substantial improvement in terms…

Information Theory · Computer Science 2017-02-07 Hanaa Marshoud , Paschalis C. Sofotasios , Sami Muhaidat , Bayan S. Sharif , George K. Karagiannidis

Sparse signals (i.e., vectors with a small number of non-zero entries) build the foundation of most kernel (or nullspace) results, uncertainty relations, and recovery guarantees in the sparse signal processing and compressive sensing…

Information Theory · Computer Science 2015-07-13 Christoph Studer

Orthogonal matching pursuit (OMP) is a canonical greedy algorithm for sparse signal reconstruction. When the signal of interest is block sparse, i.e., it has nonzero coefficients occurring in clusters, the block version of OMP algorithm…

Information Theory · Computer Science 2011-04-07 Jun Wang , Gang Li , Hao Zhang , Xiqin Wang