Row expansion reduction by inversion for range...

Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S154000, C711S156000, C365S049100

Reexamination Certificate

active

07814268

ABSTRACT:
A method and circuit to implement a match against range rule functionality. A first rule entry and a second rule entry are stored. The first rule entry includes at least two consecutive identical bits. The first rule entry represents a numerical range. A first field of a binary key is compared with the first rule entry to determine whether any of the bits of the first field are not identical. A logical result of the comparison between the first field and the first rule entry is inverted to generate a first comparison result. A second field of the binary key is compared with a second rule entry to generate a second comparison result. The first comparison result is then logically ANDed with the second comparison result to determine whether the binary key falls within the numerical range represented by the first rule entry and matches the second rule entry.

REFERENCES:
patent: 6633953 (2003-10-01), Stark
patent: 7366001 (2008-04-01), Hanzawa et al.
U.S. Appl. No. 11/218,366, Not Published, Maheshwari.

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

Row expansion reduction by inversion for range... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Row expansion reduction by inversion for range..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Row expansion reduction by inversion for range... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4216366

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