English
Related papers

Related papers: Finite-Support Capacity-Approaching Distributions …

200 papers

This work reports a theoretical framework that combines the auxiliary coherent potential approximation (ACPA-DMFT) with dynamical mean-field theory to study strongly correlated and disordered electronic systems with both diagonal and…

Strongly Correlated Electrons · Physics 2025-02-12 Zelei Zhang , Jiawei Yan , Li Huang , Youqi Ke

In this paper we introduce a novel performance analysis of the ${\eta}$-${\mu}$ generalized radio fading channels with integer value of the ${\mu}$ fading parameter, i.e. with even number of multipath clusters. This fading model includes…

Information Theory · Computer Science 2017-03-14 Ehab Salahat , Murad Qasaimeh

Standard upper and lower bounds on the capacity of relay channels are cut-set (CS), decode-forward (DF), and quantize-forward (QF) rates. For real additive white Gaussian noise (AWGN) multicast relay channels with one source node and one…

Information Theory · Computer Science 2019-01-28 Mohit Thakur , Gerhard Kramer

This paper investigates the bounds on channel capacity and constellation shaping under memoryless mixed noise, which is composed of impulsive noise (IN) and white Gaussian noise (WGN). The capacity bounds are derived using the entropy power…

Information Theory · Computer Science 2025-12-04 Tianfu Qi , Jun Wang

Designing capacity-achieving coding schemes for the band-limited additive colored Gaussian noise (ACGN) channel has been and is still a challenge. In this paper, the capacity of the band-limited ACGN channel is studied from a fundamental…

Information Theory · Computer Science 2023-06-02 Holger Boche , Andrea Grigorescu , Rafael F. Schaefer , H. Vincent Poor

The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…

Information Theory · Computer Science 2016-09-29 Borzoo Rassouli , Bruno Clerckx

In this paper, we relate the feedback capacity of parallel additive colored Gaussian noise (ACGN) channels to a variant of the Kalman filter. By doing so, we obtain lower bounds on the feedback capacity of such channels, as well as the…

Information Theory · Computer Science 2021-02-17 Song Fang , Quanyan Zhu

Product distribution matching (PDM) is proposed to generate target distributions over large alphabets by combining the output of several parallel distribution matchers (DMs) with smaller output alphabets. The parallel architecture of PDM…

Information Theory · Computer Science 2017-02-27 Georg Böcherer , Patrick Schulte , Fabian Steiner

We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and…

Information Theory · Computer Science 2015-03-17 Mojtaba Rahmati , Tolga M. Duman

Reliable adaptive beamforming is critical for large microphone arrays operating in highly dynamic acoustic environments. In scenarios characterized by fast-moving talkers and interferers, the available sample support for estimating the…

Systems and Control · Electrical Eng. & Systems 2026-05-07 Manan Mittal , Ryan M. Corey , John R. Buck , Andrew C. Singer

In this paper it is shown that the nonfeedback capacity of multiple-input multiple-output (MIMO) additive Gaussian noise (AGN) channels, when the noise is nonstationary and unstable, is characterized by an asymptotic optimization problem…

Information Theory · Computer Science 2022-05-04 Charalambos D. Charalambous , Stelios Louka

A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson $\beta$ functions is proposed. This bound is the dual of a converse bound established earlier by Polyanskiy and Verd\'{u} (2014). The new bound…

Information Theory · Computer Science 2016-01-25 Wei Yang , Austin Collins , Giuseppe Durisi , Yury Polyanskiy , H. Vincent Poor

We consider an additive White Gaussian channel where the transmitter is powered by an energy harvesting source. For such a system, we provide a lower bound on the maximal code book at finite code lengths that improves upon previously known…

Information Theory · Computer Science 2016-01-27 K Gautam Shenoy , Vinod Sharma

This paper investigates the asymptotic expansion for the size of block codes defined for the additive white Gaussian noise (AWGN) channel with feedback under the following setting: A peak power constraint is imposed on every transmitted…

Information Theory · Computer Science 2014-10-14 Silas L. Fong , Vincent Y. F. Tan

We consider the characterization of the asymptotic behavior of the average minimum mean-squared error (MMSE) and the average mutual information in scalar and vector fading coherent channels, where the receiver knows the exact fading channel…

Information Theory · Computer Science 2012-10-17 Alberto Gil C. P. Ramos , Miguel R. D. Rodrigues

The probability density function (PDF) associated with a given set of samples is approximated by a piecewise-linear polynomial constructed with respect to a binning of the sample space. The kernel functions are a compactly supported basis…

Numerical Analysis · Mathematics 2020-08-04 Giacomo Capodaglio , Max Gunzburger

Particle Flow Filters estimate the ``a posteriori" probability density function (PDF) by moving an ensemble of particles according to the likelihood. Particles are propagated under the system dynamics until a measurement becomes available…

Computational Engineering, Finance, and Science · Computer Science 2025-05-06 Simone Servadio

Prior asymptotic performance analyses are based on the series expansion of the moment-generating function (MGF) or the probability density function (PDF) of channel coefficients. However, these techniques fail for lognormal fading channels…

Information Theory · Computer Science 2017-07-27 Bingcheng Zhu , Julian Cheng , Jun Yan , Jinyuan Wang , Lenan Wu , Yongjin Wang

The capacity region of the cooperative two-user Multiple Access Channel (MAC) in Gaussian noise is determined to within a constant gap for both the Full-Duplex (FD) and Half-Duplex (HD) case. The main contributions are: (a) for both FD and…

Information Theory · Computer Science 2016-11-18 Daniela Tuninetti

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…

Information Theory · Computer Science 2015-07-15 Wei Yang , Giuseppe Caire , Giuseppe Durisi , Yury Polyanskiy
‹ Prev 1 4 5 6 7 8 10 Next ›