← Back to Patent Explorer
US5130692A Expired / Lapsed US ⏱️ 0.0 years remaining

Improved data comparator for comparing plural-bit data at higher speed

Assignee: Mitsubishi Electric Corp
•
Filing: 1991-01-22
•
Granted: 1992-07-14
•
Expires: 2011-01-22
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An improved data comparison circuit for comparing two pieces of data having 12 bits is disclosed. In the data comparison circuit, cell circuits compare two pieces of data for every corresponding 4 bits. When a match is detected in the comparison of a set of 4 bits, a signal representative of the comparison result of the lower-order bits is bypassed. That is, by bypassing a signal representative of the comparison result of the lower order bits through the cell circuit in which the match is detected, the delay of signal propagation which may occur in the cell circuit in which the match is detected can be prevented.

Inventors

  • 👤 Hideaki Ando
  • 👤 Hirohisa Machida

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 03:47
CPC Classifications
G; G11; G11C; G11C15/00; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/12; G06F12/121; G06F12/123; G06F7/00; G06F7/02; G06F12/10; G06F12/1027

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 124 words
A data comparator for comparing first data and second data each having a plurality of bits, comprising; first comparison means for comparing the lower-order bits of the first data and the lower-order bits of the second data, and second comparison means for comparing the higher-order bits of the first data and the higher-order bits of the second data, said second comparison means including match detecting means for detecting a match between the higher-order bits of the second data and the higher-order bits of said first data, and bypass means connected to the output of said first comparison means and responsive to said match detecting means for bypassing the comparison result from said first comparison means as the comparison result of said second comparison means.
Claim 2
Dependent Claim 124 words
A data comparator for comparing first data and second data each having a plurality of bits, comprising; first comparison means for comparing the lower-order bits of the first data and the lower-order bits of the second data, and second comparison means for comparing the higher-order bits of the first data and the higher-order bits of the second data, said second comparison means including match detecting means for detecting a match between the higher-order bits of the second data and the higher-order bits of said first data, and bypass means connected to the output of said first comparison means and responsive to said match detecting means for bypassing the comparison result from said first comparison means as the comparison result of said second comparison means.
Claim 3
Dependent Claim 135 words
A data comparator for comparing first data and second data each having a plurality of bits, comprising: first comparison means for comparing the lower-order bits of the first data and the lower-order bits of the second data, second comparison means for comparing the higher-order bits of the first data ad the higher-order bits of the second data, said second comparison means including storage means for storing the higher-order bits of the second data, and match detecting means for detecting a match between data bits stored in said storage means and the higher-order bits of said first data, and bypass means connected to the output of said first comparison means and responsive to said match detecting means for bypassing the comparison result from said first comparison means as the comparison result of said second comparison means.
Claim 4
Dependent Claim 135 words
A data comparator for comparing first data and second data each having a plurality of bits, comprising: first comparison means for comparing the lower-order bits of the first data and the lower-order bits of the second data, second comparison means for comparing the higher-order bits of the first data ad the higher-order bits of the second data, said second comparison means including storage means for storing the higher-order bits of the second data, and match detecting means for detecting a match between data bits stored in said storage means and the higher-order bits of said first data, and bypass means connected to the output of said first comparison means and responsive to said match detecting means for bypassing the comparison result from said first comparison means as the comparison result of said second comparison means.
Claim 5
Dependent Claim 185 words
The data comparator according to claim 2, wherein said storage means comprises a plurality of cells, each of said cells comprises an input match line inputting a lower comparison result from a lower order cell storing a lower order data bit, an output match line for outputting a higher comparison result to a higher order cell storing a higher order data bit, and first and second matching means, said first matching means of a cell including first comparing means for comparing a data portion input to said cell with a data portion stored in said cell for transmitting the lower comparison result on said output match line upon detecting a match therebetween, said second matching means including second comparing means for comparing said data portion input to said cell with said data portion stored in said cell for controlling a potential on said output match line in accordance with a result of the comparison thereby, said second matching means and said second comparing means operative for controlling the potential on said output match line responsive to detection of a difference by said first comparing means.
Claim 6
Dependent Claim 126 words
A data comparator for comparing first and second data each having a bit length of n bits, wherein each of said first and second data are divided to the first of the higher-order data portion to the k-th of the lower-order data portion each having m bits (n=m·k), said data comparator comprising: first to k-th partial comparison means each for comparing respective data portions corresponding to the first and second data, each of said first to (k-1)-th partial comparison means including match detecting means for detecting a match between the corresponding data portions of the first and second data, and bypass means responsive to said match detecting means for bypassing the comparison result output of the lower-order partial comparison means to the higher partial comparison means.
Claim 7
Dependent Claim 126 words
A data comparator for comparing first and second data each having a bit length of n bits, wherein each of said first and second data are divided to the first of the higher-order data portion to the k-th of the lower-order data portion each having m bits (n=m·k), said data comparator comprising: first to k-th partial comparison means each for comparing respective data portions corresponding to the first and second data, each of said first to (k-1)-th partial comparison means including match detecting means for detecting a match between the corresponding data portions of the first and second data, and bypass means responsive to said match detecting means for bypassing the comparison result output of the lower-order partial comparison means to the higher partial comparison means.
Claim 8
Dependent Claim 144 words
A data comparator for comparing first and second data each having a bit length of n bits, wherein each of said first and second data are divided to the higher first to the lower k-th data portions each having m bits (n=m·k), said data comparator comprising; first to k-th data storage means each for storing the data portions corresponding to the second data, first to k-th partial match detecting means each for detecting a match between a data portion each stored in said first to kth data storage means and the corresponding data portion of the first data, and first to (k-1)-th bypass means each connected between the adjacent two among said first and k-th partial match detecting means and responsive to the higher partial match detecting means for bypassing the comparison result of the lower partial match detecting means to the higher one.
Claim 9
Dependent Claim 144 words
A data comparator for comparing first and second data each having a bit length of n bits, wherein each of said first and second data are divided to the higher first to the lower k-th data portions each having m bits (n=m·k), said data comparator comprising; first to k-th data storage means each for storing the data portions corresponding to the second data, first to k-th partial match detecting means each for detecting a match between a data portion each stored in said first to kth data storage means and the corresponding data portion of the first data, and first to (k-1)-th bypass means each connected between the adjacent two among said first and k-th partial match detecting means and responsive to the higher partial match detecting means for bypassing the comparison result of the lower partial match detecting means to the higher one.
Claim 10
Dependent Claim 181 words
The data comparator according to claim 5, wherein each of said data storage means comprises an input match line inputting a lower comparison result from a lower order data storage means, an output match line for outputting a higher comparison result to a higher order data storage means, and first and second matching means, said first matching means of a data storage means including first comparing means for comparing a data portion input to said data storage means with a data portion stored in said data storage means for transmitting the lower comparison result on said output match line upon detecting a match therebetween, said second matching means including second comparing means for comparing said data portion input to said data storage means with said data portion stored in said data storage means for controlling a potential on said output match line in accordance with a result of the comparison thereby, said second matching means and said second comparing means operative for controlling the potential on said output match line responsive to detection of a difference by said first comparing means.
Claim 11
Dependent Claim 52 words
The data comparator according to claim 6, wherein said second matching means includes precharging means responsive to a timing signal for precharging said output match line, said second matching means and said precharging means operative for precharging said output match line responsive to detection of a difference by said first comparing means.
Claim 12
Dependent Claim 52 words
The data comparator according to claim 6, wherein said second matching means including precharging means responsive to a timing signal for precharging said output match line, said second matching means and said precharging means operative for precharging said output match line responsive to detection of a difference by said first comparing means.
Claim 13
Dependent Claim 169 words
In a data comparator for comparing first data and second data each having a plurality of bits, the improvement comprising: conditional means for conditionally reducing circuit delay in propagation of comparison results from lower order bits to higher order bits by bypassing propagation through circuits comparing matched first and second data, including: first comparison means for comparing the lower-order bits of the first data and the lower-order bits of the second data, and second comparison means for comparing the higher-order bits of the first data and the higher-order bits of the second data, said second comparison means including match detecting means for detecting a match between the higher-order bits of the second data and the higher-order bits of said first data, and bypass means connected to the output of said first comparison means and responsive to said match detecting means for outputting the comparison result of said second comparison means, thereby bypassing circuit delays encountered in said second comparison means conditioned upon an output of said match detecting means.
Claim 14
Dependent Claim 169 words
In a data comparator for comparing first data and second data each having a plurality of bits, the improvement comprising: conditional means for conditionally reducing circuit delay in propagation of comparison results from lower order bits to higher order bits by bypassing propagation through circuits comparing matched first and second data, including: first comparison means for comparing the lower-order bits of the first data and the lower-order bits of the second data, and second comparison means for comparing the higher-order bits of the first data and the higher-order bits of the second data, said second comparison means including match detecting means for detecting a match between the higher-order bits of the second data and the higher-order bits of said first data, and bypass means connected to the output of said first comparison means and responsive to said match detecting means for outputting the comparison result of said second comparison means, thereby bypassing circuit delays encountered in said second comparison means conditioned upon an output of said match detecting means.
Claim 15
Dependent Claim 42 words
A data comparator as recited in claim 9, wherein said match detecting means and said bypass means are included only in said second comparison means for comparing the higher-order bits and not in said first comparison means for comparing the lower-order bits.
Claim 16
Dependent Claim 35 words
A data comparator as recited in claim 10, including only a higher-order bit comparator section and a lower-order bit comparator section, wherein said matching and bypass means are provided only in the higher-order comparator section.

References Cited (Backward Citations)

US4225849A Cited
JPS62118434A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-07-14 1996-01-13 1996-07-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-07-14 2000-01-13 2000-07-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-07-14 2004-01-13 2004-07-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag