中文
相关论文

相关论文: Anytime coding on the infinite bandwidth AWGN chan…

200 篇论文

The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a…

信息论 · 计算机科学 2024-10-28 Anatoly Khina , Neri Merhav

This paper investigates an energy-efficient non-orthogonal transmission design problem for two downlink receivers that have strict reliability and finite blocklength (latency) constraints. The Shannon capacity formula widely used in…

信息论 · 计算机科学 2017-12-14 Yanqing Xu , Chao Shen , Tsung-Hui Chang , Shih-Chun Lin , Yajun Zhao , Gang Zhu

When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the…

信息论 · 计算机科学 2015-01-22 Ohad Elishco , Tom Meyerovitch , Moshe Schwartz

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…

信息论 · 计算机科学 2007-07-13 Hamidreza Farmanbar , Amir K. Khandani

Parallel, additive white Gaussian noise (AWGN) channels with an average sum power constraint are considered. It is shown how the waterfilling Shannon capacity can be approached by higher order modulation and probabilistic amplitude shaping…

信息论 · 计算机科学 2018-04-06 Fabian Steiner , Georg Böcherer , Patrick Schulte

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid…

信息论 · 计算机科学 2007-07-13 M. Twitto , I. Sason , S. Shamai

In this paper, we complement Verd\'{u}'s work on spectral efficiency in the wideband regime by investigating the fundamental tradeoff between rate and bandwidth when a constraint is imposed on the error exponent. Specifically, we consider…

信息论 · 计算机科学 2007-07-13 X. Wu , R. Srikant

We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. We first provide a proof of our recent conjecture on the…

信息论 · 计算机科学 2008-05-15 Jaspreet Singh , Onkar Dabeer , Upamanyu Madhow

We consider covert communication, i.e., hiding the presence of communication from an adversary for multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channels. We characterize the maximum covert coding rate under a…

信号处理 · 电气工程与系统科学 2021-01-25 Ahmed Bendary , Amr Abdelaziz , C. Emre Koksal

A central question in information theory is to determine the maximum success probability that can be achieved in sending a fixed number of messages over a noisy channel. This was first studied in the pioneering work of Shannon who…

信息论 · 计算机科学 2018-06-25 Siddharth Barman , Omar Fawzi

We consider the problem of jointly optimum modulation and estimation of a real-valued random parameter, conveyed over an additive white Gaussian noise (AWGN) channel, where the performance metric is the large deviations behavior of the…

信息论 · 计算机科学 2016-11-17 Neri Merhav

In this paper, we study the capacity and degree-of-freedom (DoF) scaling for the continuous-time amplitude limited AWGN channels in radio frequency (RF) and intensity modulated optical communication (OC) channels. More precisely, we study…

信息论 · 计算机科学 2016-05-10 Saeid Haghighatshoar , Peter Jung , Giuseppe Caire

Anytime reliable communication systems are needed in contexts where the property of vanishing error probability with time is critical. This is the case of unstable real time systems that are to be controlled through the transmission and…

信号处理 · 电气工程与系统科学 2020-02-27 Alberto Tarable , Francisco J. Escribano

The rising interest in applications requiring the transmission of small amounts of data has recently lead to the development of accurate performance bounds and of powerful channel codes for the transmission of short-data packets over the…

信息论 · 计算机科学 2017-05-17 Gianluigi Liva , Giuseppe Durisi , Marco Chiani , Shakeel Salamat Ullah , Soung Chang Liew

Hierarchical modulation (HM) is able to provide different levels of protection for data streams and achieve a rate region that cannot be realized by traditional orthogonal schemes, such as time division (TD). Nevertheless, criterions and…

信息论 · 计算机科学 2016-10-19 Baicen Xiao , Kexin Xiao , Zhiyong Chen , Hui Liu

This paper presents a new class of sparse superposition codes for low-rates and short-packet communications over the additive white Gaussian noise channel. The new code is orthogonal sparse superposition (OSS) code. A codeword of OSS codes…

信息论 · 计算机科学 2020-11-24 Yunseo Nam , Jeonghun Park , Songnam Hong , Namyoon Lee

Motivated by a wide-spread use of convex optimization techniques, convexity properties of bit error rate of the maximum likelihood detector operating in the AWGN channel are studied for arbitrary constellations and bit mappings, which also…

信息论 · 计算机科学 2010-04-16 Sergey Loyka , Francois Gagnon , Victoria Kostina

Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a…

信息论 · 计算机科学 2019-04-24 Cynthia Rush , Ramji Venkataramanan

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

A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show…

信息论 · 计算机科学 2015-08-14 Bin Li , David Tse , Kai Chen , Hui Shen