English
Related papers

Related papers: Super-Nyquist Rateless Coding for Intersymbol Inte…

200 papers

Enabling low power wireless devices to adopt Nyquist sampling at high carriers is prohibitive. In spectrum sensing, this limit calls for an analog front-end that can sweep different bands quickly, in order to use the available spectrum…

Information Theory · Computer Science 2017-12-15 Lorenzo Ferrari , Anna Scaglione

Quantum mechanics has revolutionized our understanding of information transmission, leading to the development of quantum communication protocols that promise unprecedented security in data transfer. Quantum teleportation, in particular,…

Quantum Physics · Physics 2024-11-15 S. M. Yousuf Iqbal Tomal , Debojit Bhattacharjee

Traditional studies of multi-source, multi-terminal interference channels typically allow a vanishing probability of error in communication. Motivated by the study of network coding, this work addresses the task of quantifying the loss in…

Information Theory · Computer Science 2013-07-30 Ilia Levi , Dan Vilenchik , Michael Langberg , Michelle Effros

For a state-dependent DMC with input alphabet $\mathcal{X}$ and state alphabet $\mathcal{S}$ where the i.i.d. state sequence is known causally at the transmitter, it is shown that by using at most…

Information Theory · Computer Science 2007-07-13 Hamidreza Farmanbar , Amir K. Khandani

Using Gaussian inputs and treating interference as noise at the receivers has recently been shown to be sum capacity achieving for the two-user single-input single-output (SISO) Gaussian interference channel in a low interference regime,…

Information Theory · Computer Science 2010-10-25 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

At the fundamental level, quantum communication is ultimately limited by noise. For instance, quantum signals cannot be amplified without the introduction of noise in the amplified states. Furthermore, photon loss reduces the…

An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…

Information Theory · Computer Science 2011-06-21 Or Ordentlich , Uri Erez

In this work, we take the initiative in studying the information-theoretic tradeoff between communication and quickest change detection (QCD) under an integrated sensing and communication setting. We formally establish a joint communication…

Information Theory · Computer Science 2024-10-11 Daewon Seo , Sung Hoon Lim

In this paper, we provide an analytical study of single-carrier faster-than-Nyquist (FTN) signaling for integrated sensing and communications (ISAC). Our derivations show that FTN is advantageous for ISAC, and reveal new insights that these…

Information Theory · Computer Science 2025-06-12 Shuangyang Li , Fan Liu , Yifeng Xiong , Weijie Yuan , Baoming Bai , Christos Masouros , Giuseppe Caire

In the two-user Gaussian interference channel with Gaussian inputs and treating interference as noise (TIN), improper complex signals can be beneficial if time-sharing is not allowed or if only the data rates are averaged over several…

Information Theory · Computer Science 2020-12-30 Christoph Hellings , Ferhad Askerbeyli , Wolfgang Utschick

Consider a lossy communication channel for unicast with zero-delay feedback. For this communication scenario, a simple retransmission scheme is optimum with respect to delay. An alternative approach is to use random linear coding in…

Information Theory · Computer Science 2016-11-18 Mohammad Ravanbakhsh , Angela I. Barbero Diez , Oyvind Ytrehus

Consider a control problem with a communication channel connecting the observer of a linear stochastic system to the controller. The goal of the controller is to minimize a quadratic cost function in the state variables and control signal,…

Information Theory · Computer Science 2018-11-27 Victoria Kostina , Babak Hassibi

We consider systems in which the transmitter conveys messages to the receiver through a capacity-limited relay station. The channel between the transmitter and the relay-station is assumed to be a frequency selective additive Gaussian noise…

Information Theory · Computer Science 2018-01-08 Adi Homri , Michael Peleg , Shlomo Shamai

This paper studies the achievable rates of Gaussian interference channels with additive white Gaussian noise (AWGN), when improper or circularly asymmetric complex Gaussian signaling is applied. For the Gaussian multiple-input…

Information Theory · Computer Science 2016-11-18 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels.…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , Andrea J. Goldsmith , H. Vincent Poor

In the context of NISQ computers - Noise Intermediate Scale Quantum, it is a consensus that the distribution of circuits among processing agents is a viable approach to get greater scalability with small machines. This approach can increase…

Quantum Physics · Physics 2023-02-06 Waldemir Cambiucci , Regina Melo Silveira , Wilson Vicente Ruggiero

This paper presents the study and the realization at IETR of a high data rate 60 GHz wireless communications system. The system uses a simple single carrier architecture. The receiver architecture is based on a differential demodulation…

Networking and Internet Architecture · Computer Science 2009-11-06 Lahatra Rakotondrainibe , Yvan Kokar , Gheorghe Zaharia , Ghaïs El Zein

A bound on the maximum information transmission rate through a cascade of Gaussian links is presented. The network model consists of a source node attempting to send a message drawn from a finite alphabet to a sink, through a cascade of…

Information Theory · Computer Science 2013-01-29 Ramanan Subramanian , Badri Vellambi , Ingmar Land

In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…

Information Theory · Computer Science 2012-01-30 Navot Blits

In this work, we have presented a complete end-end architecture to employ the rate-less codes. We have developed a new architecture Rate-less Codes Multicast (RCNC). This architecture is shown to provide high throughput gains, reliability…

Networking and Internet Architecture · Computer Science 2013-08-20 Abhijeet Bhorkar , Gautam Bhanage
‹ Prev 1 8 9 10 Next ›