UGC APPROVED ISSN 2278-1412

Archive

  Volume 13 | Issue 11

  Volume 13 | Issue 10

  Volume 13 | Issue 9

  Volume 13 | Issue 8

  Volume 13 | Issue 7

  Volume 13 | Issue 6

  Volume 13 | Issue 5

  Volume 13 | Issue 3

  Volume 13 | Issue 1

  Volume 12 | Issue 12

  Volume 12 | Issue 11

  Volume 12 | Issue 10

  Volume 12 | Issue 9

  Volume 12 | Issue 8

  Volume 12 | Issue 7

  Volume 12 | Issue 6

  Volume 12 | Issue 5

  Volume 12 | Issue 4

  Volume 12 | Issue 3

  Volume 12 | Issue 2

  Volume 12 | Issue 1

  Volume 11 | Issue 12

  Volume 11 | Issue 11

  Volume 11 | Issue 10

  Volume 11 | Issue 8

  Volume 11 | Issue 7

  Volume 11 | Issue 6

  Volume 11 | Issue 3

  Volume 11 | Issue 1

  Volume 10 | Issue 12

  Volume 10 | Issue 8

  Volume 10 | Issue 6

  Volume 10 | Issue 3

  Volume 10 | Issue 2

  Volume 10 | Issue 1

  Volume 9 | Issue 10

  Volume 8 | Issue 11

  Volume 8 | Issue 7

  Volume 7 | Issue 8

  Volume 7 | Issue 7

  Volume 7 | Issue 6

  Volume 7 | Issue 5

  Volume 7 | Issue 4

  Volume 7 | Issue 3

  Volume 7 | Issue 2

  Volume 7 | Issue 1

  Volume 6 | Issue 12

  Volume 6 | Issue 10

  Volume 6 | Issue 9

  Volume 6 | Issue 8

  Volume 6 | Issue 7

  Volume 6 | Issue 6

  Volume 6 | Issue 5

  Volume 6 | Issue 4

  Volume 6 | Issue 3

  Volume 6 | Issue 2

  Volume 6 | Issue 1

  Volume 5 | Issue 12

  Volume 5 | Issue 11

  Volume 5 | Issue 10

  Volume 5 | Issue 9

  Volume 5 | Issue 8

  Volume 5 | Issue 7

  Volume 5 | Issue 6

  Volume 5 | Issue 5

  Volume 5 | Issue 4

  Volume 5 | Issue 3

  Volume 5 | Issue 2

  Volume 5 | Issue 1

  Volume 4 | Issue 12

  Volume 4 | Issue 10

  Volume 4 | Issue 8

  Volume 4 | Issue 7

  Volume 4 | Issue 6

  Volume 4 | Issue 5

  Volume 4 | Issue 4

  Volume 4 | Issue 2

  Volume 4 | Issue 1

  Volume 3 | Issue 10

  Volume 3 | Issue 8

  Volume 3 | Issue 6

  Volume 3 | Issue 5

  Volume 3 | Issue 4

  Volume 3 | Issue 3

  Volume 3 | Issue 2

  Volume 3 | Issue 1

  Volume 2 | Issue 12

  Volume 2 | Issue 11

  Volume 2 | Issue 10

  Volume 2 | Issue 9

  Volume 2 | Issue 8

  Volume 2 | Issue 7

  Volume 2 | Issue 2

  Volume 1 | Issue 9

  Volume 1 | Issue 8

  Volume 1 | Issue 7

  Volume 1 | Issue 6

  Volume 1 | Issue 4

  Volume 1 | Issue 3

  Volume 1 | Issue 2

  Volume 1 | Issue 1

Current Volume 13 | Issue 12

Result Analysis of Carry Skip Adder using High-Speed skips logic at different levels


Volume:  5 - Issue: 07 - Date: 01-07-2016
Approved ISSN:  2278-1412
Published Id:  IJAECESTU200 |  Page No.: 1101-1105
Author: Rajesh sahu
Co- Author: Deepak kirar
Abstract:-A carry skip adder (CSKA) structure has the high speed and very low power consumption. The speed of the structure is achieved by concatenation of all the blocks. The incrimination blocks are used to improve the efficiency of the carry skip adder structure. In existing method multiplexer logic is used, the proposed structure uses the AND-OR-Invert (AOI) and OR-AND-Invert (OAI) for the skip logic. The carry skip adder structure is realized with both fixed stage size and variable stage size where the delay is reduced, and speed is improved. A hybrid variable latency extension lowers the power consumption without affecting the speed of the circuit. The results are obtained using XILINX 14.3 and it gives improvements in the delay and energy of the structures. In addition to this structure, the power–delay product was low among all the structures, while having its energy–delay product was almost same as that of the conventional structure. Simulations on the proposed structure by using hybrid variable latency CSKA reduces the power consumption compared with the previous works and it produces a high speed
Key Words:-Carry skip adder (CSKA), energy efficient, high performance, hybrid variable latency Adders
Area:-Engineering
Download Paper: 
Preview This Article

Unable to display PDF file. Download instead.


Download Paper

Downlaod Paper

No. of Download

000143

Impact Factor

7.4


ijaece

Upcoming Events


Special Issue For Paper


Upcoming Conference


Call For Paper