Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/346200
Title: Design and implementation of efficient adder and multiplier architectures for accurate and approximate computations
Researcher: Azhagu Jaisudhan Pazhani A
Guide(s): Vasanthanayaki C
Keywords: Engineering and Technology
Computer Science
Computer Science Hardware and Architecture
Multiplier Architectures
Accurate Computations
Approximate Computations
University: Anna University
Completed Date: 2020
Abstract: newline With the advancement of Internet of Things (IOT), portable and handheld devices, there are some difficulties in the design of high energy efficient Very Large Scale Integration (VLSI) digital circuits. Some of the real time applications like image classifications, face recognition, DSP applications, automatic driverless car, neural network, Fuzzy system etc., do not require accurate computation. So approximation is preferred in arithmetic circuits and systems to attain low power consumption with less accuracy. In signal processing applications, energy consumption is mainly due to arithmetic operations like addition, subtraction, multiplication and division. So, it is necessary to design a power efficient adder and multiplier. This research work is focuses on the design of accurate adder, approximate adder, accurate multiplier and approximate multiplier with an application to design an area efficient and power efficient convolution layer architecture. newlineModified Flagged Binary adder (MFBA) is proposed as an accurate adder that performs four different operations (A+B, A+B+1, -(A+B+1), -(A+B+2)) in a single architecture which eventually leads to low area. Based on the control signals, the mode of operation is selected. It consists of modified preprocessing stage, modified prefix tree, modified flagged inversion cell. The generate (G), propagate (P) and intermediate signal (R) are computed in the preprocessing stage. In modified prefix tree, instead of individual bits, the pair of bits (A1A0, B1B0) is used for execution. Single carry is computed for the pair of bits and it is used to stimulate the next pair of inputs. So, there is simultaneous execution of multiple blocks which leads to the parallel operation. newline newline
Pagination: xxiii, 138p.
URI: http://hdl.handle.net/10603/346200
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File25.24 kBAdobe PDFView/Open
02_certificates.pdf606.84 kBAdobe PDFView/Open
03_abstracts.pdf92.5 kBAdobe PDFView/Open
04_acknowledgements.pdf164.81 kBAdobe PDFView/Open
05_contents.pdf121.5 kBAdobe PDFView/Open
06_listoftables.pdf95.84 kBAdobe PDFView/Open
07_listoffigures.pdf106.01 kBAdobe PDFView/Open
08_listofabbreviations.pdf172.21 kBAdobe PDFView/Open
09_chapter1.pdf630.51 kBAdobe PDFView/Open
10_chapter2.pdf333.6 kBAdobe PDFView/Open
11_chapter3.pdf699.41 kBAdobe PDFView/Open
12_chapter4.pdf724.99 kBAdobe PDFView/Open
13_chapter5.pdf642.28 kBAdobe PDFView/Open
14_conclusion.pdf98.43 kBAdobe PDFView/Open
15_references.pdf214.71 kBAdobe PDFView/Open
16_listofpublications.pdf317.21 kBAdobe PDFView/Open
80_recommendation.pdf126.86 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: