PROJECT TITLE :

On the VLSI Energy Complexityof LDPC Decoder Circuits - 2017

ABSTRACT:

Sequences of randomly generated bipartite configurations are analyzed; underneath mild conditions virtually surely such configurations have minimum bisection width proportional to the number of vertices. This implies an virtually positive O(n 2 /d max a pair of ) scaling rule for the energy of directlyimplemented low-density parity-check (LDPC) decoder circuits for codes of block length n and most node degree d max . It also implies an O(n3/two /d max ) lower bound for serialized LDPC decoders. It's also shown that every one (vs nearly all) capability-approaching, directly-implemented non-split-node LDPC decoding circuits, have energy, per iteration, that scales as O(? two ln 3 ?), where ? = (one - R/C) -1 is that the reciprocal gap to capability, R is code rate, and C is channel capability.