TY - GEN

T1 - Fundamental limits on the power consumption of encoding and decoding

AU - Grover, Pulkit

AU - Goldsmith, Andrea

AU - Sahai, Anant

PY - 2012

Y1 - 2012

N2 - We provide fundamental information-theoretic bounds on the required circuit wiring complexity and power consumption for encoding and decoding of error-correcting codes. These bounds hold for all codes and all encoding and decoding algorithms implemented within the paradigm of our VLSI model. This model essentially views computation on a 2-D VLSI circuit as a computation on a network of connected nodes. The bounds are derived based on analyzing information flow in the circuit. They are then used to show that there is a fundamental tradeoff between the transmit and encoding/decoding power, and that the total (transmit + encoding + decoding) power must diverge to infinity at least as fast as cube-root of log 1/P e, where P e is the average block-error probability. On the other hand, for bounded transmit-power schemes, the total power must diverge to infinity at least as fast as square-root of log 1/P e due to the burden of encoding/decoding.

AB - We provide fundamental information-theoretic bounds on the required circuit wiring complexity and power consumption for encoding and decoding of error-correcting codes. These bounds hold for all codes and all encoding and decoding algorithms implemented within the paradigm of our VLSI model. This model essentially views computation on a 2-D VLSI circuit as a computation on a network of connected nodes. The bounds are derived based on analyzing information flow in the circuit. They are then used to show that there is a fundamental tradeoff between the transmit and encoding/decoding power, and that the total (transmit + encoding + decoding) power must diverge to infinity at least as fast as cube-root of log 1/P e, where P e is the average block-error probability. On the other hand, for bounded transmit-power schemes, the total power must diverge to infinity at least as fast as square-root of log 1/P e due to the burden of encoding/decoding.

UR - http://www.scopus.com/inward/record.url?scp=84867537624&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867537624&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2012.6284015

DO - 10.1109/ISIT.2012.6284015

M3 - Conference contribution

AN - SCOPUS:84867537624

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2716

EP - 2720

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -