English
Related papers

Related papers: Lower Bounds on Parameter Modulation-Estimation Un…

200 papers

Constellation shaping is a well-established method to improve upon a regular quadrature amplitude modulation (QAM). It is known that the gain achieved by any shaping method for an additive white Gaussian noise (AWGN) channel is…

Information Theory · Computer Science 2025-04-28 Kirill Ivanov , Wei Yang , Jing Jiang

An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…

Information Theory · Computer Science 2026-04-14 Amin Gohari , Gerhard Kramer

This paper proposes novel spectrum sensing algorithms for cognitive radio networks. By assuming known transmitter pulse shaping filter, synchronous and asynchronous receiver scenarios have been considered. For each of these scenarios, the…

Optimization and Control · Mathematics 2013-12-31 Tadilo Endeshaw Bogale , Luc Vandendorpe

Channel estimation is a fundamental task in communication systems and is critical for effective demodulation. While most works deal with a simple scenario where the measurements are corrupted by the additive white Gaussian noise (AWGN),…

Signal Processing · Electrical Eng. & Systems 2024-12-10 Yifan Wang , Chengjie Yu , Jiang Zhu , Fangyong Wang , Xingbin Tu , Yan Wei , Fengzhong Qu

In the emerging paradigm of edge learning, neural networks (NNs) are partitioned across distributed edge devices that collaboratively perform inference via wireless transmission. However, deploying NNs for edge inference over wireless…

Information Theory · Computer Science 2026-05-08 Yangshuo He , Guanding Yu , Jingge Zhu

The problem of clock offset estimation in a two way timing message exchange regime is considered when the likelihood function of the observation time stamps is Gaussian, exponential or log-normally distributed. A parametrized solution to…

Information Theory · Computer Science 2012-02-01 Aitzaz Ahmad , Davide Zennaro , Erchin Serpedin , Lorenzo Vangelista

In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

A novel technique to optimize the input distribution and compute a lower bound for the capacity of the nonlinear optical fiber channel is proposed. The technique improves previous bounds obtained with the additive white Gaussian noise…

Information Theory · Computer Science 2021-06-09 Stella Civelli , Enrico Forestieri , Alexey Lotsmanov , Dmitry Razdoburdin , Marco Secondini

This paper provides an upper-bound for the capacity of the underwater acoustic (UWA) channel with dominant noise sources and generalized fading environments. Previous works have shown that UWA channel noise statistics are not necessary…

Information Theory · Computer Science 2014-04-29 Mustafa A. Kishk , Ahmed M. Alaa

Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…

Information Theory · Computer Science 2016-11-17 Andrew Thangaraj

Channel estimation is of crucial importance for tomorrow's wireless mobile communication systems. This paper focuses on the solution of channel parameters estimation problem in a scenario involving multiple paths in the presence of additive…

Signal Processing · Electrical Eng. & Systems 2018-04-05 Amir Ebrahimi , Ardavan Rahimian

We consider a broadcast channel with a degraded message set, in which a single transmitter sends a common message to two receivers and a private message to one of the receivers only. The main goal of this work is to find new lower bounds to…

Information Theory · Computer Science 2009-06-09 Yonatan Kaspi , Neri Merhav

Convexity properties of error rates of a class of decoders, including the ML/min-distance one as a special case, are studied for arbitrary constellations, bit mapping and coding. Earlier results obtained for the AWGN channel are extended to…

Information Theory · Computer Science 2016-11-15 Sergey Loyka , Victoria Kostina , Francois Gagnon

The performance of a noisy linear time-invariant (LTI) plant, controlled over a noiseless digital channel with transmission delay, is investigated in this paper. The rate-limited channel connects the single measurement output of the plant…

Systems and Control · Computer Science 2017-02-22 Mohsen Barforooshan , Jan Østergaard , Milan S. Derpich

Upper bounds on the capacity of vector Gaussian channels affected by fading are derived under peak amplitude constraints at the input. The focus is on constraint regions that can be decomposed in a Cartesian product of sub-regions. This…

Information Theory · Computer Science 2022-07-05 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

Considering the problem of risk-sensitive parameter estimation, we propose a fairly wide family of lower bounds on the exponential moments of the quadratic error, both in the Bayesian and the non--Bayesian regime. This family of bounds,…

Information Theory · Computer Science 2017-03-02 Neri Merhav

There have been several upper bounds on the quantum capacity of the single-mode Gaussian channels with thermal noise, such as thermal attenuator and amplifier. We consider a class of attenuator and amplifier with more general noises,…

Quantum Physics · Physics 2019-05-21 Youngrong Lim , Soojoon Lee , Jaewan Kim , Kabgyun Jeong

A new method for the design of linear-phase robust far-field broadband beamformers using constrained optimization is proposed. In the method, the maximum passband ripple and minimum stopband attenuation are ensured to be within prescribed…

Systems and Control · Computer Science 2015-06-18 R. C. Nongpiur , D. J. Shpak

This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…

Information Theory · Computer Science 2023-05-17 Ioannis Papoutsidakis , Angela Doufexi , Robert J. Piechocki

We derive fundamental lower bounds on the performance of optical metrology and communication systems in a Bayesian framework. The derivation uses classical rate-distortion theory in conjunction with bounds on the capacity to transmit…

Quantum Physics · Physics 2018-09-24 Ranjith Nair