Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 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

Chaos-Based Anytime Reliable Coded Communications (1904.11954v1)

Published 17 Apr 2019 in eess.SP, cs.IT, math.IT, and nlin.CD

Abstract: Anytime reliable communication systems are needed in contexts where the property of vanishing error probability with time is critical. This is the case of unstable real time systems that are to be controlled through the transmission and processing of remotely sensed data. The most successful anytime reliable transmission systems developed so far are based on channel codes and channel coding theory. In this work, another focus is proposed, placing the stress on the waveform level rather than just on the coding level. This alleviates the coding and decoding complexity problems faced by other proposals. To this purpose, chaos theory is successfully exploited in order to design two different anytime reliable alternatives. The anytime reliability property is formally demonstrated in each case for the AWGN channel, under given conditions. The simulation results shown validate the theoretical developments, and demonstrate that these systems can achieve anytime reliability with affordable resource expenditure.

Citations (4)

Summary

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