Patent US3237159A successfully refreshed from Google Patents.
US3237159A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High speed comparator
Assignee: Lockheed Martin Corp
•
Filing: 1961-12-07
•
Granted: 1966-02-22
•
Expires: 1981-12-07
Abstract
No abstract record available.
Inventors
- 👤 David L Emmons
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-22 21:53
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/02; G06F7/026
Claims Analysis
Total Claims: 2
Claim 1
Independent Claim
251 words
A DIGITAL COMPARATOR FOR SIMULTANEOUSLY COMPARING A BINARY INPUT NUMBER AGAINST TWO OTHER BINARY NUMBERS OF THE SAME LENGTH, SAID COMPARISON STARTING FROM THE MOST SIGNIFICANT BIT OF THE BINARY NUMBERS AND PROGRESSING TOWARD THE LEAST SIGNIFICANT BIT, COMPRISING A SEQUENTIAL SYSTEM OF NOR GATES STAGES, EACH OF SAID STAGES COMPRISING A MINIMUM OF EIGHT LOGIC ELEMENTS WHICH ARE SUBSTANTIALLY SYMMETRICALY DIVIDED BETWEEN A HIGH LIMIT CHANNEL AND A LOW LIMIT CHANNEL, EACH CHANNEL HAVING INPUT MEANS FOR EACH STAGE IN THE FORM OF A HIGH LIMIT REGISTER AND A LOW LIMIT REGISTER, SO THAT THE COMPARISON OF A DATA NUMBER WITH THE UPPER AND LOWER LIMITS IS OBSERVED BY EACH STAGE AND ESTABLISHED IN THE DECREASING ORDER OF BINARY SIGNIFICANCE, A DATA REGISTER FOR INSERTING INTO EACH STAGE THE APPROPRIATE BIT OF A DATA INPUT NUMBER SO THAT WITH LIMIT OF THE INPUT BIT OF EACH STAGE MAY BE MADE WITH LIMIT BITS OF THE SAME SIGNIFICANCE INSERTED IN THE LIMIT REGISTERS, INDICATING MEANS FOR EACH CHANNEL CONNECTED TO THE OUTPUTS OF EACH STAGE OF INDICATING WHETHER OR NOT A BINARY INPUT NUMBER IS HIGHER THAN THE UPPER LIMIT OR LOWER THAN THE LOWER LIMIT, AND ADDITIONAL INDICATING MEANS CONNECTED TO THE AFORMENTIONED INDICATING MEANS FOR INDICATING WHETHER A GIVEN BINARY INPUT NUMBER IS BETWEEN THE LIMIT NUMBERS, AND MEANS CONNECTED SO AS TO ACTIVATE APPROPRIATE INDICATING MEANS AS OF THE TIME THAT ANY STAGE ENCOUNTERS THE BIT OF A BINARY INTPUT NUMBER THAT EXCEEDS THE LIMITS OF THAT STAGE.
Claim 2
Dependent Claim
251 words
A DIGITAL COMPARATOR FOR SIMULTANEOUSLY COMPARING A BINARY INPUT NUMBER AGAINST TWO OTHER BINARY NUMBERS OF THE SAME LENGTH, SAID COMPARISON STARTING FROM THE MOST SIGNIFICANT BIT OF THE BINARY NUMBERS AND PROGRESSING TOWARD THE LEAST SIGNIFICANT BIT, COMPRISING A SEQUENTIAL SYSTEM OF NOR GATES STAGES, EACH OF SAID STAGES COMPRISING A MINIMUM OF EIGHT LOGIC ELEMENTS WHICH ARE SUBSTANTIALLY SYMMETRICALY DIVIDED BETWEEN A HIGH LIMIT CHANNEL AND A LOW LIMIT CHANNEL, EACH CHANNEL HAVING INPUT MEANS FOR EACH STAGE IN THE FORM OF A HIGH LIMIT REGISTER AND A LOW LIMIT REGISTER, SO THAT THE COMPARISON OF A DATA NUMBER WITH THE UPPER AND LOWER LIMITS IS OBSERVED BY EACH STAGE AND ESTABLISHED IN THE DECREASING ORDER OF BINARY SIGNIFICANCE, A DATA REGISTER FOR INSERTING INTO EACH STAGE THE APPROPRIATE BIT OF A DATA INPUT NUMBER SO THAT WITH LIMIT OF THE INPUT BIT OF EACH STAGE MAY BE MADE WITH LIMIT BITS OF THE SAME SIGNIFICANCE INSERTED IN THE LIMIT REGISTERS, INDICATING MEANS FOR EACH CHANNEL CONNECTED TO THE OUTPUTS OF EACH STAGE OF INDICATING WHETHER OR NOT A BINARY INPUT NUMBER IS HIGHER THAN THE UPPER LIMIT OR LOWER THAN THE LOWER LIMIT, AND ADDITIONAL INDICATING MEANS CONNECTED TO THE AFORMENTIONED INDICATING MEANS FOR INDICATING WHETHER A GIVEN BINARY INPUT NUMBER IS BETWEEN THE LIMIT NUMBERS, AND MEANS CONNECTED SO AS TO ACTIVATE APPROPRIATE INDICATING MEANS AS OF THE TIME THAT ANY STAGE ENCOUNTERS THE BIT OF A BINARY INTPUT NUMBER THAT EXCEEDS THE LIMITS OF THAT STAGE.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1969-02-21 | 1969-08-23 | 1970-02-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1973-02-21 | 1973-08-23 | 1974-02-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1977-02-21 | 1977-08-23 | 1978-02-22 | $7700.00 | Window Closed / Lapsed |