2015/11/17 by Yang Liu, Jing Li, Liu, Yang +3
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1511.05509
This manuscript has been withdrawn since a new kind of nonlinear analog code is now being developed and the results of the linear analog codes in this paper will be included as parts of a new manuscript
openalex publication_date 2015/11/17 · arxiv created 2015/11/18 · arxiv updated 2015/11/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we carefully study the MSE performance of the linear analog codes. We have derived a lower bound of the MSE performance under Likelihood(ML) and Linear Minimal Mean Square Error(LMMSE) decoding criteria respectively. It is proved in this essay that a kind of linear analog codes called \emph unitary codes can simultaneously achieve both of these two bounds. At the same time, we compare the obtained linear analog codes' MSE bounds with the performance of some existing nonlinear codes. The results showed that linear analog codes are actually not very satisfying and convinced us that more concerns should be cast onto the nonlinear class in order to find powerful analog codes.