On Scaling Rules for Energy of VLSI Polar Encoders and Decoders

preprint2016arXivOpen access

Abstract

It is shown that all polar encoding schemes of rate R>12R>\frac{1}{2} of block length NN implemented according to the Thompson VLSI model must take energy E≥Ω(N3/2)E\geΩ\left(N^{3/2}\right). 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 R>2/3R>2/3 must take energy E≥Ω(N3/2)E\geΩ(N^{3/2}), 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 χ=(1−R/C)−1χ= (1-R/C)^{-1}, have energy that scales as Ω(χ5.325)≤E≤O(χ7.05log⁡4(χ))Ω\left(χ^{5.325}\right)\le E \le O\left(χ^{7.05}\log^{4}\left(χ\right)\right).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.