Dennis M. O'Connor
Guest
|
 Posted:
Sun Jul 31, 2005 10:59 pm Post subject:
Re: computer architecture |
|
|
ravindra kalla wrote:
| Quote: | how to make a fast spead comparator architectture?
hi i m designing an architecture for that a comparator is
require.This for to compare 9 integer no.plz told me how can i make
fast speed comparator
|
Well, it is a generally accepted axiom in computer architecture
that you can make any operation (especially FP, but including
integer) as fast as you like once you stop worrying about
getting the answer right all the time.
Consider: for most operations, "0" is sometimes the right
answer. And "0" can be generated arbitrarily quickly.
So can "1", for those operations that never produce "0".
So, that's one end of the speed-vs-accuracy continuum.
The other end is really-slow-but-much-more accurate.
You need to decide where on that continuum you want to be.
That's one consideration.
Another consideration is probability. I think this consideration
applies more to your problem. Usually, two integer numbers
will not match. So you could design a circuit that immediately
signals a non-match (assuming you are doing just equality check
and not less-or-greater checks), do the actual compare at a more
leisurely pace, and then put in fix-up logic to handle the cases
where you guessed incorrectly.
This may sound bizarre and impractical, but it is in fact
the basis of many branch prediction designs.
But, you haven't provided enough information about the assignment
to determine whether this really fast way of doing it would
actually be a good idea for what you are doing. For example,
what is the underlying implementation technology ? You are not
likely to develop a good answer if you do not understand the question.
--
Dennis M. O'Connor |
|
FAQ
Memberlist
Register
Profile
Log in to check your private messages
Log in
