ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Reduced Energy Min-Max Decoding Algorithm for Ldpc Code with Adder Correction Technique

Journal: International Journal of Computational Engineering Research(IJCER) (Vol.6, No. 11)

Publication Date:

Authors : ; ;

Page : 01-07

Keywords : Processing; highrate; high-speed; layered schedule; message compression; NB-LDPC; trellis min-max (T-MM); VLSI design.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

In this paper, high linear architectures for analysing the first two maximum or minimum values are of paramount importance in several uses, including iterative decoders. We proposed the adder and LDPC. The min-sum processing step that it gives only two different output magnitude values irrespective of the number of incoming bit-to check messages. These new micro-architecture layouts would employ the minimum number of comparators by exploiting the concept of survivors in the search. These would result in reduced number of comparisons and consequently reduced energy use. Multipliers are complex units and play an important role in finding the overall area, speed and power consumption of digital designs. By using the multiplier we can minimize the parameters like latency, complexity and power consumption.

Last modified: 2016-12-13 15:35:39