Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Extending the Shannon Upper Bound Using Spiral Modulation (1512.04830v3)

Published 15 Dec 2015 in cs.IT and math.IT

Abstract: The Shannon upper bound places a limit on the error-free information transmission rate (capacity) of a noisy channel. It has stood for over sixty years, and underlies both theoretical and practical work in the telecommunications industry. This upper bound arises from the Shannon-Hartley law, which has two parameters: the available bandwidth and the signal-to-noise power ratio. However, aside from these explicit parameters, the Shannon-Hartley law also rests on certain assumptions. One of these is that the channel is linear: recent work has shown that nonlinear channels are not limited by the Shannon upper bound. A second assumption, arising from the mathematical tools used in its proof, is that signals are periodic. Surprisingly, the capacity limit associated with non-periodic signals has not previously been examined. Here we show, both theoretically and by construction, that the use of non-periodic signals, based on complex spirals, allows the Shannon upper bound to be extended.

Citations (1)

Summary

We haven't generated a summary for this paper yet.