中文
相关论文

相关论文: Peak-to-average power ratio of good codes for Gaus…

200 篇论文

We revisit Shannon's problem of bounding the capacity of bandlimited Gaussian channel (BLGC) with peak power constraint, and extend the problem to the peak-to-average-power-ratio (PAPR) constrained case. By lower bounding the achievable…

信息论 · 计算机科学 2018-08-31 Yizhu Wang , Jing Zhou , Wenyi Zhang

One of the fundamental endeavors in radio frequency (RF) metrology is to measure the power of signals, where a common aim is to estimate the peak-to-average power ratio (PAPR), which quantifies the ratio of the maximum (peak) to the mean…

信号处理 · 电气工程与系统科学 2025-06-12 Adam Wunderlich , Aric Sanders

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

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

信息论 · 计算机科学 2020-08-19 Gonzalo Vazquez-Vilar

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

Starting from Shannon's celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to capacity-approaching codes. We focus on the contributions that have led to the most significant improvements in…

信息论 · 计算机科学 2007-07-13 Daniel J. Costello , G. David Forney

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By…

信息论 · 计算机科学 2021-01-01 Xinchun Yu , Shuangqin Wei , Yuan Luo

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

A practical communication channel often suffers from constraints on input other than the average power, such as the peak power constraint. In order to compare achievable rates with different constellations as well as the channel capacity…

信息论 · 计算机科学 2011-05-17 Shiro Ikeda , Kazunori Hayashi , Toshiyuki Tanaka

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…

信息论 · 计算机科学 2014-10-14 Silas L. Fong , Vincent Y. F. Tan

For the discrete-time additive white generalized Gaussian noise channel with a generalized input power constraint, with the respective shape and power parameters >= 1, we derive an upper bound on the optimal block error exponent. Explicit…

信息论 · 计算机科学 2025-09-11 Sergey Tridenski , Anelia Somekh-Baruch

In this paper, we consider single- and multi-user Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities. In the first of two contributions, we study asymptotic expansions for the…

信息论 · 计算机科学 2016-09-22 Lan V. Truong , Silas L. Fong , Vincent Y. F. Tan

Sparse regression codes (SPARCs) are a promising coding scheme that can approach the Shannon limit over Additive White Gaussian Noise (AWGN) channels. Previous works have proven the capacity-achieving property of SPARCs with Gaussian design…

信息论 · 计算机科学 2023-03-16 Yizhou Xu , YuHao Liu , ShanSuo Liang , Tingyi Wu , Bo Bai , Jean Barbier , TianQi Hou

The capacity of a complex and discrete-time memoryless additive white Gaussian noise (AWGN) channel under three constraints, namely, input average power, input amplitude and output delivered power is studied. The output delivered power…

信息论 · 计算机科学 2020-04-27 Morteza Varasteh , Borzoo Rassouli , Bruno Clerckx

We study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have…

信息论 · 计算机科学 2011-10-11 Anusha Gorantla , Vinod Sharma

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

信息论 · 计算机科学 2026-05-13 Adeel Mahmood , Aaron B. Wagner

The channel capacity theorem for additive white Gaussian noise channel (AWGN), widely known as the Shannon-Hartley Law, expresses the information capacity of a channel bandlimited in the conventional Fourier domain in terms of the…

信息论 · 计算机科学 2009-01-29 Kamalesh Kumar Sharma

Polar codes are designed for parallel binary-input additive white Gaussian noise (BiAWGN) channels with an average power constraint. The two main design choices are: the mapping between codeword bits and channels of different quality, and…

信息论 · 计算机科学 2019-05-06 Thomas Wiegart , Tobias Prinz , Fabian Steiner , Peihong Yuan

We consider the problem of modulating the value of a parameter onto a band-limited signal to be transmitted over a continuous-time, additive white Gaussian noise (AWGN) channel, and estimating this parameter at the receiver. The performance…

信息论 · 计算机科学 2016-06-22 Nir Weinberger , Neri Merhav

Let $W$ be a binary-input memoryless symmetric (BMS) channel with Shannon capacity $I(W)$ and fix any $\alpha > 0$. We construct, for any sufficiently small $\delta > 0$, binary linear codes of block length $O(1/\delta^{2+\alpha})$ and rate…

信息论 · 计算机科学 2022-01-25 Venkatesan Guruswami , Andrii Riazanov , Min Ye
‹ 上一页 1 2 3 10 下一页 ›