English
Related papers

Related papers: Compressive Random Access Using A Common Overloade…

200 papers

Low-power wide-area network technologies such as LoRaWAN are promising for collecting low-rate monitoring data from geographically distributed sensors, in which timestamping the sensor data is a critical system function. This paper…

Networking and Internet Architecture · Computer Science 2021-07-13 Chaojie Gu , Linshan Jiang , Rui Tan , Mo Li , Jun Huang

Conventional spatial modulation (SM) is typically considered for transmission in the downlink of small-scale MIMO systems, where a single one of a set of antenna elements (AEs) is activated for implicitly conveying extra bits. By contrast,…

Information Theory · Computer Science 2016-04-26 Zhen Gao , Linglong Dai , Zhaocheng Wang , Sheng Chen , Lajos Hanzo

Recently, there has been a significant interest in developing cooperative sensing systems for certain types of wireless applications. In such systems, a group of sensing nodes periodically collect measurements about the signals being…

Information Theory · Computer Science 2015-06-11 Harish Ganapathy , Constantine Caramanis , Lei Ying

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

Mutual exclusion is an important problem in the context of shared resource usage, where only one process can be using the shared resource at any given time. A mutual exclusion protocol that does not use information on the duration for which…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-11 Karthi Srinivasan , Yoram Moses , Rajit Manohar

In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize the secrecy capacity with a rate-limited local source of…

Information Theory · Computer Science 2012-02-27 Matthieu R. Bloch , Joerg Kliewer

In the current DVB generation, satellite terminals are expected to be interactive and capable of transmission in the return channel with satisfying quality. Considering the bursty nature of their traffic and the long propagation delay, the…

Information Theory · Computer Science 2015-01-27 Alessio Meloni , Maurizio Murroni

Unsourced random access is a novel communication paradigm designed for handling a large number of uncoordinated users that sporadically transmit very short messages. Under this model, coded compressed sensing (CCS) has emerged as a…

Information Theory · Computer Science 2021-07-22 Jamison R. Ebert , Vamsi K. Amalladinne , Stefano Rini , Jean-Francois Chamberland , Krishna R. Narayanan

This paper proposes a compressed sensing (CS) framework for the acquisition and reconstruction of frequency-sparse signals with chaotic dynamical systems. The sparse signal is acting as an excitation term of a discrete-time chaotic system…

Information Theory · Computer Science 2016-12-21 Zhong Liu , Shengyao Chen , Feng Xi

Future wireless communications systems are expected to operate at bands above 100GHz. The high energy consumption of analog-to-digital converters, due to their high resolution represents a bottleneck for future wireless communications…

Information Theory · Computer Science 2025-02-25 D. Melo , L. Landau , R. de Lamare

A traditional assumption underlying most data converters is that the signal should be sampled at a rate exceeding twice the highest frequency. This statement is based on a worst-case scenario in which the signal occupies the entire…

Information Theory · Computer Science 2015-05-13 Yonina C. Eldar

Compressive Sensing (CS) is a new technique for the efficient acquisition of signals, images, and other data that have a sparse representation in some basis, frame, or dictionary. By sparse we mean that the N-dimensional basis…

Information Theory · Computer Science 2015-05-18 Chinmay Hegde , Richard G. Baraniuk

The construction of preamble sequences for channel estimation by superposition of orthogonal pilots can improve performance of massive grant-free uplink from machine-type devices. In this letter, a technique is proposed to obtain full…

Information Theory · Computer Science 2023-12-25 Lorenzo Valentini , Elena Bernardi , Enrico Paolini

Unsourced random access (URA) is an increasingly popular communication paradigm attuned to machine driven data transfers in \textit{Internet-of-Things} (IoT) networks. In a typical URA setting, a small subset of active devices within a very…

Information Theory · Computer Science 2021-05-06 Vamsi K. Amalladinne , Jean-Francois Chamberland , Krishna R. Narayanan

This work focuses on distributed linear precoding when users transmit correlated information over a fading Multiple-Input and Multiple-Output Multiple Access Channel. Precoders are optimized in order to minimize the sum-Mean Square Error…

Information Theory · Computer Science 2024-01-31 P. Suárez-Casal , J. P. González-Coma , O. Fresnedo , L. Castedo

Irregular repetition slotted aloha (IRSA) is a massive random access protocol which can be used to serve a large number of users while achieving a packet loss rate (PLR) close to zero. However, if the number of users is too high, then the…

Information Theory · Computer Science 2023-02-27 Chirag Ramesh Srivatsa , Chandra R. Murthy

We consider asynchronous communication over point-to-point discrete memoryless channels. The transmitter starts sending one block codeword at an instant that is uniformly distributed within a certain time period, which represents the level…

Information Theory · Computer Science 2007-08-01 Aslan Tchamkerten , Venkat Chandar , Gregory Wornell

This paper aims to propose and theoretically analyze a new distributed scheme for sparse linear regression and feature selection. The primary goal is to learn the few causal features of a high-dimensional dataset based on noisy observations…

Machine Learning · Statistics 2021-11-05 Hanie Barghi , Amir Najafi , Seyed Abolfazl Motahari

We consider distributed statistical optimization in one-shot setting, where there are $m$ machines each observing $n$ i.i.d. samples. Based on its observed samples, each machine sends a $B$-bit-long message to a server. The server then…

Machine Learning · Computer Science 2020-01-01 Saber Salehkaleybar , Arsalan Sharifnassab , S. Jamaloddin Golestani

One of the main drivers for new waveforms in future 5G wireless communication systems is to handle efficiently the variety of traffic types and requirements. In this paper, we introduce a new random access within the standard acquisition…

Information Theory · Computer Science 2017-01-17 Gerhard Wunder , Martin Kasparick , Peter Jung
‹ Prev 1 8 9 10 Next ›