Vedic Mathematics for Binary Applications

Abhijeet Kumar

ISBN 10: 3659543306 / ISBN 13: 9783659543302

Published by LAP LAMBERT Academic Publishing Okt 2018, 2018

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -Conventional 24x24 multiply architectures are implemented in floating point multipliers using array multipliers, redundant binary architectures( Pipeline Stages), modified booth encoding, a binary tree of 4:2 Compressors (Wallace tree) and modified carry save array in conjunction with Booth's algorithm. There are number of problems associated with tree and array multipliers. Tree multipliers have many problems like shortest logic delay but irregular layouts with complicated interconnects, irregular layouts not only demand more physical design effort, but also introduce significant interconnect delay. Similarly, array multipliers has also some drawbacks associated with them such as they have larger delay and offer regular layout with simpler interconnects. Also significant amount of power consumption as reconfigurability at run time is not provided according to the input bit width. In order to remove the above problems, Urdhvatriyakbhyam algorithm of ancient Indian Vedic Mathematics is utilized. Simulation of 32-bit Floating Point Multiplier and application of Vedic Mathematics is an important part of this dissertation. 52 pp. Englisch.

Seller Inventory # 9783659543302

Bibliographic Details

• Title: Vedic Mathematics for Binary Applications
• Publisher: LAP LAMBERT Academic Publishing Okt 2018
• Publication Date: 2018
• Language: English
• ISBN 10: 3659543306
• ISBN 13: 9783659543302
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 4D millimeters 220 millimeters width by 150 millimeters height by 4 millimeters depth
• Weight: 96 grams

About this title

Synopsis

Conventional 24x24 multiply architectures are implemented in floating point multipliers using array multipliers, redundant binary architectures( Pipeline Stages), modified booth encoding, a binary tree of 4:2 Compressors (Wallace tree) and modified carry save array in conjunction with Booth's algorithm. There are number of problems associated with tree and array multipliers. Tree multipliers have many problems like shortest logic delay but irregular layouts with complicated interconnects, irregular layouts not only demand more physical design effort, but also introduce significant interconnect delay. Similarly, array multipliers has also some drawbacks associated with them such as they have larger delay and offer regular layout with simpler interconnects. Also significant amount of power consumption as reconfigurability at run time is not provided according to the input bit width. In order to remove the above problems, Urdhvatriyakbhyam algorithm of ancient Indian Vedic Mathematics is utilized. Simulation of 32-bit Floating Point Multiplier and application of Vedic Mathematics is an important part of this dissertation.