2 research outputs found
On Scaling Rules for Energy of VLSI Polar Encoders and Decoders
It is shown that all polar encoding schemes of rate of block
length implemented according to the Thompson VLSI model must take energy
. This lower bound is achievable up to
polylogarithmic factors using a mesh network topology defined by Thompson and
the encoding algorithm defined by Arikan. A general class of circuits that
compute successive cancellation decoding adapted from Arikan's butterfly
network algorithm is defined. It is shown that such decoders implemented on a
rectangle grid for codes of rate must take energy
, and this can also be reached up to polylogarithmic
factors using a mesh network. Capacity approaching sequences of energy optimal
polar encoders and decoders, as a function of reciprocal gap to capacity , have energy that scales as
Energy, Latency, and Reliability Tradeoffs in Coding Circuits
It is shown that fully-parallel encoding and decoding schemes with asymptotic
block error probability that scales as have
Thompson energy that scales as . As well, it is shown that the number of clock cycles
(denoted ) required for any encoding or decoding scheme that
reaches this bound must scale as . 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 is shown to be at least
.Comment: 13 pages, 2 figures, submitted for journal publication, submitted in
part for presentation at 2016 International Symposium on Information Theor