The price of certainty: iterative decoding from a total power perspective

Abstract

The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the power consumption small. Traditionally, explicit power-dependent (idealized) models for the communication channel are used to study the transmit power required. The resulting dasiawaterfallpsila curves convey the revolutionary idea that unboundedly low probabilities of bit-error are attainable using only finite transmit power. However, it has long been observed that the decoder complexity, and hence the total power consumption, goes up when attempting to use codes that operate close to the waterfall curve. This paper explores this theme by using explicit models for computation and power consumption at the decoder. To get a lower bound, an ASIC-oriented model is given that allows for extreme parallelism in implementation. The decoder architecture is in the spirit of iterative decoding for sparse-graph codes, but is further idealized in that it allows for more computational power than is currently known to be implementable. Generalized sphere-packing arguments are used to derive bounds on the number of decoding iterations needed for any possible code given only the rate and the desired probability of error. The lower bound is plotted to show an unavoidable tradeoff between the average bit-error probability and the total power used in transmission and decoding. In the spirit of conventional waterfall curves, we call these ldquowatersliderdquo curves.