2011/05/08 by Kai Xie, Jing Jing, Xie, Kai +3
Computer Science · Engineering · Mathematics · #Analog and Mixed-Signal Circuit Design #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #VLSI and Analog Circuit Testing #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1105.1520
5 pages, 2 figures, submitted to IEEE Globecom 2011
arxiv created 2011/05/08 · openalex publication_date 2011/05/08 · arxiv updated 2011/05/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper studies the theory of linear analog error correction coding. Since classical concepts of minimum Hamming distance and minimum Euclidean distance fail in the analog context, a new metric, termed the "minimum (squared Euclidean) distance ratio," is defined. It is shown that linear analog codes that achieve the largest possible value of minimum distance ratio also achieve the smallest possible mean square error (MSE). Based on this achievability, a concept of "maximum distance ratio expansible (MDRE)" is established, in a spirit similar to maximum distance separable (MDS). Existing codes are evaluated, and it is shown that MDRE and MDS can be simultaneously achieved through careful design.