English
Related papers

Related papers: On the Achievable Rate and Capacity for a Sample-b…

200 papers

Using ideas from Chu and Bode/Fano theories, we characterize the maximum achievable rate over the single-input single-output wireless communication channels under a restriction on the antenna size at the receiver. By employing…

Information Theory · Computer Science 2021-07-19 Volodymyr Shyianov , Mohamed Akrout , Faouzi Bellili , Amine Mezghani , Robert W. Heath

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…

Information Theory · Computer Science 2012-07-13 Jean-Michel Passerieux , Francois-Xavier Socheleau , Christophe Laot

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

We characterize the practical receiver in a wide range of signal intensity for optical wireless communication, from discrete pulse regime to continuous waveform regime. We first propose a statistical non-linear model based on the…

Information Theory · Computer Science 2020-02-10 Zhimeng Jiang , Chen Gong , Zhengyuan Xu

We present nonasymptotic achievability and converse bounds on the maximum coding rate (for a fixed average error probability and a fixed average blocklength) of variable-length full-feedback (VLF) and variable-length stop-feedback (VLSF)…

Information Theory · Computer Science 2016-07-26 Rahul Devassy , Giuseppe Durisi , Benjamin Lindqvist , Wei Yang , Marco Dalai

Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…

Information Theory · Computer Science 2024-03-22 Ioannis Papoutsidakis , Robert J. Piechocki , Angela Doufexi

In this paper, we investigate the achievable rate of a diffusive Molecular Communication (MC) channel with fully absorbing receiver, which counts particles absorbed along each symbol interval and resets the counter at every interval…

Information Theory · Computer Science 2023-06-08 Fardad Vakilipoor , Luca Barletta , Stefano Bregni , Maurizio Magarini

An additive white Gaussian noise energy-harvesting channel with an infinite-sized battery is considered. The energy arrival process is modeled as a sequence of independent and identically distributed random variables. The channel capacity…

Information Theory · Computer Science 2019-01-15 Silas L. Fong , Jing Yang , Aylin Yener

Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi , Ralf R. Mueller , Mikko Vehkaperae , Toshiyuki Tanaka

We propose an efficient decomposition scheme for a quantum receiver that attains the Helstrom bound in the low-photon regime for discriminating binary coherent states. Our method, which avoids feedback as used in Dolinar's case, breaks down…

Motivated by the application of point-to-point communication networks and biological storage, we investigate new achievability bounds for noisy permutation channels with strictly positive and full-rank square matrices. Our new bounds use…

Information Theory · Computer Science 2025-01-24 Lugaoze Feng , Xunan Li , Guocheng Lv , Ye jin

This paper investigates the information-theoretic limits of energy-harvesting (EH) channels in the finite blocklength regime. The EH process is characterized by a sequence of i.i.d. random variables with finite variances. We use the…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan , Jing Yang

This paper focuses on $ K $-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey $K$ private messages to $K$ receivers respectively. A general inner bound on the…

Information Theory · Computer Science 2021-11-10 Rui Tang , Songjie Xie , Youlong Wu

This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…

Information Theory · Computer Science 2021-07-30 Alex Dytso , Luca Barletta , Shlomo Shamai

This paper studies the minimum achievable source coding rate as a function of blocklength $n$ and probability $\epsilon$ that the distortion exceeds a given level $d$. Tight general achievability and converse bounds are derived that hold at…

Information Theory · Computer Science 2016-11-15 Victoria Kostina , Sergio Verdú

Channel capacity bounds are derived for a point-to-point indoor visible light communications (VLC) system with signal-dependent Gaussian noise. Considering both illumination and communication, the non-negative input of VLC is constrained by…

Information Theory · Computer Science 2020-11-03 Jin-Yuan Wang , Xian-Tao Fu , Rong-Rong Lu , Jun-Bo Wang , Min Lin , Julian Cheng

The non-perfect factors of practical photon-counting receiver are recognized as a significant challenge for long-distance photon-limited free-space optical (FSO) communication systems. This paper presents a comprehensive analytical…

Signal Processing · Electrical Eng. & Systems 2024-08-27 Chen Wang , Zhiyong Xu , Jingyuan Wang , Jianhua Li , Weifeng Mou , Huatao Zhu , Jiyong Zhao , Yang Su , Yimin Wang , Ailin Qi

In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex…

Information Theory · Computer Science 2007-10-02 Amichai Sanderovich , Shlomo Shamai , Yossef Steinberg

This paper considers the massive random access problem in MIMO quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum energy-per-bit required for each active user to transmit $J$ bits…

Information Theory · Computer Science 2022-10-24 Junyuan Gao , Yongpeng Wu , Shuo Shao , Wei Yang , H. Vincent Poor

An important practical open question has been to design explicit, structured optical receivers that achieve the Holevo limit in the contexts of optical communication and "quantum reading." The Holevo limit is an achievable rate that is…

Quantum Physics · Physics 2012-09-11 Mark M. Wilde , Saikat Guha , Si-Hui Tan , Seth Lloyd
‹ Prev 1 2 3 10 Next ›