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

Design Area-Efficient and high speed 32bit CSLA


Volume:  4 - Issue: 08 - Date: 01-08-2015
Approved ISSN:  2278-1412
Published Id:  IJAECESTU248 |  Page No.: 555-559
Author: Malti Aryayan
Co- Author: Jaikaran Singh Chauhan
Abstract:-Modern applications demand extremely less area budgets and enhanced speed in computer architectures for battery-operated devices like Laptop and others. In this thesis, the main focus is on the area and provides high speed to the processors. Less area and high speed circuits are becoming more desirable due to growing portable device markets and they are also becoming more applicable today in processors. The main focus in this work is to improve the speed of the 32-bit processor and in this case the carry select adder is the better choice. The second concern in the design of this carry select adder is the reduction of area that is achieved by implementing the internal structure of the ripple carry adder in the branching architecture. The approach used here is to implement these pipelines in a manner that only one pipeline will be activated through which the carry is propagating. Furthermore, RTL level optimizations have also been done to ensure less area during intermediate computations. In this thesis, the entire adder architecture has been implemented using Verilog and simulated using ISE tool suite. It provides a good improvement in speed as well as reduces the area requirement to a greater extent.
Key Words:-CSLA,RCA,BCD,32 Bit CSLA
Area:-Engineering
Download Paper: 
Preview This Article

Unable to display PDF file. Download instead.


Download Paper

Downlaod Paper

No. of Download

000154

Impact Factor

7.4


ijaece

Upcoming Events


Special Issue For Paper


Upcoming Conference


Call For Paper