SlideShare a Scribd company logo
Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13
www.ijera.com 8|P a g e
Design and Verification of Advanced Carry Select Adder
Guru Dixit Chepuri, Murali Krishna M, J.Beatrice Seventline
Master of Technology, VLSI Design, GITAM University, Visakhapatnam.
Assistant Professor, ECE department, GITAM University, Visakhapatnam.
Associate Professor, ECE Department, GITAM University, Visakhapatnam
Abstract
Design ofareaefficient data pathlogicsystems formsthelargestareasofresearch inVLSIsystem design.Indigital
adders, thespeed of addition islimitedbythetimerequired totransmit a carrythroughtheadder.CarrySelectAdder
(CSA) isoneofthefastestadders usedinmanydata-processingprocessorstoperform fastarithmetic functions.
Fromthestructure oftheCSA,itisclear thatthereisscopeforreducing thearea and powerintheCSA. This work
usesasimpleandefficient gate-level modification todrasticallyreducetheareaandpower
oftheCSA.Basedonthismodification 16,32,64 and128-bitsquare-root CSA(SQRT CSA)
architectureshavebeendevelopedandcomparedwith theregularSQRTCSAarchitecture. Theproposed
designhasreducedarea and powerascompared withtheregular SQRTCSA.Thisworkestimates theperformanceof
theproposed designsintermsofpower,areaand isimplementedusingXilinxISE and synthesized using cadence in
90nm technology.
Keywords-CarrySelectAdder,Area, Power, SQRT.
I. INTRODUCTION
Inrapidly
growingmobileindustry,fasterunitsarenottheonly
concern butalso smaller areaand lesspowerbecome
majorconcernsfordesignofdigitalcircuits.Inmobileelec
tronics, reducing
areaandpowerconsumptionarekeyfactorsin
increasingportability andbatterylife.Eveninserversand
desktopcomputers
powerdissipationisanimportantdesign
constraint.Designof areaandpower-efficienthigh-
speeddata pathlogicsystemsare one of
themostsubstantialareasof researchinVLSIsystem
design.Indigitaladders,thespeedof additionislimitedby
thetimerequiredtopropagateacarry through the adder.
The sumfor each bit positionin an elementary adder is
generated sequentially only after the previous
bitpositionhas beensummedanda carry propagated
intothe nextposition.Amongvariousadders,theCSA is
intermediate regardingspeedandarea.
Additionistheheartof
computerarithmetic,and thearithmetic
unitisoftentheworkhorseofacomputationalcircuit.They
are
thenecessarycomponentofadatapath,e.g.inmicroproce
ssors orasignalprocessor.Therearemany
waystodesignanadder. The Ripple Carry Adder(RCA)
providesthe mostcompact designbut
takeslongercomputingtime. If thereisN-bitRCA,
thedelayislinearlyproportionaltoN.Thusforlargevalues
of
NtheRCAgiveshighestdelayofalladders.TheCarryLoo
k-
AheadAdder(CLA)givesfastresultsbutconsumeslargea
rea. IfthereisN-bitadder,CLAisfastforN
<4,butforlargevalues ofN bitsdelay
increasesmorethanotheradders.Soforhigher numberof
bits,CLAgiveshigherdelaythanotheraddersdueto
presence of large numberoffan-inandalarge numberof
logic gates.TheCarry
SelectAdder(CSA)providesacompromise
betweensmallareabutlongerdelay
RCAandalargeareawith shorter delayCLA.
In this paper the design of Modified
CarrySelect-Adder (MCSA) and Uniform carry select
adder (UCSA)architectures toreduce area
andpowerwithminimum speedpenalty is described
.TheMCSA and UCSA isdesignedby
usingsingleRCAand Binary to Excess-1
Converter(BEC) and Carry skip adder (CSKA).
II. BASICADDERBLOCK
TheadderblockusingaRipplecarry adder,
BECandMuxisexplainedinthissection. In this we
calculate andexplainthedelay &areausingthe
theoretical approachand showhowthedelayand
areaaffectthe totalimplementation.The AND,OR,
andInverter(AOI)implementationofanXORgate
isshowninFig.1.Thedelay andareaevaluation
methodology considersallgatesto bemadeupof
AND,OR,andInverter,eachhavingdelayequalto1
unitandareaequalto 1unit.Wethenaddupthe
numberofgatesinthelongestpathof alogicblock
thatcontributesto themaximumdelay.Thearea
RESEARCH ARTICLE OPEN ACCESS
Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13
www.ijera.com 9|P a g e
evaluationisdone bycountingthe totalnumberof
AOIgatesrequiredforeachlogicblock.Basedon
thisapproach, theblocksof2:1mux,HalfAdder
(HA),andFAareevaluatedandlistedinTableI.
Fig. 1:DelayandArea evaluationofanXORgate.
Fig.2:4-bBEC.
The Booleanexpressionsof the4-bit BECis
listedas(notethefunctionalsymbols~NOT,&AND,
^XOR)
X0= ~B0
X1= B0^B1
X2= B2^(B0&B1)
X3= B3^(B0&B1&B2)
Fig.3:4-bBECwith8:4mux.
Table 1: Delay and Area count of Basic Blocks of
CSA
Thebasic workistouseBinaryto Excess-
1Converter (BEC)insteadofRCAwithCin=1in
theregularCSA toachievelowerareaandpower
consumption. ThemainadvantageofthisBEClogic
comes fromthelessernumber oflogic gatesthanthen-
bit
FullAdder(FA)structure.Asstatedabovethemainidea
ofthisworkistouse BECinsteadoftheRCAwithCin=1
inordertoreducetheareaandpowerconsumptionofthe
regularCSA. Toreplacethen-bitRCA,ann+1-bitBEC
isrequired. Astructure and the function tableofa4-bit
BECareshowninFig.2.
III. BASICSTRUCTUREOF
REGULAR16-BIT CSA
A16-bitcarryselectaddercanbedeveloped
intwodifferentsizesnamely uniformblocksizeand
variableblocksize.Similarlya32,64and128-bit can
alsobe developedintwomodesof different
blocksizes.Ripple-carry addersarethesimplestand
mostcompactfulladders,buttheirperformance is
limitedbyacarrythatmustpropagatefromtheleast-
significantbittothe most-significantbit.Thevarious
16,32,64and128-bitCSAcanalsobedeveloped
byusingripplecarryadders.Thespeedofacarry-
selectaddercanbeimprovedupto 40%to 90%,by
performingthe additionsinparallel,andreducingthe
maximum carrydelay.
Fig. 4showstheRegularstructureof 16-bit
SQRTCSA.Itincludesmanyripplecarryaddersof
variablesizeswhicharedividedinto groups.Group0
contains2-bitRCAwhichcontainsonly oneripple carry
adderwhichaddstheinputbitsandtheinput carry
andresultstosum[1:0]andthecarry out.The carry
outoftheGroup0whichactsastheselection inputto
muxwhichisingroup1, selectstheresult fromthe
correspondingRCA(Cin=0)orRCA (Cin=1).Similarly
the remaininggroupswillbe selected
dependingontheCout fromtheprevious groups.
InRegularCSLA,thereisonly oneRCAto
performtheadditionoftheleastsignificantbits[1:0]. The
remainingbits(otherthanLSBs),the additionis
performedby usingtwoRCAscorrespondingtothe one
assumingacarry-inof0,theotheracarry-inof1
Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13
www.ijera.com 10|P a g e
withinagroup.Inagroup,thereare twoRCAs that
receivethesamedata inputsbutdifferentCin. The
actualCinfromthepreceding sector selects one of the
two RCAs. That is, as shown in Fig. 4, if the carry-in is
0, the sum and carry-out of the upper RCA is selected,
and if the carry-in is 1, the sum and carry-out of lower
RCA is selected.
Fig.4:Regular16-bSQRTCSA.
IV. BASIC STRUCTURE OFMODIFIED
16-BIT CSA
This architectureissimilartoregular64-bit
SQRTCSA,theonly changeisthat,wereplace
RCAwithCin=1amongthetwoavailableRCAsin
agroupwithaBEC. ThisBEChas afeaturethatit
canperformthe similaroperationasthatofthe replaced
RCA with Cin=1. Fig 6shows theModified
blockdiagramof 16-bit SQRTCSA. The
numberofbitsrequiredforBEClogicis1bit more than
theRCAbits. The modified block diagramis
alsodividedintovariousgroupsof
variablesizesofbitswith each grouphavingthe
ripplecarry adders, BEC andcorrespondingmux.The
basic BEC is shown in Fig. 3. As showninthe
Fig.5,Group0containoneRCA onlywhichis
havinginputof lowersignificantbit andcarry
inbitandproducesresultofsum [1:0]
andcarryoutwhichisactingasmuxselectionlinefor
thenextgroup, similarlytheprocedurecontinuesfor
highergroupsbuttheyincludesBEClogicinsteadofRCA
withCin=1.Basedontheconsiderationof
delayvalues,thearrivaltimeofselectioninputC1
of8:3muxisearlierthanthesumofRCA andBEC.
Forremaininggroupstheselectioninput arrivalis
laterthantheRCA andBEC.
Thus, thesum1andc1 (output from mux)
dependson mux and results computed byRCAand
BEC respectively. The sum2 depends on c1 and
mux. For theremainingpartsthearrivaltimeof
muxselection
inputisalwaysgreaterthanthearrivaltimeof data
inputsfromtheBEC’s.Thus,thedelay ofthe
remainingMUXdependsonthearrivaltimeofmux
selectioninputand themuxdelay.InthisModified CSA
architecture, the implementation
codeforFullAdderandMultiplexersof6:3,8:4,and10:5u
p to24:11weredesigned.Thedesign codefor
theBECwasdesignedby usingNOT,XORandAND
gates.Then2, 3,4,5upto11-bitripplecarryadder
wasdesigned.
V. BASIC STRUCTURE OF
UNIFORM16-BIT CSA
InthisUCSLA,carryskipadder(CSKA)is
usedforreducing delayand areacomparedwithregular
and modified CSA.Theupperadderhas theCSKA
withCin=0andtheBECcircuitisinthelower
adderinsteadofRCAwithCin=1intheUCSA.The 16
bit UCSA architecture isshowninFig.7.The CSKA
shown in Fig.5isusedtoreducethedelay
comparedwithRCA.Thegroup1has onlyone set
of4bitCSKAwithcarry-in signal.The carry-
outoftheCSKA isusedas controlsignalin
multiplexer.Thegroup2hasonesetof4bitCSKAwithCin
=0
andonesetof5bitBECinsteadof4bitCSKAwithCin=1.
Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13
www.ijera.com 11|P a g e
Fig 5: 4 bit CSKA Architecture
VI. IMPLEMENTATION RESULTS
Thedesignproposed inthispaperis
developedusingVerilog-HDL inXilinx
ISEandsynthesizedusing cadence in 90nm
technology.Foreachwordsizeoftheadder, theVerilog
code is dumped into cadence
toperformthepowersimulations. The similardesign
flowisfollowed forboththemodified and
uniformSQRTCSA.Fig 8 exhibitsthesimulation
resultsof16-bitCSA
structures and Table 2 distinguish
themin termsof Delay and Area.
Fig.6: Modified16-bSQRT CSA – TheparallelRCAisreplacedwithBEC
Fig.7: Uniform 16-bit SQRT CSA- The parallel RCA is replaced with BEC and CSKA
Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13
www.ijera.com 12|P a g e
Fig. 8: 16-bit CSA output Waveform
S.No
.
Adders Power (nw) Area
(µm2
)
1. 16–bit
Regular 32803.4 652
Modified 31585.5 562
Uniform 29871.4 528
2. 32–bit
Regular 69970.6 1356
Modified 63658.8 1156
Uniform 63108.8 1128
3. 64–bit
Regular 143885.5 2805
Modified 131386.0 2387
Uniform 125165.7 2327
4. 128–bit
Regular 311320.8 5719
Modified 276443.4 4844
Uniform 257825.0 4724
Table 2: Comparisons of Regular, Modified and
Uniform CSA
VII. CONCLUSION
The synthesis and simulation of Regular
Square Root Carry Select
Adder(SQRTCSLA),ModifiedSquareRootCarry
SelectAdder and Uniform Square Root Carry
Select Adder wasdonein
VerilogHardwareDescriptionLanguageusingXilinxIS
Etool and Synthesis is done using Cadence.Acarry-
selectadder is a particular way to implement anadder
in which a logic element thatcomputesthe
(n+1)bitsumoftwo n -bitnumbers and also replacing
Ripple Carry Adder with Carry Skip Adder.
Theapproachproposedinthisreport is
toreducetheareaandpowerofSQRT
CSLAarchitecture.Thereducednumberofgatesofthisw
orkoffersgreatadvantage
inthereductionofareaandtotalpower. But minimization
of delay was not possible using the proposed
architecture. The compared results show that the area
and power of 128-bit Uniform SQRT CSLA are
significantly reduced by 17.39% and 17.18%
respectively. Similarly, the area and power of 128-bit
Modified SQRT CSLA are significantly reduced by
15.29% and 11.20% respectively which indicates the
success of the method for power and delay. The
power-delay Product and Area-Delay Product of the
proposed design varies for 16-, 32-, 64-, 128-bit sizes
The Uniform SQRT CSLA Architecture is
therefore low power, low area, simple and efficient for
VLSI hardware implementation. It would be interesting
to design a SQRT CSLA Architecture which has reduced
delay. In futurepower utilization, area and also
delay can bereduced greatlybyusing various
adders in Carry Select Adder Architecture.
REFERENCES
[1] B.Ram KumarandHarish M
Kittur”LowPower and Area-
EfficientCarrySelectAdder”IEEETransaction
1063-8210 2011 IEEE
[2] Bedrij, O.J., (1962), “Carry-
selectadder,”IRETrans.Electron. Comput.,
pp.340–344.
[3] Ceiang, T.Y.andHsiao,
M.J.,(Oct1998),“Carry-selectadder using
singleripplecarryadder,”Electron.Lett.,vol.34
Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com
ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13
www.ijera.com 13|P a g e
,no.22,pp.2101–2103
[4] He, Y., Chang, C.H.andGu,
J.,(2005),“AnAreaefficient64-bit square
rootcarry-selectadderforlow power
application,” inProc.IEEE
Int.Symp.CircuitsSyst.vol. 4,pp. 4082–4085.
[5] RamKumar, B.,Kittur,H.M.andKannan, P.
M.,(2010),“ASIC
implementationofmodifiedfastercarry
saveadder, Eur.J.Sci.Res”vol. 42, no.1,
pp.53–58.
[6] Kim, Y.andKim, L.-S., (May2001), “64-
bitcarry-selectadderwith reduced area,
ElectronLett” vol.37, no.10, pp.614–615.
[7] E. Abu-Shama andM. Bayoumi, “A New
cell forlow poweradders,”inProc.Int.Mid-
westSymp.CircuitsandSystems, 1995,
pp.1014–1017
[8] www.xilinx.com.
[9] Verilog HDL-DigitalDesign andSynthesis,
bySamirPalnitkar

More Related Content

What's hot

Parallel k nn on gpu architecture using opencl
Parallel k nn on gpu architecture using openclParallel k nn on gpu architecture using opencl
Parallel k nn on gpu architecture using opencl
eSAT Publishing House
 
C42011318
C42011318C42011318
C42011318
IJERA Editor
 
Improved ant colony optimization for quantum cost reduction
Improved ant colony optimization for quantum cost reductionImproved ant colony optimization for quantum cost reduction
Improved ant colony optimization for quantum cost reduction
journalBEEI
 
Super Resolution with OCR Optimization
Super Resolution with OCR OptimizationSuper Resolution with OCR Optimization
Super Resolution with OCR Optimization
niveditJain
 
Analysis and implementation of modified k medoids
Analysis and implementation of modified k medoidsAnalysis and implementation of modified k medoids
Analysis and implementation of modified k medoids
eSAT Publishing House
 
IRJET- K-SVD: Dictionary Developing Algorithms for Sparse Representation ...
IRJET-  	  K-SVD: Dictionary Developing Algorithms for Sparse Representation ...IRJET-  	  K-SVD: Dictionary Developing Algorithms for Sparse Representation ...
IRJET- K-SVD: Dictionary Developing Algorithms for Sparse Representation ...
IRJET Journal
 
Memory Polynomial Based Adaptive Digital Predistorter
Memory Polynomial Based Adaptive Digital PredistorterMemory Polynomial Based Adaptive Digital Predistorter
Memory Polynomial Based Adaptive Digital Predistorter
IJERA Editor
 
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Cemal Ardil
 
Modified clahe an adaptive algorithm for contrast enhancement of aerial medi...
Modified clahe an adaptive algorithm for contrast enhancement of aerial  medi...Modified clahe an adaptive algorithm for contrast enhancement of aerial  medi...
Modified clahe an adaptive algorithm for contrast enhancement of aerial medi...
IAEME Publication
 
A Study of Efficiency Improvements Technique for K-Means Algorithm
A Study of Efficiency Improvements Technique for K-Means AlgorithmA Study of Efficiency Improvements Technique for K-Means Algorithm
A Study of Efficiency Improvements Technique for K-Means Algorithm
IRJET Journal
 
Robust Watermarking through Dual Band IWT and Chinese Remainder Theorem
Robust Watermarking through Dual Band IWT and Chinese Remainder TheoremRobust Watermarking through Dual Band IWT and Chinese Remainder Theorem
Robust Watermarking through Dual Band IWT and Chinese Remainder Theorem
journalBEEI
 
Lexically constrained decoding for sequence generation using grid beam search
Lexically constrained decoding for sequence generation using grid beam searchLexically constrained decoding for sequence generation using grid beam search
Lexically constrained decoding for sequence generation using grid beam search
Satoru Katsumata
 
Neural Style Transfer in practice
Neural Style Transfer in practiceNeural Style Transfer in practice
Neural Style Transfer in practice
MohamedAmineHACHICHA1
 
A new efficient way based on special stabilizer multiplier permutations to at...
A new efficient way based on special stabilizer multiplier permutations to at...A new efficient way based on special stabilizer multiplier permutations to at...
A new efficient way based on special stabilizer multiplier permutations to at...
IJECEIAES
 
A046010107
A046010107A046010107
A046010107
IJERA Editor
 
A computationally efficient method to find transformed residue
A computationally efficient method to find transformed residueA computationally efficient method to find transformed residue
A computationally efficient method to find transformed residue
iaemedu
 
Incremental collaborative filtering via evolutionary co clustering
Incremental collaborative filtering via evolutionary co clusteringIncremental collaborative filtering via evolutionary co clustering
Incremental collaborative filtering via evolutionary co clustering
Allen Wu
 
CFM Challenge - Course Project
CFM Challenge - Course ProjectCFM Challenge - Course Project
CFM Challenge - Course Project
KhalilBergaoui
 
Scalable and Adaptive Graph Querying with MapReduce
Scalable and Adaptive Graph Querying with MapReduceScalable and Adaptive Graph Querying with MapReduce
Scalable and Adaptive Graph Querying with MapReduce
Kyong-Ha Lee
 
IRJET- Review of Existing Methods in K-Means Clustering Algorithm
IRJET- Review of Existing Methods in K-Means Clustering AlgorithmIRJET- Review of Existing Methods in K-Means Clustering Algorithm
IRJET- Review of Existing Methods in K-Means Clustering Algorithm
IRJET Journal
 

What's hot (20)

Parallel k nn on gpu architecture using opencl
Parallel k nn on gpu architecture using openclParallel k nn on gpu architecture using opencl
Parallel k nn on gpu architecture using opencl
 
C42011318
C42011318C42011318
C42011318
 
Improved ant colony optimization for quantum cost reduction
Improved ant colony optimization for quantum cost reductionImproved ant colony optimization for quantum cost reduction
Improved ant colony optimization for quantum cost reduction
 
Super Resolution with OCR Optimization
Super Resolution with OCR OptimizationSuper Resolution with OCR Optimization
Super Resolution with OCR Optimization
 
Analysis and implementation of modified k medoids
Analysis and implementation of modified k medoidsAnalysis and implementation of modified k medoids
Analysis and implementation of modified k medoids
 
IRJET- K-SVD: Dictionary Developing Algorithms for Sparse Representation ...
IRJET-  	  K-SVD: Dictionary Developing Algorithms for Sparse Representation ...IRJET-  	  K-SVD: Dictionary Developing Algorithms for Sparse Representation ...
IRJET- K-SVD: Dictionary Developing Algorithms for Sparse Representation ...
 
Memory Polynomial Based Adaptive Digital Predistorter
Memory Polynomial Based Adaptive Digital PredistorterMemory Polynomial Based Adaptive Digital Predistorter
Memory Polynomial Based Adaptive Digital Predistorter
 
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
 
Modified clahe an adaptive algorithm for contrast enhancement of aerial medi...
Modified clahe an adaptive algorithm for contrast enhancement of aerial  medi...Modified clahe an adaptive algorithm for contrast enhancement of aerial  medi...
Modified clahe an adaptive algorithm for contrast enhancement of aerial medi...
 
A Study of Efficiency Improvements Technique for K-Means Algorithm
A Study of Efficiency Improvements Technique for K-Means AlgorithmA Study of Efficiency Improvements Technique for K-Means Algorithm
A Study of Efficiency Improvements Technique for K-Means Algorithm
 
Robust Watermarking through Dual Band IWT and Chinese Remainder Theorem
Robust Watermarking through Dual Band IWT and Chinese Remainder TheoremRobust Watermarking through Dual Band IWT and Chinese Remainder Theorem
Robust Watermarking through Dual Band IWT and Chinese Remainder Theorem
 
Lexically constrained decoding for sequence generation using grid beam search
Lexically constrained decoding for sequence generation using grid beam searchLexically constrained decoding for sequence generation using grid beam search
Lexically constrained decoding for sequence generation using grid beam search
 
Neural Style Transfer in practice
Neural Style Transfer in practiceNeural Style Transfer in practice
Neural Style Transfer in practice
 
A new efficient way based on special stabilizer multiplier permutations to at...
A new efficient way based on special stabilizer multiplier permutations to at...A new efficient way based on special stabilizer multiplier permutations to at...
A new efficient way based on special stabilizer multiplier permutations to at...
 
A046010107
A046010107A046010107
A046010107
 
A computationally efficient method to find transformed residue
A computationally efficient method to find transformed residueA computationally efficient method to find transformed residue
A computationally efficient method to find transformed residue
 
Incremental collaborative filtering via evolutionary co clustering
Incremental collaborative filtering via evolutionary co clusteringIncremental collaborative filtering via evolutionary co clustering
Incremental collaborative filtering via evolutionary co clustering
 
CFM Challenge - Course Project
CFM Challenge - Course ProjectCFM Challenge - Course Project
CFM Challenge - Course Project
 
Scalable and Adaptive Graph Querying with MapReduce
Scalable and Adaptive Graph Querying with MapReduceScalable and Adaptive Graph Querying with MapReduce
Scalable and Adaptive Graph Querying with MapReduce
 
IRJET- Review of Existing Methods in K-Means Clustering Algorithm
IRJET- Review of Existing Methods in K-Means Clustering AlgorithmIRJET- Review of Existing Methods in K-Means Clustering Algorithm
IRJET- Review of Existing Methods in K-Means Clustering Algorithm
 

Viewers also liked

Plano de energencia
Plano de energenciaPlano de energencia
Plano de energencia
Jose Manuel
 
Aj4506186190
Aj4506186190Aj4506186190
Aj4506186190
IJERA Editor
 
Izmir izced / izçev
Izmir izced / izçevIzmir izced / izçev
Izmir izced / izçev
B35 Yapı
 
A045030105
A045030105A045030105
A045030105
IJERA Editor
 
Benefit sharing information towards Local Health Practitioners
Benefit sharing information towards Local Health PractitionersBenefit sharing information towards Local Health Practitioners
Benefit sharing information towards Local Health Practitioners
Basava Sankar Rao
 
B045050812
B045050812B045050812
B045050812
IJERA Editor
 
Tomas 6177
Tomas 6177Tomas 6177
J045046772
J045046772J045046772
J045046772
IJERA Editor
 
D045031724
D045031724D045031724
D045031724
IJERA Editor
 
Sri Lank斯里蘭卡
Sri Lank斯里蘭卡Sri Lank斯里蘭卡
Sri Lank斯里蘭卡
Jaing Lai
 
Los Viajes De Luis Y Yolanda
Los Viajes De Luis Y YolandaLos Viajes De Luis Y Yolanda
Los Viajes De Luis Y Yolanda
guest9439cc
 
Independencia de chile 2
Independencia de chile 2Independencia de chile 2
Independencia de chile 2
Alejandro Peña
 
Desvendando o risco empresarial: uma abordagem da participação tributária dos...
Desvendando o risco empresarial: uma abordagem da participação tributária dos...Desvendando o risco empresarial: uma abordagem da participação tributária dos...
Desvendando o risco empresarial: uma abordagem da participação tributária dos...
berbone
 
amostra de cartao de visita
amostra de cartao de visitaamostra de cartao de visita
amostra de cartao de visita
colegiart
 
A aderência das práticas contábeis das entidades do terceiro setor às normas ...
A aderência das práticas contábeis das entidades do terceiro setor às normas ...A aderência das práticas contábeis das entidades do terceiro setor às normas ...
A aderência das práticas contábeis das entidades do terceiro setor às normas ...
berbone
 
07 Death Note
07 Death Note07 Death Note
07 Death Note
Animalog ANimes Online
 
Trabajo De Educacion Fisica
Trabajo De Educacion FisicaTrabajo De Educacion Fisica
Trabajo De Educacion Fisica
guest65c993
 
Campus Virtual
Campus VirtualCampus Virtual
Campus Virtual
las5cumbres
 
Mordidas
MordidasMordidas
Fenômenos
FenômenosFenômenos
Fenômenos
thaisssmendonca
 

Viewers also liked (20)

Plano de energencia
Plano de energenciaPlano de energencia
Plano de energencia
 
Aj4506186190
Aj4506186190Aj4506186190
Aj4506186190
 
Izmir izced / izçev
Izmir izced / izçevIzmir izced / izçev
Izmir izced / izçev
 
A045030105
A045030105A045030105
A045030105
 
Benefit sharing information towards Local Health Practitioners
Benefit sharing information towards Local Health PractitionersBenefit sharing information towards Local Health Practitioners
Benefit sharing information towards Local Health Practitioners
 
B045050812
B045050812B045050812
B045050812
 
Tomas 6177
Tomas 6177Tomas 6177
Tomas 6177
 
J045046772
J045046772J045046772
J045046772
 
D045031724
D045031724D045031724
D045031724
 
Sri Lank斯里蘭卡
Sri Lank斯里蘭卡Sri Lank斯里蘭卡
Sri Lank斯里蘭卡
 
Los Viajes De Luis Y Yolanda
Los Viajes De Luis Y YolandaLos Viajes De Luis Y Yolanda
Los Viajes De Luis Y Yolanda
 
Independencia de chile 2
Independencia de chile 2Independencia de chile 2
Independencia de chile 2
 
Desvendando o risco empresarial: uma abordagem da participação tributária dos...
Desvendando o risco empresarial: uma abordagem da participação tributária dos...Desvendando o risco empresarial: uma abordagem da participação tributária dos...
Desvendando o risco empresarial: uma abordagem da participação tributária dos...
 
amostra de cartao de visita
amostra de cartao de visitaamostra de cartao de visita
amostra de cartao de visita
 
A aderência das práticas contábeis das entidades do terceiro setor às normas ...
A aderência das práticas contábeis das entidades do terceiro setor às normas ...A aderência das práticas contábeis das entidades do terceiro setor às normas ...
A aderência das práticas contábeis das entidades do terceiro setor às normas ...
 
07 Death Note
07 Death Note07 Death Note
07 Death Note
 
Trabajo De Educacion Fisica
Trabajo De Educacion FisicaTrabajo De Educacion Fisica
Trabajo De Educacion Fisica
 
Campus Virtual
Campus VirtualCampus Virtual
Campus Virtual
 
Mordidas
MordidasMordidas
Mordidas
 
Fenômenos
FenômenosFenômenos
Fenômenos
 

Similar to B045060813

Reduced Test Pattern Generation of Multiple SIC Vectors with Input and Output...
Reduced Test Pattern Generation of Multiple SIC Vectors with Input and Output...Reduced Test Pattern Generation of Multiple SIC Vectors with Input and Output...
Reduced Test Pattern Generation of Multiple SIC Vectors with Input and Output...
IJERA Editor
 
1.area efficient carry select adder
1.area efficient carry select adder1.area efficient carry select adder
1.area efficient carry select adder
KUMARASWAMY JINNE
 
Optimization of Test Pattern Using Genetic Algorithm for Testing SRAM
Optimization of Test Pattern Using Genetic Algorithm for Testing SRAMOptimization of Test Pattern Using Genetic Algorithm for Testing SRAM
Optimization of Test Pattern Using Genetic Algorithm for Testing SRAM
IJERA Editor
 
VLSI Implementation of 32-Bit Unsigned Multiplier Using CSLA & CLAA
VLSI Implementation of 32-Bit Unsigned Multiplier Using CSLA & CLAAVLSI Implementation of 32-Bit Unsigned Multiplier Using CSLA & CLAA
VLSI Implementation of 32-Bit Unsigned Multiplier Using CSLA & CLAA
IJMTST Journal
 
Jr3417541760
Jr3417541760Jr3417541760
Jr3417541760
IJERA Editor
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
ijceronline
 
Recursive
RecursiveRecursive
Recursive
Alexander Cave
 
A high performance jacobi iterative solver
A high performance jacobi iterative solverA high performance jacobi iterative solver
A high performance jacobi iterative solver
IJARIIT
 
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
IJERA Editor
 
Design and implementation of Parallel Prefix Adders using FPGAs
Design and implementation of Parallel Prefix Adders using FPGAsDesign and implementation of Parallel Prefix Adders using FPGAs
Design and implementation of Parallel Prefix Adders using FPGAs
IOSR Journals
 
Enhanced Skewed Load and Broadside Power Reduction in Transition Fault Testing
Enhanced Skewed Load and Broadside Power Reduction in Transition Fault TestingEnhanced Skewed Load and Broadside Power Reduction in Transition Fault Testing
Enhanced Skewed Load and Broadside Power Reduction in Transition Fault Testing
IJERA Editor
 
An efficient model for design of 64-bit High Speed Parallel Prefix VLSI adder
An efficient model for design of 64-bit High Speed Parallel Prefix VLSI adderAn efficient model for design of 64-bit High Speed Parallel Prefix VLSI adder
An efficient model for design of 64-bit High Speed Parallel Prefix VLSI adder
IJMER
 
Test Scheduling of Core Based SOC Using Greedy Algorithm
Test Scheduling of Core Based SOC Using Greedy AlgorithmTest Scheduling of Core Based SOC Using Greedy Algorithm
Test Scheduling of Core Based SOC Using Greedy Algorithm
IJERA Editor
 
Parallel Processing Technique for Time Efficient Matrix Multiplication
Parallel Processing Technique for Time Efficient Matrix MultiplicationParallel Processing Technique for Time Efficient Matrix Multiplication
Parallel Processing Technique for Time Efficient Matrix Multiplication
IJERA Editor
 
20120140506024
2012014050602420120140506024
20120140506024
IAEME Publication
 
A Novel Low Complexity Histogram Algorithm for High Performance Image Process...
A Novel Low Complexity Histogram Algorithm for High Performance Image Process...A Novel Low Complexity Histogram Algorithm for High Performance Image Process...
A Novel Low Complexity Histogram Algorithm for High Performance Image Process...
IRJET Journal
 
Optimal buffer allocation in
Optimal buffer allocation inOptimal buffer allocation in
Optimal buffer allocation in
csandit
 
RTL Modeling for the Cipher Block Chaining Mode (CBE) for Data Security
RTL Modeling for the Cipher Block Chaining Mode (CBE) for Data SecurityRTL Modeling for the Cipher Block Chaining Mode (CBE) for Data Security
RTL Modeling for the Cipher Block Chaining Mode (CBE) for Data Security
IRJET Journal
 
M ESH S IMPLIFICATION V IA A V OLUME C OST M EASURE
M ESH S IMPLIFICATION V IA A V OLUME C OST M EASUREM ESH S IMPLIFICATION V IA A V OLUME C OST M EASURE
M ESH S IMPLIFICATION V IA A V OLUME C OST M EASURE
ijcga
 
Design and Implementation of Different types of Carry skip adder
Design and Implementation of Different types of Carry skip adderDesign and Implementation of Different types of Carry skip adder
Design and Implementation of Different types of Carry skip adder
IRJET Journal
 

Similar to B045060813 (20)

Reduced Test Pattern Generation of Multiple SIC Vectors with Input and Output...
Reduced Test Pattern Generation of Multiple SIC Vectors with Input and Output...Reduced Test Pattern Generation of Multiple SIC Vectors with Input and Output...
Reduced Test Pattern Generation of Multiple SIC Vectors with Input and Output...
 
1.area efficient carry select adder
1.area efficient carry select adder1.area efficient carry select adder
1.area efficient carry select adder
 
Optimization of Test Pattern Using Genetic Algorithm for Testing SRAM
Optimization of Test Pattern Using Genetic Algorithm for Testing SRAMOptimization of Test Pattern Using Genetic Algorithm for Testing SRAM
Optimization of Test Pattern Using Genetic Algorithm for Testing SRAM
 
VLSI Implementation of 32-Bit Unsigned Multiplier Using CSLA & CLAA
VLSI Implementation of 32-Bit Unsigned Multiplier Using CSLA & CLAAVLSI Implementation of 32-Bit Unsigned Multiplier Using CSLA & CLAA
VLSI Implementation of 32-Bit Unsigned Multiplier Using CSLA & CLAA
 
Jr3417541760
Jr3417541760Jr3417541760
Jr3417541760
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
 
Recursive
RecursiveRecursive
Recursive
 
A high performance jacobi iterative solver
A high performance jacobi iterative solverA high performance jacobi iterative solver
A high performance jacobi iterative solver
 
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
Implementation and Comparison of Efficient 16-Bit SQRT CSLA Using Parity Pres...
 
Design and implementation of Parallel Prefix Adders using FPGAs
Design and implementation of Parallel Prefix Adders using FPGAsDesign and implementation of Parallel Prefix Adders using FPGAs
Design and implementation of Parallel Prefix Adders using FPGAs
 
Enhanced Skewed Load and Broadside Power Reduction in Transition Fault Testing
Enhanced Skewed Load and Broadside Power Reduction in Transition Fault TestingEnhanced Skewed Load and Broadside Power Reduction in Transition Fault Testing
Enhanced Skewed Load and Broadside Power Reduction in Transition Fault Testing
 
An efficient model for design of 64-bit High Speed Parallel Prefix VLSI adder
An efficient model for design of 64-bit High Speed Parallel Prefix VLSI adderAn efficient model for design of 64-bit High Speed Parallel Prefix VLSI adder
An efficient model for design of 64-bit High Speed Parallel Prefix VLSI adder
 
Test Scheduling of Core Based SOC Using Greedy Algorithm
Test Scheduling of Core Based SOC Using Greedy AlgorithmTest Scheduling of Core Based SOC Using Greedy Algorithm
Test Scheduling of Core Based SOC Using Greedy Algorithm
 
Parallel Processing Technique for Time Efficient Matrix Multiplication
Parallel Processing Technique for Time Efficient Matrix MultiplicationParallel Processing Technique for Time Efficient Matrix Multiplication
Parallel Processing Technique for Time Efficient Matrix Multiplication
 
20120140506024
2012014050602420120140506024
20120140506024
 
A Novel Low Complexity Histogram Algorithm for High Performance Image Process...
A Novel Low Complexity Histogram Algorithm for High Performance Image Process...A Novel Low Complexity Histogram Algorithm for High Performance Image Process...
A Novel Low Complexity Histogram Algorithm for High Performance Image Process...
 
Optimal buffer allocation in
Optimal buffer allocation inOptimal buffer allocation in
Optimal buffer allocation in
 
RTL Modeling for the Cipher Block Chaining Mode (CBE) for Data Security
RTL Modeling for the Cipher Block Chaining Mode (CBE) for Data SecurityRTL Modeling for the Cipher Block Chaining Mode (CBE) for Data Security
RTL Modeling for the Cipher Block Chaining Mode (CBE) for Data Security
 
M ESH S IMPLIFICATION V IA A V OLUME C OST M EASURE
M ESH S IMPLIFICATION V IA A V OLUME C OST M EASUREM ESH S IMPLIFICATION V IA A V OLUME C OST M EASURE
M ESH S IMPLIFICATION V IA A V OLUME C OST M EASURE
 
Design and Implementation of Different types of Carry skip adder
Design and Implementation of Different types of Carry skip adderDesign and Implementation of Different types of Carry skip adder
Design and Implementation of Different types of Carry skip adder
 

Recently uploaded

20240607 QFM018 Elixir Reading List May 2024
20240607 QFM018 Elixir Reading List May 202420240607 QFM018 Elixir Reading List May 2024
20240607 QFM018 Elixir Reading List May 2024
Matthew Sinclair
 
How to use Firebase Data Connect For Flutter
How to use Firebase Data Connect For FlutterHow to use Firebase Data Connect For Flutter
How to use Firebase Data Connect For Flutter
Daiki Mogmet Ito
 
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
名前 です男
 
Removing Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software FuzzingRemoving Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software Fuzzing
Aftab Hussain
 
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
James Anderson
 
PCI PIN Basics Webinar from the Controlcase Team
PCI PIN Basics Webinar from the Controlcase TeamPCI PIN Basics Webinar from the Controlcase Team
PCI PIN Basics Webinar from the Controlcase Team
ControlCase
 
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with SlackLet's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
shyamraj55
 
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
Neo4j
 
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
sonjaschweigert1
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Albert Hoitingh
 
Uni Systems Copilot event_05062024_C.Vlachos.pdf
Uni Systems Copilot event_05062024_C.Vlachos.pdfUni Systems Copilot event_05062024_C.Vlachos.pdf
Uni Systems Copilot event_05062024_C.Vlachos.pdf
Uni Systems S.M.S.A.
 
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfObservability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Paige Cruz
 
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
SOFTTECHHUB
 
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of GermanyPresentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
innovationoecd
 
Generative AI Deep Dive: Advancing from Proof of Concept to Production
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionGenerative AI Deep Dive: Advancing from Proof of Concept to Production
Generative AI Deep Dive: Advancing from Proof of Concept to Production
Aggregage
 
“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”
Claudio Di Ciccio
 
Essentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FMEEssentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FME
Safe Software
 
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
Neo4j
 
Monitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR EventsMonitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR Events
Ana-Maria Mihalceanu
 
National Security Agency - NSA mobile device best practices
National Security Agency - NSA mobile device best practicesNational Security Agency - NSA mobile device best practices
National Security Agency - NSA mobile device best practices
Quotidiano Piemontese
 

Recently uploaded (20)

20240607 QFM018 Elixir Reading List May 2024
20240607 QFM018 Elixir Reading List May 202420240607 QFM018 Elixir Reading List May 2024
20240607 QFM018 Elixir Reading List May 2024
 
How to use Firebase Data Connect For Flutter
How to use Firebase Data Connect For FlutterHow to use Firebase Data Connect For Flutter
How to use Firebase Data Connect For Flutter
 
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
みなさんこんにちはこれ何文字まで入るの?40文字以下不可とか本当に意味わからないけどこれ限界文字数書いてないからマジでやばい文字数いけるんじゃないの?えこ...
 
Removing Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software FuzzingRemoving Uninteresting Bytes in Software Fuzzing
Removing Uninteresting Bytes in Software Fuzzing
 
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
Alt. GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using ...
 
PCI PIN Basics Webinar from the Controlcase Team
PCI PIN Basics Webinar from the Controlcase TeamPCI PIN Basics Webinar from the Controlcase Team
PCI PIN Basics Webinar from the Controlcase Team
 
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with SlackLet's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
Let's Integrate MuleSoft RPA, COMPOSER, APM with AWS IDP along with Slack
 
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
 
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
 
Uni Systems Copilot event_05062024_C.Vlachos.pdf
Uni Systems Copilot event_05062024_C.Vlachos.pdfUni Systems Copilot event_05062024_C.Vlachos.pdf
Uni Systems Copilot event_05062024_C.Vlachos.pdf
 
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfObservability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
 
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...
 
Presentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of GermanyPresentation of the OECD Artificial Intelligence Review of Germany
Presentation of the OECD Artificial Intelligence Review of Germany
 
Generative AI Deep Dive: Advancing from Proof of Concept to Production
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionGenerative AI Deep Dive: Advancing from Proof of Concept to Production
Generative AI Deep Dive: Advancing from Proof of Concept to Production
 
“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”“I’m still / I’m still / Chaining from the Block”
“I’m still / I’m still / Chaining from the Block”
 
Essentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FMEEssentials of Automations: The Art of Triggers and Actions in FME
Essentials of Automations: The Art of Triggers and Actions in FME
 
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
GraphSummit Singapore | Enhancing Changi Airport Group's Passenger Experience...
 
Monitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR EventsMonitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR Events
 
National Security Agency - NSA mobile device best practices
National Security Agency - NSA mobile device best practicesNational Security Agency - NSA mobile device best practices
National Security Agency - NSA mobile device best practices
 

B045060813

  • 1. Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13 www.ijera.com 8|P a g e Design and Verification of Advanced Carry Select Adder Guru Dixit Chepuri, Murali Krishna M, J.Beatrice Seventline Master of Technology, VLSI Design, GITAM University, Visakhapatnam. Assistant Professor, ECE department, GITAM University, Visakhapatnam. Associate Professor, ECE Department, GITAM University, Visakhapatnam Abstract Design ofareaefficient data pathlogicsystems formsthelargestareasofresearch inVLSIsystem design.Indigital adders, thespeed of addition islimitedbythetimerequired totransmit a carrythroughtheadder.CarrySelectAdder (CSA) isoneofthefastestadders usedinmanydata-processingprocessorstoperform fastarithmetic functions. Fromthestructure oftheCSA,itisclear thatthereisscopeforreducing thearea and powerintheCSA. This work usesasimpleandefficient gate-level modification todrasticallyreducetheareaandpower oftheCSA.Basedonthismodification 16,32,64 and128-bitsquare-root CSA(SQRT CSA) architectureshavebeendevelopedandcomparedwith theregularSQRTCSAarchitecture. Theproposed designhasreducedarea and powerascompared withtheregular SQRTCSA.Thisworkestimates theperformanceof theproposed designsintermsofpower,areaand isimplementedusingXilinxISE and synthesized using cadence in 90nm technology. Keywords-CarrySelectAdder,Area, Power, SQRT. I. INTRODUCTION Inrapidly growingmobileindustry,fasterunitsarenottheonly concern butalso smaller areaand lesspowerbecome majorconcernsfordesignofdigitalcircuits.Inmobileelec tronics, reducing areaandpowerconsumptionarekeyfactorsin increasingportability andbatterylife.Eveninserversand desktopcomputers powerdissipationisanimportantdesign constraint.Designof areaandpower-efficienthigh- speeddata pathlogicsystemsare one of themostsubstantialareasof researchinVLSIsystem design.Indigitaladders,thespeedof additionislimitedby thetimerequiredtopropagateacarry through the adder. The sumfor each bit positionin an elementary adder is generated sequentially only after the previous bitpositionhas beensummedanda carry propagated intothe nextposition.Amongvariousadders,theCSA is intermediate regardingspeedandarea. Additionistheheartof computerarithmetic,and thearithmetic unitisoftentheworkhorseofacomputationalcircuit.They are thenecessarycomponentofadatapath,e.g.inmicroproce ssors orasignalprocessor.Therearemany waystodesignanadder. The Ripple Carry Adder(RCA) providesthe mostcompact designbut takeslongercomputingtime. If thereisN-bitRCA, thedelayislinearlyproportionaltoN.Thusforlargevalues of NtheRCAgiveshighestdelayofalladders.TheCarryLoo k- AheadAdder(CLA)givesfastresultsbutconsumeslargea rea. IfthereisN-bitadder,CLAisfastforN <4,butforlargevalues ofN bitsdelay increasesmorethanotheradders.Soforhigher numberof bits,CLAgiveshigherdelaythanotheraddersdueto presence of large numberoffan-inandalarge numberof logic gates.TheCarry SelectAdder(CSA)providesacompromise betweensmallareabutlongerdelay RCAandalargeareawith shorter delayCLA. In this paper the design of Modified CarrySelect-Adder (MCSA) and Uniform carry select adder (UCSA)architectures toreduce area andpowerwithminimum speedpenalty is described .TheMCSA and UCSA isdesignedby usingsingleRCAand Binary to Excess-1 Converter(BEC) and Carry skip adder (CSKA). II. BASICADDERBLOCK TheadderblockusingaRipplecarry adder, BECandMuxisexplainedinthissection. In this we calculate andexplainthedelay &areausingthe theoretical approachand showhowthedelayand areaaffectthe totalimplementation.The AND,OR, andInverter(AOI)implementationofanXORgate isshowninFig.1.Thedelay andareaevaluation methodology considersallgatesto bemadeupof AND,OR,andInverter,eachhavingdelayequalto1 unitandareaequalto 1unit.Wethenaddupthe numberofgatesinthelongestpathof alogicblock thatcontributesto themaximumdelay.Thearea RESEARCH ARTICLE OPEN ACCESS
  • 2. Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13 www.ijera.com 9|P a g e evaluationisdone bycountingthe totalnumberof AOIgatesrequiredforeachlogicblock.Basedon thisapproach, theblocksof2:1mux,HalfAdder (HA),andFAareevaluatedandlistedinTableI. Fig. 1:DelayandArea evaluationofanXORgate. Fig.2:4-bBEC. The Booleanexpressionsof the4-bit BECis listedas(notethefunctionalsymbols~NOT,&AND, ^XOR) X0= ~B0 X1= B0^B1 X2= B2^(B0&B1) X3= B3^(B0&B1&B2) Fig.3:4-bBECwith8:4mux. Table 1: Delay and Area count of Basic Blocks of CSA Thebasic workistouseBinaryto Excess- 1Converter (BEC)insteadofRCAwithCin=1in theregularCSA toachievelowerareaandpower consumption. ThemainadvantageofthisBEClogic comes fromthelessernumber oflogic gatesthanthen- bit FullAdder(FA)structure.Asstatedabovethemainidea ofthisworkistouse BECinsteadoftheRCAwithCin=1 inordertoreducetheareaandpowerconsumptionofthe regularCSA. Toreplacethen-bitRCA,ann+1-bitBEC isrequired. Astructure and the function tableofa4-bit BECareshowninFig.2. III. BASICSTRUCTUREOF REGULAR16-BIT CSA A16-bitcarryselectaddercanbedeveloped intwodifferentsizesnamely uniformblocksizeand variableblocksize.Similarlya32,64and128-bit can alsobe developedintwomodesof different blocksizes.Ripple-carry addersarethesimplestand mostcompactfulladders,buttheirperformance is limitedbyacarrythatmustpropagatefromtheleast- significantbittothe most-significantbit.Thevarious 16,32,64and128-bitCSAcanalsobedeveloped byusingripplecarryadders.Thespeedofacarry- selectaddercanbeimprovedupto 40%to 90%,by performingthe additionsinparallel,andreducingthe maximum carrydelay. Fig. 4showstheRegularstructureof 16-bit SQRTCSA.Itincludesmanyripplecarryaddersof variablesizeswhicharedividedinto groups.Group0 contains2-bitRCAwhichcontainsonly oneripple carry adderwhichaddstheinputbitsandtheinput carry andresultstosum[1:0]andthecarry out.The carry outoftheGroup0whichactsastheselection inputto muxwhichisingroup1, selectstheresult fromthe correspondingRCA(Cin=0)orRCA (Cin=1).Similarly the remaininggroupswillbe selected dependingontheCout fromtheprevious groups. InRegularCSLA,thereisonly oneRCAto performtheadditionoftheleastsignificantbits[1:0]. The remainingbits(otherthanLSBs),the additionis performedby usingtwoRCAscorrespondingtothe one assumingacarry-inof0,theotheracarry-inof1
  • 3. Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13 www.ijera.com 10|P a g e withinagroup.Inagroup,thereare twoRCAs that receivethesamedata inputsbutdifferentCin. The actualCinfromthepreceding sector selects one of the two RCAs. That is, as shown in Fig. 4, if the carry-in is 0, the sum and carry-out of the upper RCA is selected, and if the carry-in is 1, the sum and carry-out of lower RCA is selected. Fig.4:Regular16-bSQRTCSA. IV. BASIC STRUCTURE OFMODIFIED 16-BIT CSA This architectureissimilartoregular64-bit SQRTCSA,theonly changeisthat,wereplace RCAwithCin=1amongthetwoavailableRCAsin agroupwithaBEC. ThisBEChas afeaturethatit canperformthe similaroperationasthatofthe replaced RCA with Cin=1. Fig 6shows theModified blockdiagramof 16-bit SQRTCSA. The numberofbitsrequiredforBEClogicis1bit more than theRCAbits. The modified block diagramis alsodividedintovariousgroupsof variablesizesofbitswith each grouphavingthe ripplecarry adders, BEC andcorrespondingmux.The basic BEC is shown in Fig. 3. As showninthe Fig.5,Group0containoneRCA onlywhichis havinginputof lowersignificantbit andcarry inbitandproducesresultofsum [1:0] andcarryoutwhichisactingasmuxselectionlinefor thenextgroup, similarlytheprocedurecontinuesfor highergroupsbuttheyincludesBEClogicinsteadofRCA withCin=1.Basedontheconsiderationof delayvalues,thearrivaltimeofselectioninputC1 of8:3muxisearlierthanthesumofRCA andBEC. Forremaininggroupstheselectioninput arrivalis laterthantheRCA andBEC. Thus, thesum1andc1 (output from mux) dependson mux and results computed byRCAand BEC respectively. The sum2 depends on c1 and mux. For theremainingpartsthearrivaltimeof muxselection inputisalwaysgreaterthanthearrivaltimeof data inputsfromtheBEC’s.Thus,thedelay ofthe remainingMUXdependsonthearrivaltimeofmux selectioninputand themuxdelay.InthisModified CSA architecture, the implementation codeforFullAdderandMultiplexersof6:3,8:4,and10:5u p to24:11weredesigned.Thedesign codefor theBECwasdesignedby usingNOT,XORandAND gates.Then2, 3,4,5upto11-bitripplecarryadder wasdesigned. V. BASIC STRUCTURE OF UNIFORM16-BIT CSA InthisUCSLA,carryskipadder(CSKA)is usedforreducing delayand areacomparedwithregular and modified CSA.Theupperadderhas theCSKA withCin=0andtheBECcircuitisinthelower adderinsteadofRCAwithCin=1intheUCSA.The 16 bit UCSA architecture isshowninFig.7.The CSKA shown in Fig.5isusedtoreducethedelay comparedwithRCA.Thegroup1has onlyone set of4bitCSKAwithcarry-in signal.The carry- outoftheCSKA isusedas controlsignalin multiplexer.Thegroup2hasonesetof4bitCSKAwithCin =0 andonesetof5bitBECinsteadof4bitCSKAwithCin=1.
  • 4. Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13 www.ijera.com 11|P a g e Fig 5: 4 bit CSKA Architecture VI. IMPLEMENTATION RESULTS Thedesignproposed inthispaperis developedusingVerilog-HDL inXilinx ISEandsynthesizedusing cadence in 90nm technology.Foreachwordsizeoftheadder, theVerilog code is dumped into cadence toperformthepowersimulations. The similardesign flowisfollowed forboththemodified and uniformSQRTCSA.Fig 8 exhibitsthesimulation resultsof16-bitCSA structures and Table 2 distinguish themin termsof Delay and Area. Fig.6: Modified16-bSQRT CSA – TheparallelRCAisreplacedwithBEC Fig.7: Uniform 16-bit SQRT CSA- The parallel RCA is replaced with BEC and CSKA
  • 5. Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13 www.ijera.com 12|P a g e Fig. 8: 16-bit CSA output Waveform S.No . Adders Power (nw) Area (µm2 ) 1. 16–bit Regular 32803.4 652 Modified 31585.5 562 Uniform 29871.4 528 2. 32–bit Regular 69970.6 1356 Modified 63658.8 1156 Uniform 63108.8 1128 3. 64–bit Regular 143885.5 2805 Modified 131386.0 2387 Uniform 125165.7 2327 4. 128–bit Regular 311320.8 5719 Modified 276443.4 4844 Uniform 257825.0 4724 Table 2: Comparisons of Regular, Modified and Uniform CSA VII. CONCLUSION The synthesis and simulation of Regular Square Root Carry Select Adder(SQRTCSLA),ModifiedSquareRootCarry SelectAdder and Uniform Square Root Carry Select Adder wasdonein VerilogHardwareDescriptionLanguageusingXilinxIS Etool and Synthesis is done using Cadence.Acarry- selectadder is a particular way to implement anadder in which a logic element thatcomputesthe (n+1)bitsumoftwo n -bitnumbers and also replacing Ripple Carry Adder with Carry Skip Adder. Theapproachproposedinthisreport is toreducetheareaandpowerofSQRT CSLAarchitecture.Thereducednumberofgatesofthisw orkoffersgreatadvantage inthereductionofareaandtotalpower. But minimization of delay was not possible using the proposed architecture. The compared results show that the area and power of 128-bit Uniform SQRT CSLA are significantly reduced by 17.39% and 17.18% respectively. Similarly, the area and power of 128-bit Modified SQRT CSLA are significantly reduced by 15.29% and 11.20% respectively which indicates the success of the method for power and delay. The power-delay Product and Area-Delay Product of the proposed design varies for 16-, 32-, 64-, 128-bit sizes The Uniform SQRT CSLA Architecture is therefore low power, low area, simple and efficient for VLSI hardware implementation. It would be interesting to design a SQRT CSLA Architecture which has reduced delay. In futurepower utilization, area and also delay can bereduced greatlybyusing various adders in Carry Select Adder Architecture. REFERENCES [1] B.Ram KumarandHarish M Kittur”LowPower and Area- EfficientCarrySelectAdder”IEEETransaction 1063-8210 2011 IEEE [2] Bedrij, O.J., (1962), “Carry- selectadder,”IRETrans.Electron. Comput., pp.340–344. [3] Ceiang, T.Y.andHsiao, M.J.,(Oct1998),“Carry-selectadder using singleripplecarryadder,”Electron.Lett.,vol.34
  • 6. Guru Dixit Chepuri et al Int. Journal of Engineering Research and Applications www.ijera.com ISSN : 2248-9622, Vol. 4, Issue 5( Version 6), May 2014, pp.08-13 www.ijera.com 13|P a g e ,no.22,pp.2101–2103 [4] He, Y., Chang, C.H.andGu, J.,(2005),“AnAreaefficient64-bit square rootcarry-selectadderforlow power application,” inProc.IEEE Int.Symp.CircuitsSyst.vol. 4,pp. 4082–4085. [5] RamKumar, B.,Kittur,H.M.andKannan, P. M.,(2010),“ASIC implementationofmodifiedfastercarry saveadder, Eur.J.Sci.Res”vol. 42, no.1, pp.53–58. [6] Kim, Y.andKim, L.-S., (May2001), “64- bitcarry-selectadderwith reduced area, ElectronLett” vol.37, no.10, pp.614–615. [7] E. Abu-Shama andM. Bayoumi, “A New cell forlow poweradders,”inProc.Int.Mid- westSymp.CircuitsandSystems, 1995, pp.1014–1017 [8] www.xilinx.com. [9] Verilog HDL-DigitalDesign andSynthesis, bySamirPalnitkar