2010/10/23 by Pulkit Grover, Grover, Pulkit, Kristen Ann Woyach +3
Computer Science · Engineering · #Computational Complexity (cs.CC) #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1010.4855
openalex publication_date 2010/10/23 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
Traditional communication theory focuses on minimizing transmit power.\nHowever, communication links are increasingly operating at shorter ranges where\ntransmit power can be significantly smaller than the power consumed in\ndecoding. This paper models the required decoding power and investigates the\nminimization of total system power from two complementary perspectives.\n First, an isolated point-to-point link is considered. Using new lower bounds\non the complexity of message-passing decoding, lower bounds are derived on\ndecoding power. These bounds show that 1) there is a fundamental tradeoff\nbetween transmit and decoding power; 2) unlike the implications of the\ntraditional "waterfall" curve which focuses on transmit power, the total power\nmust diverge to infinity as error probability goes to zero; 3) Regular LDPCs,\nand not their known capacity-achieving irregular counterparts, can be shown to\nbe power order optimal in some cases; and 4) the optimizing transmit power is\nbounded away from the Shannon limit.\n Second, we consider a collection of links. When systems both generate and\nface interference, coding allows a system to support a higher density of\ntransmitter-receiver pairs (assuming interference is treated as noise).\nHowever, at low densities, uncoded transmission may be more power-efficient in\nsome cases.\n