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

Partial byte receive apparatus for digital communication systems

Assignee: Bull HN Information Systems Inc
•
Filing: 1977-05-18
•
Granted: 1978-11-21
•
Expires: 1997-05-18
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An apparatus in a digital communication system having the capability for transmitting or receiving a partial byte in the final byte position of the information field. Thus, a non-byte-oriented message may be blocked into bytes of any convenient size, and the final bits, if they do not completely fill up the final byte, can still be accommodated using the partial byte capability. The size of the final byte is indicated by adding a pointer bit to the character in memory. The partial character is right justified in its byte and a one (i.e. pointer bit) is inserted immediately to the left of the character and zeros are filled to the left to complete the byte. This byte is placed in a transmit register; a partial byte is shifted to the right until a pattern of all zeros and a one remain in the register; this pattern is recognized by the hardware and indicates that the end of the partial byte has been transmitted. For received data, the process is reversed.

Inventors

  • 👤 David L. Downey
  • 👤 James A. Kennedy
  • 👤 Liston E. Neely

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 19:48
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/0078; H04L1/0083; G; G06; G06F; G06F13/00; G06F13/38; G06F13/382; G06F13/385

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 117 words
In a digital communication system for receiving information in groups of bits, each group having a predetermined number of bits, an apparatus for receiving information having a lesser number of bits than said predetermined number in each group, said apparatus comprising: (a) first means for counting the number of bits in each group of information received; (b) second means coupled to said first means for determining whether or not said number of bits received is less than said predetermined number of bits in each of said groups; and, (c) third means coupled to said second means for inserting zero bits to the group of bits having a lesser number of bits of information than said predetermined number.
Claim 2
Dependent Claim 117 words
In a digital communication system for receiving information in groups of bits, each group having a predetermined number of bits, an apparatus for receiving information having a lesser number of bits than said predetermined number in each group, said apparatus comprising: (a) first means for counting the number of bits in each group of information received; (b) second means coupled to said first means for determining whether or not said number of bits received is less than said predetermined number of bits in each of said groups; and, (c) third means coupled to said second means for inserting zero bits to the group of bits having a lesser number of bits of information than said predetermined number.
Claim 3
Dependent Claim 26 words
The apparatus as recited in claim 1 including fourth means coupled to said first and second means for counting the number of groups of information received.
Claim 4
Dependent Claim 70 words
The apparatus as recited in claim 2 wherein said groups of information are combined into message units, each message unit comprising any number of said groups of information, each message unit being immediately preceded and followed with a predetermined pattern of bits for delineating each of said message units, said apparatus further including fourth means coupled to said first, second and third means for recognizing said predetermined pattern of bits.
Claim 5
Dependent Claim 15 words
The apparatus as recited in claim 3 wherein said predetermined pattern of bits is 01111110.
Claim 6
Dependent Claim 34 words
The apparatus as recited in claim 4 wherein said digital communication system includes a random access memory and further including means for storing said groups of bits of information in said random access memory.

References Cited (Backward Citations)

US3016527A Cited
US3241135A Cited
US3591722A Cited
US3632882A Cited
US3668645A Cited
US3970796A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1981-11-20 1982-05-22 1982-11-21 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1985-11-20 1986-05-22 1986-11-21 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1989-11-20 1990-05-22 1990-11-21 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag