US5059942A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Bit masking compare circuit
Assignee: Lockheed Martin Corp
•
Filing: 1990-01-03
•
Granted: 1991-10-22
•
Expires: 2010-01-03
Abstract
Abstract A masked compare circuit for comparing a first N-bit dataword to a second N-bit dataword, the circuit including a decoder for receiving an M-bit mask code and generating an output signal identifying a bit position, K, derived from the M-bit mask code, M and K being positive integers; and a comparator module responsive to the decoder output signal for comparing the N-K+1 most significant bits of the first dataword to corresponding bits of the second dataword, the comparator module generating an output signal having a first value when all of the compared bits are the same and having a second value when any of the compared bits are different.
Inventors
- 👤 James L. Burrows
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 10:43
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/76; G06F7/764; G06F7/02; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30021
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
222 words
A masked compare circuit for comparing a first N-bit dataword to a second N-bit dataword, N being a positive integer, the circuit comprising: a decoder for receiving an M-bit mask code and generating an output signal identifying a bit position, K, derived from the M-bit mask code, M and K being positive integers; and a comparator module responsive to the decoder output signal for comparing the N-K+1 most significant bits of the first dataword to corresponding most significant bits of the second data word, the comparator module generating an output signal having a first value when all of the compared bits are the same and having a second value when any of the compared bits is different, wherein the comparator module includes: an array of N comparators, each comparator of the comparator array for comparing a different bit of the first dataword to a corresponding bit of the second dataword, the comparator array generating an N-bit match signal which identifies all bit positions of the first and second datawords that match; an array of gates responsive to the decoder output signal for generating a masked match signal by setting the first K least significant bits of the match signal to indicate a match; and an N-input AND gate for receiving the masked match signal and producing the comparator module output signal therefrom.
Claim 2
Dependent Claim
222 words
A masked compare circuit for comparing a first N-bit dataword to a second N-bit dataword, N being a positive integer, the circuit comprising: a decoder for receiving an M-bit mask code and generating an output signal identifying a bit position, K, derived from the M-bit mask code, M and K being positive integers; and a comparator module responsive to the decoder output signal for comparing the N-K+1 most significant bits of the first dataword to corresponding most significant bits of the second data word, the comparator module generating an output signal having a first value when all of the compared bits are the same and having a second value when any of the compared bits is different, wherein the comparator module includes: an array of N comparators, each comparator of the comparator array for comparing a different bit of the first dataword to a corresponding bit of the second dataword, the comparator array generating an N-bit match signal which identifies all bit positions of the first and second datawords that match; an array of gates responsive to the decoder output signal for generating a masked match signal by setting the first K least significant bits of the match signal to indicate a match; and an N-input AND gate for receiving the masked match signal and producing the comparator module output signal therefrom.
Claim 3
Dependent Claim
59 words
The masked compare circuit of claim 1 wherein the decoder is a M-line to 2 M -line decoder, the M input lines for receiving the M-bit mask code and the 2 M output lines for outputting the decoder output signal and wherein the decoder activates an output line corresponding to the K bit position identified by the mask code.
Claim 4
Dependent Claim
224 words
A masked compare circuit for comparing a first N-bit dataword to a second N-bit dataword, N being a positive integer, the circuit comprising: a decoder for receiving an M-bit mask code and generating an output signal identifying a bit position, K, derived from the M-bit mask code, M and K being positive integers; and a comparator module responsive to the decoder output signal for comparing the N-K+1 most significant bits of the first dataword to corresponding bits of the second data word, the comparator module generating an output signal having a first value when all of the compared bits are the same and having a second value when any of the compared bits is different, wherein the comparator module comprises: an array of gates responsive to the decoder output signal for converting the first dataword into a 3-state representation having N elements, (c N-1 , c N-2 , . . . ,c 0 ), where each c i for K≧i≧(N-1) is derived from a corresponding bit of the first dataword and each c i for 0≧i≧(K-1) is equal to a DON'T CARE state, and a logic array comprising N 3-value logic cells, each 3-value logic cell for storing a corresponding bit of the second dataword and for receiving a corresponding element of the 3-state representation, the logic array generating the comparator module output signal.
Claim 5
Dependent Claim
224 words
A masked compare circuit for comparing a first N-bit dataword to a second N-bit dataword, N being a positive integer, the circuit comprising: a decoder for receiving an M-bit mask code and generating an output signal identifying a bit position, K, derived from the M-bit mask code, M and K being positive integers; and a comparator module responsive to the decoder output signal for comparing the N-K+1 most significant bits of the first dataword to corresponding bits of the second data word, the comparator module generating an output signal having a first value when all of the compared bits are the same and having a second value when any of the compared bits is different, wherein the comparator module comprises: an array of gates responsive to the decoder output signal for converting the first dataword into a 3-state representation having N elements, (c N-1 , c N-2 , . . . ,c 0 ), where each c i for K≧i≧(N-1) is derived from a corresponding bit of the first dataword and each c i for 0≧i≧(K-1) is equal to a DON'T CARE state, and a logic array comprising N 3-value logic cells, each 3-value logic cell for storing a corresponding bit of the second dataword and for receiving a corresponding element of the 3-state representation, the logic array generating the comparator module output signal.
Claim 6
Independent Claim
169 words
A method for comparing a first N-bit dataword to a second N-bit dataword, N being a positive integer, the method comprising: receiving an M-bit mask code, M being a positive integer; generating an output signal identifying a bit position, K, derived from the M-bit mask code, K being a positive integer; comparing the N-K+1 most significant bits of the first dataword to corresponding most significant bits of the second dataword; and generating an output signal having a first value when all of the compared bits are the same and having a second value when any of the compared bits are different, wherein the step of comparing includes identifying all bit positions of the first and second datawords that match by individually comparing each bit of the first dataword with its corresponding bit of the second dataword in a separate comparator of a comparator array and generating a masked match signal in response to the identified bit position K to indicate that the K least significant bits are the same.
Claim 7
Independent Claim
169 words
A method for comparing a first N-bit dataword to a second N-bit dataword, N being a positive integer, the method comprising: receiving an M-bit mask code, M being a positive integer; generating an output signal identifying a bit position, K, derived from the M-bit mask code, K being a positive integer; comparing the N-K+1 most significant bits of the first dataword to corresponding most significant bits of the second dataword; and generating an output signal having a first value when all of the compared bits are the same and having a second value when any of the compared bits are different, wherein the step of comparing includes identifying all bit positions of the first and second datawords that match by individually comparing each bit of the first dataword with its corresponding bit of the second dataword in a separate comparator of a comparator array and generating a masked match signal in response to the identified bit position K to indicate that the K least significant bits are the same.
References Cited (Backward Citations)
US3922538A
Cited
US4914614A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-10-21 | 1995-04-22 | 1995-10-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-10-21 | 1999-04-22 | 1999-10-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-10-21 | 2003-04-22 | 2003-10-22 | $7700.00 | Window Closed / Lapsed |