Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/7027| Title: | Design and implementation of computationally efficient arithmetic unit [articol] |
| Authors: | Jaisudhan Pazhani, A.Azhagu Vasanthanayaki, C. |
| Subjects: | Approximate computing Carry look-Ahead Adder Reconfigurable adder and multiplier Splitting concept |
| Issue Date: | 2019 |
| Publisher: | Timișoara : Editura Politehnica |
| Citation: | Jaisudhan Pazhani,A.Azhagu; Vasanthanayaki,C.: Design and implementation of computationally efficient arithmetic unit. Timişoara: Editura Politehnica, 2019. |
| Series/Report no.: | Journal of Electrical Engineering;Vol 19 No 3 |
| Abstract: | Approximate circuit designs empower us to swap over computation quality, for instance, exactness and computational attempt by abusing the characteristic oversight adaptability of various applications. As the computation excellence need of an application typically varies at runtime, it is attractive over to include the ability to reconfigure approximate circuits to satisfy such prerequisites and extra worthless computational attempt. These fresh structures are well-organized as far as area, speed, and power utilization concerning their exact adversaries. Multiplier and adder play a vital part in the present signal handling and different applications. With progresses in innovation, numerous specialists have attempted and are endeavoring to plan adder and multipliers which offer either of the following design targets – high speed, low power consumption, regularity of layout for VLSI implementation. In this paper approximate adders and splitting based multipliers are designed and the adder produce erroneous result. On the other hand, it generates erroneous outcomes, deterministically, in favor of a little portion of input combinations. In view of the fact that mistakes happen with enormously low likelihood, this new sort of adder and splitting based multiplier is significantly faster than state-of-the-art adders and multipliers at the point when the general latency is found the middle value of over numerous additions. |
| URI: | https://dspace.upt.ro/xmlui/handle/123456789/7027 |
| ISSN: | 1582-4594 |
| Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| BUPT_ART_Pazhani_f.pdf | 1.15 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.