Patent US4918636A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4918636A Expired / Lapsed US ⏱️ 0.0 years remaining

Circuit for comparing a plurality of binary inputs

Assignee: NEC Corp
•
Filing: 1988-12-23
•
Granted: 1990-04-17
•
Expires: 2008-12-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A circuit for comparing a plurality of binary numbers according to this invention includes a circuit for receiving M (M≧3) binary numbers, and circuitry for generating and outputting a signal representing which of the binary number is maximum or minimum.

Inventors

  • 👤 Jun Iwata
  • 👤 Takeshi Nishikawa
  • 👤 Toshihiko Nakamura

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 14:00
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30021; G06F7/00; G06F7/02; G06F7/026; G06F7/38; G06F7/48; G06F7/544

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 114 words
A comparator for receiving M numbers, where M is greater than or equal to three and for generating a signal indicating which of said M numbers are minimum, said comparator comprising: a plurality of two-input comparators each receiving two of said M numbers A 1 , A 2 , . . . , A M , and generating and outputting a signal representing a relation between different numbers A i and A j , where i≠j; and a judging circuit receiving outputs from all of said two-input comparators, and generating and outputting a signal representing which of said M numbers A 1 , A 2 , . . . , A M is minimum.
Claim 2
Dependent Claim 114 words
A comparator for receiving M numbers, where M is greater than or equal to three and for generating a signal indicating which of said M numbers are minimum, said comparator comprising: a plurality of two-input comparators each receiving two of said M numbers A 1 , A 2 , . . . , A M , and generating and outputting a signal representing a relation between different numbers A i and A j , where i≠j; and a judging circuit receiving outputs from all of said two-input comparators, and generating and outputting a signal representing which of said M numbers A 1 , A 2 , . . . , A M is minimum.
Claim 3
Dependent Claim 332 words
A comparator for receiving numbers A, B, and C and for generating a signal indicating which of A, B, and C are minimum, said comparator comprising: a first two-input comparator generating and outputting signals P 0 and Q 0 representing a relation between numbers A and B such that (P o , Q 0 )=(1, 0) if A>B, (P 0 , Q 0 )=(0, 1) if A<B, and (P 0 , Q 0 )=(1, 1) if A=B; a second two-input comparator generating and outputting signals P 1 and Q 1 representing a relation between numbers B and C such that (P 1 , Q 1 )=(1, 0) if B>C, (P 1 , Q 1 )=(0, 1) if B<C, and (P 1 , Q 1 )=(1, 1) if B=C; a third two-input comparator generating and outputting signals P 2 and Q 2 representing a relation between numbers C and A such that (P 2 , Q 2 )=(1, 0) if C>A, (P 2 , Q 2 )=(0, 1) if C<A, and (P 2 , Q 2 )=(1, 1) if C=A; and a judging circuit receiving signals P 0 and Q 0 ; P 1 and Q 1 and P 2 and Q 2 , and generating and outputting signals NA, NB, and NC representing which of numbers A, B and C are minimum such that if C is minimum (C<A, B), then (NA, NB, NC)=(0, 0, 1), if B is minimum (B<A, C), then (NA, NB, NC)=(0, 1, 0), if B and C are minimum (B=C<A), then (NA, NB, NC)=(0, 1, 1), if A is minimum (A<B, C), then (NA, NB, NC)=(1, 0, 0), if A and C are minimum (A=C<B), then (NA, NB, NC)=(1, 0, 1), if A and B are minimum (A=B<C), then (NA, NB, NC)=(1, 1, 0), and if A, B and C are equal (A=B=C), then (NA, NB, NC)=(1, 1, 1) in accordance with logic equations: NA=P 2 ·Q 0 NB=P 0 ·Q 1 NC=P 1 ·Q 2 .
Claim 4
Dependent Claim 332 words
A comparator for receiving numbers A, B, and C and for generating a signal indicating which of A, B, and C are minimum, said comparator comprising: a first two-input comparator generating and outputting signals P 0 and Q 0 representing a relation between numbers A and B such that (P o , Q 0 )=(1, 0) if A>B, (P 0 , Q 0 )=(0, 1) if A<B, and (P 0 , Q 0 )=(1, 1) if A=B; a second two-input comparator generating and outputting signals P 1 and Q 1 representing a relation between numbers B and C such that (P 1 , Q 1 )=(1, 0) if B>C, (P 1 , Q 1 )=(0, 1) if B<C, and (P 1 , Q 1 )=(1, 1) if B=C; a third two-input comparator generating and outputting signals P 2 and Q 2 representing a relation between numbers C and A such that (P 2 , Q 2 )=(1, 0) if C>A, (P 2 , Q 2 )=(0, 1) if C<A, and (P 2 , Q 2 )=(1, 1) if C=A; and a judging circuit receiving signals P 0 and Q 0 ; P 1 and Q 1 and P 2 and Q 2 , and generating and outputting signals NA, NB, and NC representing which of numbers A, B and C are minimum such that if C is minimum (C<A, B), then (NA, NB, NC)=(0, 0, 1), if B is minimum (B<A, C), then (NA, NB, NC)=(0, 1, 0), if B and C are minimum (B=C<A), then (NA, NB, NC)=(0, 1, 1), if A is minimum (A<B, C), then (NA, NB, NC)=(1, 0, 0), if A and C are minimum (A=C<B), then (NA, NB, NC)=(1, 0, 1), if A and B are minimum (A=B<C), then (NA, NB, NC)=(1, 1, 0), and if A, B and C are equal (A=B=C), then (NA, NB, NC)=(1, 1, 1) in accordance with logic equations: NA=P 2 ·Q 0 NB=P 0 ·Q 1 NC=P 1 ·Q 2 .
Claim 5
Dependent Claim 189 words
A comparator for receiving M numbers, where M is greater than or equal to three and for generating a signal indicating which of said M numbers are minimum, said comparator comprising: M input registers holding M numbers A 1 , A 2 , . . . , A M ; selectors sequentially selecting outputs A i and A j , where i≠j, from two different input registers in accordance with a selection signal; a two-input comparator receiving numbers A i and A j selected by said selectors, and generating and outputting a comparison result signal representing a relation between numbers A i and A j ; result registers each receiving a comparison result signal from said two-input comparator together with a set signal and holding said comparison result signal until a next set signal is supplied to said result registers; a control circuit generating and outputting said selection signal and said set signal; and a judging circuit receiving outputs from said result registers, and generating and outputting a signal indicating which of said M numbers A 1 , A 2 , . . . , A M is minimum.
Claim 6
Dependent Claim 189 words
A comparator for receiving M numbers, where M is greater than or equal to three and for generating a signal indicating which of said M numbers are minimum, said comparator comprising: M input registers holding M numbers A 1 , A 2 , . . . , A M ; selectors sequentially selecting outputs A i and A j , where i≠j, from two different input registers in accordance with a selection signal; a two-input comparator receiving numbers A i and A j selected by said selectors, and generating and outputting a comparison result signal representing a relation between numbers A i and A j ; result registers each receiving a comparison result signal from said two-input comparator together with a set signal and holding said comparison result signal until a next set signal is supplied to said result registers; a control circuit generating and outputting said selection signal and said set signal; and a judging circuit receiving outputs from said result registers, and generating and outputting a signal indicating which of said M numbers A 1 , A 2 , . . . , A M is minimum.
Claim 7
Dependent Claim 114 words
A comparator for receiving M numbers, where M is greater than or equal to three, and for generating a signal indicating which of said M numbers are maximum, said comparator comprising: a plurality of two-input comparators each receiving two of said M numbers A 1 , A 2 , . . . , A M , and generating and outputting a signal representing a relation between different numbers A i and A j , where i≠j; and a judging circuit receiving outputs from all of said two-input comparators, and generating and outputting a signal representing which of said M numbers A 1 , A 2 , . . . , A M is maximum.
Claim 8
Dependent Claim 114 words
A comparator for receiving M numbers, where M is greater than or equal to three, and for generating a signal indicating which of said M numbers are maximum, said comparator comprising: a plurality of two-input comparators each receiving two of said M numbers A 1 , A 2 , . . . , A M , and generating and outputting a signal representing a relation between different numbers A i and A j , where i≠j; and a judging circuit receiving outputs from all of said two-input comparators, and generating and outputting a signal representing which of said M numbers A 1 , A 2 , . . . , A M is maximum.
Claim 9
Dependent Claim 331 words
A comparator for receiving numbers A, B, and C and for generating a signal indicating which of A, B, and C are maximum, said comparator comprising: a first two-input comparator generating and outputting signals P 0 and Q 0 representing a relation between numbers A and B such that (P 0 , Q 0 )=(1, 0) if A>B, (P 0 , Q 0 )=(0, 1) if A<B, and (P 0 , Q 0 )=(1, 1) if A=B; a second two-input comparator generating and outputting signals P 1 and Q 1 representing a relation between numbers B and C such that (P 1 , Q 1 )=(1, 0) if B>C, (P 1 , Q 1 )=(0, 1) if B<C, and (P 1 , Q 1 )=(1, 1) if B=C; a third two-input comparator generating and outputting signals P 2 and Q 2 representing a relation between numbers C and A such that (P 2 , Q 2 )=(1, 0) if C>A, (P 2 , Q 2 )=(0, 1) if C<A, and (P 2 , Q 2 )=(1, 1) if C=A; and a judging circuit receiving signals P 0 and Q 0 ; P 1 and Q 1 and P 2 and Q 2 and generating and outputting signals XA, XB, and XC representing which of numbers A, B and C are maximum such that if C is maximum (A, B<C), then (XA, XB, XC)=(0, 0, 1), if B is maximum (A, C<B), then (XA, XB, XC)=(0, 1, 0), if B and C are maximum (A<B=C), then (XA, XB, XC)=(0, 1, 1), if A is maximum (B, C<A), then (XA, XB, XC)=(1, 0, 0), if A and C are maximum (B<A=C), then (XA, XB, XC)=(1, 0, 1), if A and B are maximum (C<A=B), then (XA, XB, XC)=(1, 1, 0), and if A, B and C are equal (A=B=C), then (XA, XB, XC)=(1, 1, 1) in accordance with logic equations: XA=P 0 ·Q 2 XB=P 1 ·Q 0 XC=P 2 ·Q 1 .
Claim 10
Dependent Claim 331 words
A comparator for receiving numbers A, B, and C and for generating a signal indicating which of A, B, and C are maximum, said comparator comprising: a first two-input comparator generating and outputting signals P 0 and Q 0 representing a relation between numbers A and B such that (P 0 , Q 0 )=(1, 0) if A>B, (P 0 , Q 0 )=(0, 1) if A<B, and (P 0 , Q 0 )=(1, 1) if A=B; a second two-input comparator generating and outputting signals P 1 and Q 1 representing a relation between numbers B and C such that (P 1 , Q 1 )=(1, 0) if B>C, (P 1 , Q 1 )=(0, 1) if B<C, and (P 1 , Q 1 )=(1, 1) if B=C; a third two-input comparator generating and outputting signals P 2 and Q 2 representing a relation between numbers C and A such that (P 2 , Q 2 )=(1, 0) if C>A, (P 2 , Q 2 )=(0, 1) if C<A, and (P 2 , Q 2 )=(1, 1) if C=A; and a judging circuit receiving signals P 0 and Q 0 ; P 1 and Q 1 and P 2 and Q 2 and generating and outputting signals XA, XB, and XC representing which of numbers A, B and C are maximum such that if C is maximum (A, B<C), then (XA, XB, XC)=(0, 0, 1), if B is maximum (A, C<B), then (XA, XB, XC)=(0, 1, 0), if B and C are maximum (A<B=C), then (XA, XB, XC)=(0, 1, 1), if A is maximum (B, C<A), then (XA, XB, XC)=(1, 0, 0), if A and C are maximum (B<A=C), then (XA, XB, XC)=(1, 0, 1), if A and B are maximum (C<A=B), then (XA, XB, XC)=(1, 1, 0), and if A, B and C are equal (A=B=C), then (XA, XB, XC)=(1, 1, 1) in accordance with logic equations: XA=P 0 ·Q 2 XB=P 1 ·Q 0 XC=P 2 ·Q 1 .
Claim 11
Dependent Claim 189 words
A comparator for receiving M numbers, where M is greater than or equal to three, and for generating a signal indicating which of said M numbers are maximum, said comparator comprising: M input registers holding M numbers A 1 , A 2 , . . . , A M ; selectors sequentially selecting outputs A 1 and A j , where i≠j, from two different input registers in accordance with a selection signal; a two-input comparator receiving numbers A i and A j selected by said selectors, and generating and outputting a comparison result signal representing a relation between numbers A i and A j ; result registers each receiving a comparison result signal from said two-input comparator together with a set signal and holding said comparison result signal until a next set signal is supplied to said result registers; a control circuit generating and outputting said selection signal and said set signal; and a judging circuit receiving outputs from said result registers, and generating and outputting a signal indicating which of said M numbers A 1 , A 2 , . . . , A M is maximum.
Claim 12
Dependent Claim 189 words
A comparator for receiving M numbers, where M is greater than or equal to three, and for generating a signal indicating which of said M numbers are maximum, said comparator comprising: M input registers holding M numbers A 1 , A 2 , . . . , A M ; selectors sequentially selecting outputs A 1 and A j , where i≠j, from two different input registers in accordance with a selection signal; a two-input comparator receiving numbers A i and A j selected by said selectors, and generating and outputting a comparison result signal representing a relation between numbers A i and A j ; result registers each receiving a comparison result signal from said two-input comparator together with a set signal and holding said comparison result signal until a next set signal is supplied to said result registers; a control circuit generating and outputting said selection signal and said set signal; and a judging circuit receiving outputs from said result registers, and generating and outputting a signal indicating which of said M numbers A 1 , A 2 , . . . , A M is maximum.
Claim 13
Independent Claim 133 words
A method for comparing electrical signals representing three or more numbers comprising the steps of: receiving said electrical signals in a plurality of comparators, all of said electrical signals being received in said plurality of comparators at essentially the same time; comparing subsets of said electrical signals to determine magnitude relationships between subsets of said electrical signals, all of said comparing being performed at essentially the same time, each subset corresponding to one of said three or more numbers; outputting comparison result signals indicative of said magnitude relationships to a logic circuit; and receiving said comparison result signals in said logic circuit, and generating output signals identifying one of a maximum and a minimum of said three or more numbers based on a logical combination of said comparison of said comparison result signals.
Claim 14
Independent Claim 133 words
A method for comparing electrical signals representing three or more numbers comprising the steps of: receiving said electrical signals in a plurality of comparators, all of said electrical signals being received in said plurality of comparators at essentially the same time; comparing subsets of said electrical signals to determine magnitude relationships between subsets of said electrical signals, all of said comparing being performed at essentially the same time, each subset corresponding to one of said three or more numbers; outputting comparison result signals indicative of said magnitude relationships to a logic circuit; and receiving said comparison result signals in said logic circuit, and generating output signals identifying one of a maximum and a minimum of said three or more numbers based on a logical combination of said comparison of said comparison result signals.

References Cited (Backward Citations)

US3731765A Cited
US3845465A Cited
US3825895A Cited
US3955177A Cited
US4255740A Cited
US4539549A Cited
US4695971A Cited
US4760374A Cited
US4734876A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-04-16 1993-10-16 1994-04-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-04-16 1997-10-16 1998-04-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-04-16 2001-10-16 2002-04-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag