Register
Dark Mode

Adder

in Digital Logic
1,297 views
0 votes
0 votes
One ripple carry adder is adding two n-bit integers. The time complexity to perform addition using this adder is (We know carry look ahead adder takes time log n. Is it similar for other adders too). Plz also share some good resource about these two adders
in Digital Logic
by
1.3k views

1 Answer

1 vote
1 vote

it is order of n in case of RCA.

by

3 Comments

by
any reference?
0
0
by
0
0
by

@srestha @ajaysoni1924 please explain why the complexity is log n for Carry Lookahead Adder

0
0
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 vote
1 vote
3 answers
1
Na462 asked in Digital Logic Nov 15, 2018
959 views
Full adder
Na462 asked in Digital Logic Nov 15, 2018
by Na462
959 views
0 votes
0 votes
2 answers
2
Na462 asked in Digital Logic Oct 1, 2018
833 views
Full adder
Na462 asked in Digital Logic Oct 1, 2018
by Na462
833 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!