2013/06/03 by Jing Li, Li, Jing, Kai Xie +1
Computer Science · Engineering · Mathematics · #Analog and Mixed-Signal Circuit Design #Cellular Automata and Applications #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1306.0587
46th Annual Conference on Computer Sciences and Information Systems (CISS 2012), 2012, 5 pages, 5 figure
arxiv created 2013/06/03 · openalex publication_date 2013/06/03 · arxiv updated 2013/06/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Analog error correction codes, by relaxing the source space and the codeword space from discrete fields to continuous fields, present a generalization of digital codes. While linear codes are sufficient for digital codes, they are not for analog codes, and hence nonlinear mappings must be employed to fully harness the power of analog codes. This paper demonstrates new ways of building effective (nonlinear) analog codes from a special class of nonlinear, fast-diverging functions known as the chaotic functions. It is shown that the "butterfly effect" of the chaotic functions matches elegantly with the distance expansion condition required for error correction, and that the useful idea in digital turbo codes can be exploited to construct efficient turbo-like chaotic analog codes. Simulations show that the new analog codes can perform on par with, or better than, their digital counter-parts when transmitting analog sources.