English
Related papers

Related papers: Approaching the Gaussian channel capacity with APS…

200 papers

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…

Information Theory · Computer Science 2011-05-17 Shiro Ikeda , Kazunori Hayashi , Toshiyuki Tanaka

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

Capacity of M-ary Amplitude and Phase-Shift Keying(M-APSK) over an Additive White Gaussian Noise(AWGN) channel that also introduces an unknown carrier phase rotation is considered. The phase remains constant over a block of L symbols and it…

Information Theory · Computer Science 2007-07-13 Daniel C. Cunha , Jaime Portugheis

The polar receiver architecture is a receiver design that captures the envelope and phase information of the signal rather than its in-phase and quadrature components. Several studies have demonstrated the robustness of polar receivers to…

Information Theory · Computer Science 2022-07-22 Neil Irwin Bernardo , Jingge Zhu , Jamie Evans

The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a…

Information Theory · Computer Science 2010-10-07 G. D. Raghava , B. Sundar Rajan

The capacity and optimal signaling over a fixed Gaussian MIMO channel are considered under the joint total and per-antenna power constraints (TPC and PAC). While the general case remains an open problem, a closed-form full-rank solution is…

Information Theory · Computer Science 2018-09-05 Sergey Loyka

We study the capacity of the power-constrained additive Gaussian channel with an entropy constraint at the input. In particular, we characterize this capacity in the low signal-to-noise ratio regime at small entropy. This follows as a…

Information Theory · Computer Science 2025-04-30 Adway Girish , Shlomo Shamai , Emre Telatar

In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel of two users using finite dimension constellations. Various transmission strategies are studied, namely superposition coding (SC) and…

Information Theory · Computer Science 2014-03-24 Zeina Mheich , Florence Alberge , Pierre Duhamel

Constellation shaping is an energy-efficient strategy involving the transmission of lower-energy signals more frequently than higher-energy signals. Previous work has shown that shaping is particularly effective when used with coded…

Information Theory · Computer Science 2012-10-18 Xingyu Xiang , Matthew C. Valenti

The capacity achieving probability mass function (PMF) of a finite signal constellation with an average power constraint is in most cases non-uniform. A common approach to generate non-uniform input PMFs is Huffman shaping, which consists…

Information Theory · Computer Science 2011-06-28 Georg Böcherer , Fabian Altenbach , Rudolf Mathar

The large scale reflector array of programmable metasurfaces is capable of increasing the power efficiency of backscatter communications via passive beamforming and thus has the potential to revolutionize the low-data-rate nature of…

Signal Processing · Electrical Eng. & Systems 2023-03-31 Wei Wang , Bincheng Zhu , Yongming Huang , Wei Zhang

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under…

Information Theory · Computer Science 2018-06-26 Antonio Campello , Daniel Dadush , Cong Ling

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…

Information Theory · Computer Science 2013-02-28 Amir Ingber , Ram Zamir , Meir Feder

For a single transmit and receive antenna system, a new constellation design is proposed to combat errors in the phase estimate of the channel coefficient. The proposed constellation is a combination of PSK and PAM constellations, where PSK…

Information Theory · Computer Science 2010-10-11 Naqueeb Warsi , Rahul Vaze , Tapan Shah

We study the design of amplitude phase-shift keying (APSK) constellations for a coherent fiber-optical communication system where nonlinear phase noise (NLPN) is the main system impairment. APSK constellations can be regarded as a union of…

Information Theory · Computer Science 2015-01-07 Christian Häger , Alexandre Graell i Amat , Alex Alvarado , Erik Agrell

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…

Information Theory · Computer Science 2009-11-04 Ramy H. Gohary , Timothy N. Davidson

In this paper we fill the gap in previous works by proving the formula for entanglement-assisted capacity of quantum channel with additive constraint (such as bosonic Gaussian channel). The main tools are the coding theorem for…

Quantum Physics · Physics 2009-11-07 A. S. Holevo

This paper characterizes the capacity region of Gaussian MIMO broadcast channels (BCs) with per-antenna power constraint (PAPC). While the capacity region of MIMO BCs with a sum power constraint (SPC) was extensively studied, that under…

Information Theory · Computer Science 2017-05-18 Thuy M. Pham , Ronan Farrell , Le-Nam Tran
‹ Prev 1 2 3 10 Next ›