Integrated circuit and process for identifying minimum or...

Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07072922

ABSTRACT:
Apparatus and process identifies a maximum or minimum value among a plurality of binary values on a plurality of a-bit wide wires in an integrated circuit module. An N-bit vector K is calculated based on n most significant bits of all a-bit binary signals, where N=2n. M N-bit vectors K—0, . . . ,K_(M−1) are calculated based on the n most significant and the m least significant bits of all a-bit binary signals, where M is at least 2m−1. A table is constructed from vectors K—0, . . . ,K(M−1) to create table vectors. A table vector is selected based on vector K, is used to derive a vector P, which in turn is used to select another table vector. The minimum or maximum binary value is identified from the two selected table vectors.

REFERENCES:
patent: 4998219 (1991-03-01), Frauenglass
patent: 5721809 (1998-02-01), Park
patent: 6931424 (2005-08-01), Joseph
Timing-Driven Logic Bi-Decomposition', Jun. 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits, vol. 22, iss.6, pp. 675-685—Author(s)—Cortadella.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Integrated circuit and process for identifying minimum or... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Integrated circuit and process for identifying minimum or..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integrated circuit and process for identifying minimum or... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3549486

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.