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

Binary input processing in a computer using a stack

Assignee: Ford Motor Co
•
Filing: 1979-06-13
•
Granted: 1981-03-31
•
Expires: 1999-06-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A digital computer having a real time counter and a memory/address bus uses binary input data comprising a plurality of bits of information to generate output information in response to a program. The invention provides improved processing of the binary input data. A transition from one state to another of one or more of the bits of binary input data causes a byte of binary input data containing the bit or bits having undergone transition to be placed in an input holding register. Also, the real time at which the transition occurred is placed in a capture-time holding register. The contents of the input holding and capture-time holding registers are repetitively placed in a stack as pending input data bytes. The pending input data bytes are accessible to the computer central processing unit, as required by the program, via the memory/address bus.

Inventors

  • 👤 Brian S. Edelman
  • 👤 Ralph L. Robinson, Jr.

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 01:44
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/76; G06F7/78; F; F02; F02D; F02D41/00; F02D41/24; F02D41/26; F02D41/28; G06F13/00; G06F13/14; G06F13/20; G06F7/22; F02D2250/00; F02D2250/12

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 257 words
In a digital computer that has a real time counter and a memory/address bus and that uses binary input data comprising a plurality of bits of information to generate output information in response to a program operating on the binary input data, improved processing of the binary input data comprising the steps of: (a) upon a transition from one state to another of any of the bits of binary input data, storing in an input holding register a byte of binary input data containing the bit which has undergone transition; (b) storing in a capture-time holding register a byte indicative of the count of the real time counter as of the time of the transition; (c) transferring contents of the input holding register to a stack as a pending input data byte and transferring contents of the capture-time holding register to the stack as an input time byte indicative of a real time at which an input data transition occurred; and (d) repeating the above sequence of steps upon a subsequent transition from one state to another of any of the bits of binary input data without, as a result of such repetition of steps, preventing the pending input data byte placed in the stack prior to the subsequent transition from being utilized by the digital computer with the aid of the memory/address bus; whereby, the digital computer may operate on one or more pending input data bytes, and the individual bits therein, without loss of changed binary input data and without disregard of simultaneous data transitions.
Claim 2
Dependent Claim 257 words
In a digital computer that has a real time counter and a memory/address bus and that uses binary input data comprising a plurality of bits of information to generate output information in response to a program operating on the binary input data, improved processing of the binary input data comprising the steps of: (a) upon a transition from one state to another of any of the bits of binary input data, storing in an input holding register a byte of binary input data containing the bit which has undergone transition; (b) storing in a capture-time holding register a byte indicative of the count of the real time counter as of the time of the transition; (c) transferring contents of the input holding register to a stack as a pending input data byte and transferring contents of the capture-time holding register to the stack as an input time byte indicative of a real time at which an input data transition occurred; and (d) repeating the above sequence of steps upon a subsequent transition from one state to another of any of the bits of binary input data without, as a result of such repetition of steps, preventing the pending input data byte placed in the stack prior to the subsequent transition from being utilized by the digital computer with the aid of the memory/address bus; whereby, the digital computer may operate on one or more pending input data bytes, and the individual bits therein, without loss of changed binary input data and without disregard of simultaneous data transitions.
Claim 3
Dependent Claim 56 words
Improved processing of digital computer binary input data as in claim 1, including the step of: for transitions of a predetermined bit or combination of bits of binary input data, making such bit or bits accessible to the memory/address bus without such bit or bits prior to such accessibility being required to pass through the stack.
Claim 4
Dependent Claim 52 words
Improved processing of digital computer binary input data as in claim 1, including the step of: allowing transitions of a predetermined bit or combination of bits of binary input data to cause an input data interrupt such that the changed input data is immediately accessible to the memory/address bus when addressed thereby.
Claim 5
Dependent Claim 34 words
Improved processing of digital computer binary input data as in claim 3, including the step of: where there is the input data interrupt, preventing the changed input data from being transferred to the stack.
Claim 6
Dependent Claim 27 words
Improved processing of digital computer binary input data as in claim 1, including the step of: storing a plurality of pending input data bytes in the stack.
Claim 7
Dependent Claim 55 words
Improved processing of digital computer binary input data as in claim 5, including the step of: making the pending input data bytes in the stack accessible to the memory/address bus on the basis of the first input data byte placed in the stack being the first input data byte used or removed from the stack.
Claim 8
Dependent Claim 38 words
Improved processing of digital computer binary input data as in claim 5, including the step of: making the pending input data bytes retained in the stack accessible to the memory/address bus at a predetermined location in the stack.
Claim 9
Dependent Claim 31 words
Improved processing of digital computer binary input data as in claim 7, including the step of: making the pending input data bytes reach the predetermined stack location on a time-ordered basis.
Claim 10
Dependent Claim 38 words
Improved processing of digital computer binary input data as in claim 8, including the step of: making the pending input data bytes reach the predetermined stack location in chronological order of times at which input data transitions occurred.
Claim 11
Dependent Claim 61 words
Improved processing of digital computer binary input data as in claims 5, 6, 7, 8 or 9, including the step of: for transitions of a predetermined bit of combination of bits of binary input data, making such bit or bits accessible to the memory/address bus without such bit or bits prior to such accessibility being required to pass through the stack.
Claim 12
Dependent Claim 57 words
Improved processing of digital computer binary input data as in claims 5, 6, 7, 8 or 9, including the step of: allowing transitions of a predetermined bit or combination of bits of binary input data to cause an input data interrupt such that the changed input data is immediately accessible to the memory/address bus when addressed thereby.
Claim 13
Dependent Claim 66 words
Improved processing of digital computer binary input data as in claims 5, 6, 7, 8 or 9, including the steps of: allowing transitions of a predetermined bit or combination of bits of binary input data to cause an input data interrupt such that the changed input data is immediately accessible to the memory/address bus; and preventing the changed input data from being transferred to the stack.

References Cited (Backward Citations)

US3411142A Cited
US3815096A Cited
US3794981A Cited
US4003031A Cited
US3952289A Cited
US4024508A Cited
US4062059A Cited
US4125870A Cited
US3990559A Cited
US4034349A Cited
US4048625A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1984-03-30 1984-09-29 1985-03-31 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1988-03-30 1988-09-29 1989-03-31 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1992-03-30 1992-09-29 1993-03-31 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag