arXiv Analytics

Sign in

arXiv:1005.3889 [cs.IT]AbstractReferencesReviewsResources

Capacity and Modulations with Peak Power Constraint

Shiro Ikeda, Kazunori Hayashi, Toshiyuki Tanaka

Published 2010-05-21, updated 2011-05-16Version 2

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 under such constraints, it is crucial to take these constraints into consideration properly. In this paper, we propose a direct approach to compare the achievable rates of practical input constellations and the capacity under such constraints. As an example, we study the discrete-time complex-valued additive white Gaussian noise (AWGN) channel and compare the capacity under the peak power constraint with the achievable rates of phase shift keying (PSK) and quadrature amplitude modulation (QAM) input constellations.

Comments: 9 pages with 12 figures. Preparing for submission
Categories: cs.IT, math.IT
Related articles: Most relevant | Search more
arXiv:cs/0512076 [cs.IT] (Published 2005-12-18)
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
arXiv:cs/0505078 [cs.IT] (Published 2005-05-30, updated 2005-07-04)
On the Parity-Check Density and Achievable Rates of LDPC Codes
arXiv:1102.5112 [cs.IT] (Published 2011-02-24, updated 2013-07-19)
Achievable Rates for Channels with Deletions and Insertions