arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1010.4855cs.ITcs.CCmath.IT
收藏

从通信理论角度理解系统级功耗

Towards a communication-theoretic understanding of system-level power consumption

Pulkit Grover, Kristen Ann Woyach, Anant Sahai

摘要:

传统的通信理论关注于最小化发射功率。然而,通信链路越来越多地在较短的范围内操作,其中发射功率可以显著小于解码中消耗的功率。本文模型所需的解码功率,并从两个互补的角度研究了系统总功率的最小化。首先,考虑孤立的点对点链路。使用新的消息传递解码的复杂性的下限,下限推导出解码功率。这些界限表明:1)在发射功率和解码功率之间存在基本的折衷; 2)与关注发射功率的传统“瀑布”曲线的含义不同,当错误概率变为零时,总功率必须发散到无穷大; 3)规则LDPC,而不是它们已知的实现容量的不规则对应物,可以被示出为在某些情况下是功率阶数最优的;以及4)优化发射功率被限制在远离香农极限的范围内。第二,我们考虑链接的集合。当系统既产生又面临干扰时,编码允许系统支持更高密度的发射机-接收机对(假设干扰被视为噪声)。然而,在低密度下,在一些情况下,未编码传输可能更功率有效。

英文摘要:

Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be significantly smaller than the power consumed in decoding. This paper models the required decoding power and investigates the minimization of total system power from two complementary perspectives. First, an isolated point-to-point link is considered. Using new lower bounds on the complexity of message-passing decoding, lower bounds are derived on decoding power. These bounds show that 1) there is a fundamental tradeoff between transmit and decoding power; 2) unlike the implications of the traditional "waterfall" curve which focuses on transmit power, the total power must diverge to infinity as error probability goes to zero; 3) Regular LDPCs, and not their known capacity-achieving irregular counterparts, can be shown to be power order optimal in some cases; and 4) the optimizing transmit power is bounded away from the Shannon limit. Second, we consider a collection of links. When systems both generate and face interference, coding allows a system to support a higher density of transmitter-receiver pairs (assuming interference is treated as noise). However, at low densities, uncoded transmission may be more power-efficient in some cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑