Digital Root circuit using tree of 4-bit CLA's with Cout fed into Cin

Do you have a question? Post it now! No Registration Necessary

Translate This Thread From English to

Threaded View
lrl Contact options for registered users 's Avatar (by Gravatar) posted on
July 16, 2003, 5:57 pm
rate this thread
Reply to this post Reply Tag this thread to save it in your account Save Printer-friendly version of this post Print
Hi,

In order to generate  hexadecimal Digital Root  of a number (i.e,
sum-of-hexdigits until it reduces to a single hex number - a nibble)

    For  e.g 0x123a = 0x1 + 0x2 +0x3 +0xa = 0x10 = 0x1 + 0x0 = 1 is the
hex digital root of (0x123a)

I am planning to use tree of 4-bit Carry-Look-Ahead adders with the
Cout fed into Cin of the same CLA.

Question: Can I directly fed back the Cout signal to Cin at each CLA
to get the Digital Root .  Will it not form a combinational loop? Due
to feedback will it affect the next level CLA's o/p.

Thanks
lrl

Other Related Threads
Glen Herrmannsfeldt Contact options for registered users 's Avatar (by Gravatar) posted on
July 17, 2003, 1:04 am
Permalink
Reply to this post Reply Tag this thread to save it in your account Save Printer-friendly version of this post Print
Re: Digital Root circuit using tree of 4-bit CLA's with Cout fed into Cin

Quoted text here. Click to load it

I believe that can be done.  Consider how a ones complement adder works.

Well, I would think that you would need G and P in, but other than that it
should be fine.

I thought about this some time ago wondering why anyone would build ones
complement machines, such as CDC did.  If they couldn't do a fast add that
would be a big disadvantage.   I then decided that CLA should work.

Now, it might be that there is a better way to do the problem you are asking
about, but that is a different question.

-- glen



Other Related Threads
Glen Herrmannsfeldt Contact options for registered users 's Avatar (by Gravatar) posted on
July 17, 2003, 1:04 am
Permalink
Reply to this post Reply Tag this thread to save it in your account Save Printer-friendly version of this post Print
Re: Digital Root circuit using tree of 4-bit CLA's with Cout fed into Cin

Quoted text here. Click to load it

I believe that can be done.  Consider how a ones complement adder works.

Well, I would think that you would need G and P in, but other than that it
should be fine.

I thought about this some time ago wondering why anyone would build ones
complement machines, such as CDC did.  If they couldn't do a fast add that
would be a big disadvantage.   I then decided that CLA should work.

Now, it might be that there is a better way to do the problem you are asking
about, but that is a different question.

-- glen



Glen Herrmannsfeldt Contact options for registered users 's Avatar (by Gravatar) posted on
July 17, 2003, 4:40 am
Permalink
Reply to this post Reply Tag this thread to save it in your account Save Printer-friendly version of this post Print
Re: Digital Root circuit using tree of 4-bit CLA's with Cout fed into Cin

Quoted text here. Click to load it

I believe that can be done.  Consider how a ones complement adder works.

Well, I would think that you would need G and P in, but other than that it
should be fine.

I thought about this some time ago wondering why anyone would build ones
complement machines, such as CDC did.  If they couldn't do a fast add that
would be a big disadvantage.   I then decided that CLA should work.

Now, it might be that there is a better way to do the problem you are asking
about, but that is a different question.

-- glen



Site Timeline