Patent US4864572A successfully refreshed from Google Patents.
US4864572A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Framing bitstreams
Assignee: Filetek Inc
•
Filing: 1987-05-26
•
Granted: 1989-09-05
•
Expires: 2007-05-26
Abstract
Abstract A method for formatting data is disclosed in which a bitstream containing a very large number of bits is divided into a number of frames all of which are the same size except for a last frame which can have a smaller size than the other frames. Each frame has a frame header and a data portion and the data portion can include a number of records which each contain a record header and data portion. A frame directory specifies certain parameters for all frames of a bitstream.
Inventors
- 👤 James B. Rechen
- 👤 James D. Ewing
- 👤 John G. Burgess
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 23:18
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/12
Claims Analysis
Total Claims: 45
Claim 1
Independent Claim
117 words
A method of formatting a bitstream composed of a very large number of bits, the method comprising the steps of: grouping said bits from said bitstream into a plurality of sequentially organized frames of data, all of said frames having the same capacity, except a last one of said frames being capable of having a smaller capacity; placing a frame header into each of said frames. placing into said frame header ID information uniquely identifying the frame containing that frame header; and providing the capability for error detection for the data in each frame independently of the data in any other frames, thereby permitting salvage of data in any frames in which errors have not been detected.
Claim 2
Independent Claim
117 words
A method of formatting a bitstream composed of a very large number of bits, the method comprising the steps of: grouping said bits from said bitstream into a plurality of sequentially organized frames of data, all of said frames having the same capacity, except a last one of said frames being capable of having a smaller capacity; placing a frame header into each of said frames. placing into said frame header ID information uniquely identifying the frame containing that frame header; and providing the capability for error detection for the data in each frame independently of the data in any other frames, thereby permitting salvage of data in any frames in which errors have not been detected.
Claim 3
Dependent Claim
71 words
The method of claim 1 wherein the step of placing ID information into said frame header includes the substeps of using as said ID information, a value indicating the relative displacement of the frame containing the frame header in the sequential order of said frames containing the bitstream, and placing in the frame header for the last frame in the sequential order of said frames a special last frame ID code.
Claim 4
Dependent Claim
34 words
The method of claim 1 wherein the step of placing a frame header in said frames includes the substep of setting said frame header in a fixed area at the beginning of the frames.
Claim 5
Dependent Claim
33 words
The method of claim 1 wherein the step of placing said frame header into said frames includes the substep of placing in said frame header a fixed format portion including said identifying information.
Claim 6
Dependent Claim
36 words
The method of claim 4 wherein the step of placing said frame header in said frames also includes the substep of packing fill data into a fill portion of at least one of said frame headers.
Claim 7
Dependent Claim
28 words
The method of claim 1 wherein the step of grouping said bits into frames includes the substep of compressing said bits to form the data for said frames.
Claim 8
Dependent Claim
40 words
The method of claim 6 wherein the step of placing a frame header in said frames also includes the substeps of placing in said frame header a compression flag identifying the presence and type of data compression in said frames.
Claim 9
Dependent Claim
62 words
The method of claim 1 wherein said bitstream is organized into discrete units of bits and wherein said step of grouping bits into frames includes the substeps of filling each of said frames with an integral number of said discrete units, and adding fill bits to said frames when said frame size does not equal an integral number of said discrete units.
Claim 10
Dependent Claim
42 words
The method of claim 1 wherein said step of providing the capability of error detection includes the substep of placing in said frames an error detection code for indicating errors in the data of the frame into which the code is placed.
Claim 11
Dependent Claim
32 words
The method of claim 9 wherein said substep of placing an error detection code into said frames includes the substep of placing said error detection code at the end of said frames.
Claim 12
Dependent Claim
39 words
The method of claim 9 wherein said substep of placing an error detection code into said frames includes the substep of using said code to detect errors in all of the data in each frame, including the frame header.
Claim 13
Dependent Claim
37 words
The method of claim 1 wherein said step of placing said frame header in said frames includes the substep of including in said frame header an indication of the size of the frame containing that frame header.
Claim 14
Dependent Claim
41 words
The method of claim 1 wherein the step of placing said frame header in said frames includes the substep of inserting into said frame header an indication of the beginning of a data portion of the frame containing that frame header.
Claim 15
Independent Claim
103 words
A method of formatting a bitstream composed of a very large number of bits, the method comprising the steps of: grouping said bits from said bitstream into a plurality of sequentially organized frames of data, all of said frames having the same capacity, except a last one of said frames being capable of having a smaller capacity; placing a frame header into each of said frames; placing into said frame header ID information uniquely identifying the frame containing that frame header; and including in a data portion of said frames at least one record containing a record header and a record data portion.
Claim 16
Independent Claim
103 words
A method of formatting a bitstream composed of a very large number of bits, the method comprising the steps of: grouping said bits from said bitstream into a plurality of sequentially organized frames of data, all of said frames having the same capacity, except a last one of said frames being capable of having a smaller capacity; placing a frame header into each of said frames; placing into said frame header ID information uniquely identifying the frame containing that frame header; and including in a data portion of said frames at least one record containing a record header and a record data portion.
Claim 17
Dependent Claim
70 words
The method of claim 14 wherein the step of placing ID information into said frame header includes the substeps of using as said ID information, a number indicating the number of the frame containing the frame header in the sequential order of said frames containing the bitstream, and placing in the frame header for the last frame in the sequential order of said frames a special last frame ID code.
Claim 18
Dependent Claim
34 words
The method of claim 14 wherein the step of placing a frame header in said frames includes the substep of setting said frame header in a fixed area at the beginning of the frames.
Claim 19
Dependent Claim
33 words
The method of claim 14 wherein the step of placing said frame header in said frames includes the substep of placing in said frame header a fixed format portion including said identifying information.
Claim 20
Dependent Claim
36 words
The method of claim 17 wherein the step of placing said frame header into said frames also includes the substep of packing fill data into a fill portion of at least one of said frame headers.
Claim 21
Dependent Claim
28 words
The method of claim 14 wherein the step of grouping said bits into frames includes the substep of compressing said bits to form the data for said frames.
Claim 22
Dependent Claim
40 words
The method of claim 19 wherein the step of placing a frame header in said frames also includes the substeps of placing in said frame header a compression flag identifying the presence and type of data compression in said frames.
Claim 23
Dependent Claim
62 words
The method of claim 14 wherein said bitstream is organized into discrete units of bits and wherein said step of grouping bits into frames includes the substeps of filling each of said frames with an integral number of said discrete units, and adding fill bits to said frames when said frame size does not equal an integral number of said discrete units.
Claim 24
Dependent Claim
44 words
The method of claim 14 including the step of providing the capability of error detection for the data in each frame independently of the data in any other frames, thereby permitting salvage of data in any frames in which errors have not been detected.
Claim 25
Dependent Claim
40 words
The method of claim 22 wherein the step of providing error detection capability includes the substep of placing in said frames, an error detection code for indicating errors in the data of the frame into which the code is placed.
Claim 26
Dependent Claim
32 words
The method of claim 23 wherein said substep of placing an error detection code into said frames includes the substep of placing said error detection code at the end of said frames.
Claim 27
Dependent Claim
39 words
The method of claim 23 wherein said substep of placing an error detection code into said frames includes the substep of using said code to detect errors in all of the data in each frame, including the frame header.
Claim 28
Dependent Claim
37 words
The method of claim 14 wherein said step of placing said frame header in said frames includes the substep of including in said frame header an indication of the size of the frame containing that frame header.
Claim 29
Dependent Claim
41 words
The method of claim 14 wherein the step of placing said frame header in said frames includes the substep of inserting into said frame header an indication of the beginning of a data portion of the frame containing that frame header.
Claim 30
Dependent Claim
36 words
The method of claim 14 wherein the step of placing said frame header in said frames includes the substep of inserting into said frame header an indication of the first and last ones of said records.
Claim 31
Dependent Claim
39 words
The method of claim 14 wherein the step of including at least one record in said frames includes the substep of placing a record ID into each of said record headers to identify the record containing that record header.
Claim 32
Dependent Claim
48 words
The method in claim 29 wherein the substep of placing said record ID into said record headers includes the substep of using as a record ID a number indicating the relative location of the record containing that record header in the one of said frames containing that record.
Claim 33
Dependent Claim
34 words
The method of claim 14 wherein the step of including at least one record in said frames includes the substep of including in each record header information about the record containing that record header.
Claim 34
Dependent Claim
46 words
The method in claim 29 wherein the bitstream was generated by a host processor, and wherein the substep of placing said record ID into said record headers includes the substep of including information indicating the length of the subunits of data used by said host processor.
Claim 35
Dependent Claim
39 words
The method in claim 29 wherein the substep of placing said record ID into said record headers includes the substep of including flag information indicating what portion of the bitstream is contained in the record containing that record header.
Claim 36
Dependent Claim
34 words
The method in claim 29 wherein the substep of placing said record ID into said record headers includes the substep of including flag information indicating the type of the record containing that record header.
Claim 37
Dependent Claim
44 words
The method in claim 29 wherein the substep of placing said record ID into said record headers includes the substep of including flag information indicating whether the record containing that record header is the last of the records in the frame containing that record.
Claim 38
Dependent Claim
31 words
The method of claim 14 wherein the step of including at least one record in said frames includes the substep of placing portions of said bitstream into said record data portions.
Claim 39
Independent Claim
71 words
A method of formatting bitstreams into a plurality of frames each containing a frame header including information about that frame, the method comprising the steps of: building a frame directory for each of said bitstreams; placing into the frame directory for each of said bitstreams an entry corresponding to the frames in that bitstream; and placing in said frame entry an ID and a location for the frame for that entry.
Claim 40
Independent Claim
71 words
A method of formatting bitstreams into a plurality of frames each containing a frame header including information about that frame, the method comprising the steps of: building a frame directory for each of said bitstreams; placing into the frame directory for each of said bitstreams an entry corresponding to the frames in that bitstream; and placing in said frame entry an ID and a location for the frame for that entry.
Claim 41
Dependent Claim
26 words
The method of claim 37 further including the steps of: formatting said bitstreams using a host processor, and forming said frame directory using said host processor.
Claim 42
Dependent Claim
27 words
The method of claim 37 further including the steps of storing said formatted bitstream on a storage device, and storing said frame directory on said storage device.
Claim 43
Dependent Claim
36 words
The method of claim 37 wherein the step of placing the entry into said frame directory includes the substep of placing into said frame directory for said entry an indication of whether framing has been performed.
Claim 44
Dependent Claim
41 words
The method of claim 37 wherein the step of placing entries into said frame directory for each frame includes the substep of placing into said frame directory for each of said entries the size of the frame corresponding to that entry.
Claim 45
Dependent Claim
50 words
The method of claim 37 wherein the step of placing entries into said frame directory for each frame includes the substep of placing into said frame directory for each of said entries an indication of whether data compression has been performed for data in the frame corresponding to that entry.
References Cited (Backward Citations)
US3676846A
Cited
US4149142A
Cited
US4422171A
Cited
US4489398A
Cited
US4541093A
Cited
US4519054A
Cited
US4541022A
Cited
US4618950A
Cited
US4637023A
Cited
US4587643A
Cited
US4562577A
Cited
US4575770A
Cited
US4583208A
Cited
US4646281A
Cited
US4622602A
Cited
JPS60256985A
Cited
US4646170A
Cited
US4730348A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-09-04 | 1993-03-06 | 1993-09-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-09-04 | 1997-03-06 | 1997-09-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-09-04 | 2001-03-06 | 2001-09-05 | $7700.00 | Window Closed / Lapsed |