Energy, Latency, and Reliability Tradeoffs in Coding Circuits
Christopher Blake, Frank R. Kschischang · IEEE Transactions on Information Theory · 2018
Using the Thompson circuit complexity model, it is shown that fully parallel encoding and decoding schemes with asymptotic block error probability that scales as O( f (n)) have energy that scales as Ω(n- ln f (n)1/2). In addition, it is shown that the number of clock cycles [T(n)] required for any encoding or decoding scheme that reaches this bound must scale as T(n) ≥ - ln f (n)1/2. Similar scaling results are extended to serialized computation. A similar approach is extended to three dimensions by generalizing the Grover information-friction energy model. Within this model, it is shown that encoding and decoding schemes with probability of block error Pe(n) consume at least Ω(n(- ln Pe(n))(1/3)) energy.