ISSN 2278-9723
 

- 


Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures

S.SABARINATHAN, K.DEEPADEVI.

Abstract
High speed architectures for finding the first two max/min values are of paramount importance in several applications, including iterative decoders and for proposed the adder and Low density parity check code (LDPC) has been implemented. The min-sum processing that it produces only two different output magnitude values irrespective of the number of incoming bit-to check messages. The new microarchitecture structures would employ the minimum number of comparators by exploiting the concept of survivor in the search. These result in reduced number of comparisons and consequently reduced energy use. Multipliers are complex units and play an important role in deciding the overall area, speed and power consumption of digital designs. The main feature of proposed algorithm is the use of the optimization factor. Also, the Optimization factor is not multiplied in posterior information which reduces complexity of the algorithm. By using the multiplier to reduce the parameters like latency, complexity and power consumption.

Key words: Low density parity check code (LDPC),microarchitecture structures, optimization factor


 
ARTICLE TOOLS
Abstract
PDF Fulltext
How to cite this articleHow to cite this article
Citation Tools
Related Records
 Articles by S.SABARINATHAN
Articles by K.DEEPADEVI
on Google
on Google Scholar


How to Cite this Article
Pubmed Style

S.SABARINATHAN, K.DEEPADEVI. Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures. . 2016; 4(1): 35-39. doi:10.31838/ijccts/04.01.06


Web Style

S.SABARINATHAN, K.DEEPADEVI. Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures. http://www.ijccts.org/?mno=302643850 [Access: June 12, 2021]. doi:10.31838/ijccts/04.01.06


AMA (American Medical Association) Style

S.SABARINATHAN, K.DEEPADEVI. Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures. . 2016; 4(1): 35-39. doi:10.31838/ijccts/04.01.06



Vancouver/ICMJE Style

S.SABARINATHAN, K.DEEPADEVI. Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures. . (2016), [cited June 12, 2021]; 4(1): 35-39. doi:10.31838/ijccts/04.01.06



Harvard Style

S.SABARINATHAN, K.DEEPADEVI (2016) Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures. , 4 (1), 35-39. doi:10.31838/ijccts/04.01.06



Turabian Style

S.SABARINATHAN, K.DEEPADEVI. 2016. Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures. International Journal of Communication and Computer Technologies, 4 (1), 35-39. doi:10.31838/ijccts/04.01.06



Chicago Style

S.SABARINATHAN, K.DEEPADEVI. "Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures." International Journal of Communication and Computer Technologies 4 (2016), 35-39. doi:10.31838/ijccts/04.01.06



MLA (The Modern Language Association) Style

S.SABARINATHAN, K.DEEPADEVI. "Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures." International Journal of Communication and Computer Technologies 4.1 (2016), 35-39. Print. doi:10.31838/ijccts/04.01.06



APA (American Psychological Association) Style

S.SABARINATHAN, K.DEEPADEVI (2016) Reduced Complexity MS Algorithm for Finding the First Two Minima in Tree Architectures. International Journal of Communication and Computer Technologies, 4 (1), 35-39. doi:10.31838/ijccts/04.01.06