{"paper":{"title":"On the Energy Complexity of LDPC Decoder Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher Blake, Frank R. Kschischang","submitted_at":"2015-02-27T18:37:09Z","abstract_excerpt":"It is shown that in a sequence of randomly generated bipartite configurations with number of left nodes approaching infinity, the probability that a particular configuration in the sequence has a minimum bisection width proportional to the number of vertices in the configuration approaches $1$ so long as a sufficient condition on the node degree distribution is satisfied. This graph theory result implies an almost sure $\\Omega\\left(n^{2}\\right)$ scaling rule for the energy of capacity-approaching LDPC decoder circuits that directly instantiate their Tanner Graphs and are generated according to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07999","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}