Energy, Latency, and Reliability Tradeoffs in Coding Circuits

DOI10.1109/TIT.2018.2865701zbMATH Open1427.94067arXiv1602.04026OpenAlexW2964024639WikidataQ129366065 ScholiaQ129366065MaRDI QIDQ4615352FDOQ4615352

Christopher G. Blake, Frank R. Kschischang

Publication date: 28 January 2019

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

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)$.

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

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (1)

• Title not available (Why is that?)

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)