On the information rate of phase noise-limited communications

We discuss the accuracy of the time-discrete phase noise model described by a random walk with symbol-period spaced Gaussian increments. While this model is widely used for its simplicity, it is strictly valid in the slow phase regime only. It is customary to consider this model as a worst case, but a clear understanding of the phase dynamics which can be reliably represented may not be readily available. We address this problem by comparing the symbol-period spaced model with fractional-period spaced ones, which more reliably describe the physical system, in terms of the achievable information rate of the resulting phase noise channels. We show that indeed the symbol-period spaced model is a worst case that may offer a good modeling accuracy under a wide range of phase dynamics.

[1]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[2]  Randolph Nelson,et al.  Probability, Stochastic Processes, and Queueing Theory , 1995 .

[3]  J. Doob.  Stochastic processes , 1953 .

[4]  Peter J. Winzer,et al.  Calculation of Mutual Information for Partially Coherent Gaussian Channels With Applications to Fiber Optics , 2010, IEEE Transactions on Information Theory.

[5]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[6]  F. L. Walls,et al.  Characterization of frequency stability in precision frequency sources , 1991, Proc. IEEE.

[7]  A. Demir,et al.  Phase noise in oscillators: a unifying theory and numerical methods for characterization , 2000 .

[8]  Giulio Colavolpe,et al.  On the Information Rate and Repeat-Accumulate Code Design for Phase Noise Channels , 2011, IEEE Transactions on Communications.

[9]  Emre Telatar,et al.  Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit , 2000, IEEE Trans. Inf. Theory.

[10]  Justin Dauwels,et al.  On graphical models for communications and machine learning: algorithms, bounds, and analog implementation , 2006 .

[11]  Justin Dauwels,et al.  Computation of information rates by particle methods , 2004, ISIT.

[12]  V. Sharma,et al.  Entropy and channel capacity in the regenerative setup with applications to Markov channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[13]  M. Magarini,et al.  The Information Rate Transferred Through the Discrete-Time Wiener's Phase Noise Channel , 2012, Journal of Lightwave Technology.

[14]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[15]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[16]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).