Energy, Latency, and Reliability Tradeoffs in Coding Circuits

DOI10.1109/TIT.2018.2865701MaRDI QIDQ4615352zbMATH OpenOpenAlexWikidataFDO

Authors Christopher G. Blake, Frank R. Kschischang

Publication date 28 January 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.04026

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: It is shown that fully-parallel encoding and decoding schemes with asymptotic block error probability that scales as $Oleft(fleft(night)ight)$ have Thompson energy that scales as $Omegaleft(sqrtlnfleft(night)night)$. As well, it is shown that the number of clock cycles (denoted $Tleft(night)$) required for any encoding or decoding scheme that reaches this bound must scale as $Tleft(night)gesqrtlnfleft(night)$. Similar scaling results are extended to serialized computation. The Grover information-friction energy model is generalized to three dimensions and the optimal energy of encoding or decoding schemes with probability of block error $P_{m}athrme$ is shown to be at least $Omegaleft(nleft(ln{P}_{mathrme}left(night)ight{)}^{frac13}ight)$.

Cited in

(1)

• scientific article; zbMATH DE number 6765480 (Why is no real title available?)

This page was built for publication: Energy, Latency, and Reliability Tradeoffs in Coding Circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615352)