On the concentration of the crest factor for OFDM signals

This paper applies several concentration inequalities to prove concentration results for the crest factor of OFDM signals. The considered approaches are, to the best of our knowledge, new in the context of establishing concentration for OFDM signals.

[1]  C. McDiarmid.  Concentration , 1862, The Dental register.

[2]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[3]  M. Talagrand.  Concentration of measure and isoperimetric inequalities in product spaces , 1994, math/9406212.

[4]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[5]  R. Salem,et al.  Some properties of trigonometric series whose terms have random signs , 1954 .

[6]  Nicholas Kalouptsidis,et al.  Achievable Rates for Nonlinear Volterra Channels , 2011, IEEE Transactions on Information Theory.

[7]  M. Habib.  Probabilistic methods for algorithmic discrete mathematics , 1998 .

[8]  Holger Boche,et al.  Upper bounds on the statistical distribution of the crest-factor in OFDM transmission , 2003, IEEE Trans. Inf. Theory.

[9]  M. Talagrand.  A new look at independence , 1996 .

[10]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[11]  Nicolas Macris,et al.  Tight Bounds on the Capacity of Binary Input Random CDMA Systems , 2008, IEEE Transactions on Information Theory.

[12]  Gerhard Wunder,et al.  Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design , 2004, IEEE Transactions on Information Theory.

[13]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[14]  Igal Sason,et al.  On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory , 2011, ArXiv.

[15]  Kazuoki Azuma.  WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .