Upper Bound on the Capacity of a Cascade of Nonlinear and Noisy Channels

March 26, 2015 Β· Declared Dead Β· πŸ› Information Theory Workshop

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Gerhard Kramer, Mansoor I. Yousefi, Frank R. Kschischang arXiv ID 1503.07652 Category cs.IT: Information Theory Citations 84 Venue Information Theory Workshop Last Checked 4 months ago
Abstract
An upper bound on the capacity of a cascade of nonlinear and noisy channels is presented. The cascade mimics the split-step Fourier method for computing waveform propagation governed by the stochastic generalized nonlinear Schroedinger equation. It is shown that the spectral efficiency of the cascade is at most log(1+SNR), where SNR is the receiver signal-to-noise ratio. The results may be applied to optical fiber channels. However, the definition of bandwidth is subtle and leaves open interpretations of the bound. Some of these interpretations are discussed.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted