中文
相关论文

相关论文: On the Achievable Rate and Capacity for a Sample-b…

200 篇论文

We investigate performance limits and design of communication in the presence of uniform output quantization with moderate to high resolution. Under independent and identically distributed (i.i.d.) complex Gaussian codebook and nearest…

信息论 · 计算机科学 2025-04-24 Jing Zhou , Shuqin Pang , Wenyi Zhang

We first consider an energy harvesting channel with fading, where only the transmitter harvests energy from natural sources. We bound the optimal long term throughput by a constant for a class of energy arrival distributions. The proposed…

信息论 · 计算机科学 2015-01-28 Jainam Doshi , Rahul Vaze

In present-day quantum communications, one of the main problems is the lack of a quantum repeater design that can simultaneously secure high rates and long distances. Recent literature has established the end-to-end capacities that are…

量子物理 · 物理学 2020-12-16 Masoud Ghalaii , Stefano Pirandola

This paper investigates the design of the capacity-achieving input distribution for the discrete-time Poisson channel (DTPC) under dark current effects with low-precision analog-to-digital converters (ADCs). This study introduces an…

信号处理 · 电气工程与系统科学 2025-09-23 Qianqian Li , Lintao Li , Lixiang Liu , Lei Yang , Caihong Gong , Hua Li , Shiya Hao , Xiaoming Dai

We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know a priori when the transmissions will occur. Focusing on the…

信息论 · 计算机科学 2017-03-20 Mostafa Khoshnevisan , J Nicholas Laneman

The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…

信息论 · 计算机科学 2025-11-13 Andreas Theocharous , Lampros Gavalakis , Ioannis Kontoyiannis

This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The…

信息论 · 计算机科学 2015-07-15 Wei Yang , Giuseppe Caire , Giuseppe Durisi , Yury Polyanskiy

When classical information is sent over a quantum channel, attaining the ultimate limit to channel capacity requires the receiver to make joint measurements over long codeword blocks. For a pure-state channel, we construct a receiver that…

量子物理 · 物理学 2015-03-17 Saikat Guha

The problem of mismatched decoding for discrete memoryless channels is addressed. A mismatched cognitive multiple-access channel is introduced, and an inner bound on its capacity region is derived using two alternative encoding methods:…

信息论 · 计算机科学 2013-05-03 Anelia Somekh-Baruch

Flat-fading channels that are correlated in time are considered under peak and average power constraints. For discrete-time channels, a new upper bound on the capacity per unit time is derived. A low SNR analysis of a full-scattering vector…

信息论 · 计算机科学 2007-07-13 Vignesh Sethuraman , Bruce Hajek

Major obstacles against efficient long distance quantum communication are photon losses during transmission and the probabilistic nature of Bell measurement causing exponential scaling in time and resource with distance. To overcome these…

量子物理 · 物理学 2019-11-05 Seung-Woo Lee , Timothy C. Ralph , Hyunseok Jeong

A potential quantum internet would open up the possibility of realizing numerous new applications, including provably secure communication. Since losses of photons limit long-distance, direct quantum communication and widespread quantum…

量子物理 · 物理学 2019-12-18 Daniel Miller , Timo Holz , Hermann Kampermann , Dagmar Bruß

We report the continuous and partially nondestructive measurement of optical photons. For a weak light pulse traveling through a slow-light optical medium (signal), the associated atomic-excitation component is detected by another light…

量子物理 · 物理学 2016-01-27 Mahdi Hosseini , Kristin M. Beck , Yiheng Duan , Wenlan Chen , Vladan Vuletić

We investigate the Peak-Power Limited (PPL) Additive White Gaussian Noise (AWGN) channels in which the signal is band-limited, and its instantaneous power cannot exceed the power P. This model is relevant to many communication systems;…

信息论 · 计算机科学 2024-12-10 Michael Peleg , Shlomo Shamai

In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a…

量子物理 · 物理学 2020-04-06 Stefano Pirandola

This paper proposes a method for estimating and detecting optical signals in practical photon-counting receivers. There are two important aspects of non-perfect photon-counting receivers, namely, (i) dead time which results in blocking…

信号处理 · 电气工程与系统科学 2024-08-21 Chen Wang , Zhiyong Xu , Jingyuan Wang , Jianhua Li , Weifeng Mou , Huatao Zhu , Jiyong Zhao , Yang Su , Yimin Wang , Ailin Qi

It is well known that a minimum error quantum measurement for arbitrary binary optical coherent states can be realized by a receiver that comprises interfering with a coherent reference light, photon counting, and feedback control. We show…

量子物理 · 物理学 2018-02-16 Kenji Nakahira , Kentaro Kato , Tsuyoshi Sasaki Usuda

A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the…

信息论 · 计算机科学 2014-02-10 Ramji Venkataramanan , S. Sandeep Pradhan

This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output (MIMO) fading channels, with and without channel state information (CSI) at the transmitter…

信息论 · 计算机科学 2014-04-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…

信息论 · 计算机科学 2016-11-15 Silas L. Fong , Vincent Y. F. Tan