Journal Article10.1049/IET-CDS.2018.5222
LDPC check node implementation using reversible logic
TL;DR: This work proposes a low-power LDPC CN architecture using reversible logic gates, which achieves about 300% reduction in power delay product with affordable complexity as compared to its classical implementation.
read more
Abstract: Reversible logic is an emerging digital design paradigm which promises low energy dissipation; thanks to its information-lossless nature. True potential of this exciting concept can only be assessed by facing the design of practical complexity applications. Low density parity check (LDPC) decoding is one such application from forward error correction domain. The core of LDPC decoding is the check node (CN) processor, which executes the decoding algorithm and constitutes a major portion of decoder's overall power consumption. This work proposes a low-power LDPC CN architecture using reversible logic gates. Transistor level design and full custom layout of proposed architecture is carried out on UMC 90 nm complementary metal–oxide–semiconductor technology. All reversible blocks of proposed CN are optimised for quantum cost, garbage outputs and transistor count. The CN functionality is validated with post-layout simulations, layout versus schematic checks and design rule checks. The proposed CN occupies a post-layout area of 0.013 mm2, achieves up to 4.3 GHz frequency and consumes 52 μ W power. The performance of proposed CN is also compared with its implementation using irreversible gates. The proposed CN achieves about 300% reduction in power delay product with affordable complexity as compared to its classical implementation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Comparative Review of Recent Advances in Decoding Algorithms for Low-Density Parity-Check (LDPC) Codes and Their Applications
TL;DR: A comprehensive overview on the current state-of-the art LDPC decoding algorithms and their applications and views on the open research problems, challenges and the scope for future prospects are forecasted through discussions.
23
Approximate Full Adders for Energy Efficient Image Processing Applications
TL;DR: The unconstrained synthesis results show that among all the proposed AFAs, the AFA1 and AFA2 are found to be energy-efficient adders with high PSNR.
14
An Approximate Low-Power Lifting Scheme Using Reversible Logic
TL;DR: A reversible logic based design of Haar wavelet transform and lifting scheme for HaarWavelet transform, a first in literature of reversible logic, and two architectures for Reversible Approximate Full Adder (RAFA) - RAFA-1 andRAFA-2; optimised explicitly forversible logic based implementation.
Energy Efficient Design of Fast Fourier Transform using Reversible Logic
TL;DR: In this paper , a reversible logic implementation of the Fast Fourier Transform (FFT) algorithm as a relevant design case is presented. And the proposed architecture's hierarchical design is based on a reversible standard cell approach.
5
Improving security of 5G networks with multiplicative masking method for LDPC codes
TL;DR: The security of 5G networks is improved owing to the randomization of the channel-coding process and protection of important information against side-channel attacks.
3
References
•Book
Low-Density Parity-Check Codes
Robert G. Gallager
- 01 Jan 1963
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Elementary gates for quantum computation.
Adriano Barenco,Charles H. Bennett,Richard Cleve,David P. DiVincenzo,Norman Margolus,Peter W. Shor,Tycho Sleator,John A. Smolin,Harald Weinfurter +8 more
TL;DR: U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
4.7K
Irreversibility and heat generation in the computing process
TL;DR: Two simple, but representative, models of bistable devices are subjected to a more detailed analysis of switching kinetics to yield the relationship between speed and energy dissipation, and to estimate the effects of errors induced by thermal fluctuations.
Logical reversibility of computation
TL;DR: This result makes plausible the existence of thermodynamically reversible computers which could perform useful computations at useful speed while dissipating considerably less than kT of energy per logical step.
4K
•Book
Quantum Computation and Quantum Information: 10th Anniversary Edition
Michael A. Nielsen,Isaac L. Chuang +1 more
- 31 Jan 2011
TL;DR: Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering.
3.8K