Patent US6167499A successfully refreshed from Google Patents.
US6167499A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory space compression technique for a sequentially accessible memory
Assignee: Future Link Systems LLC
•
Filing: 1997-05-20
•
Granted: 2000-12-26
•
Expires: 2017-05-20
Abstract
Abstract A technique for conserving digital memory space is disclosed. This technique includes sequentially transmitting a first address and a second address on a first bus coupled to a FIFO memory. The first address is stored in the memory and compared to the second address to determine a first value corresponding to a difference between the first and second addresses. This first value is written in the memory to represent the second address and has a bit size smaller than the second address. A method to decode the first value to regenerate the second address is also disclosed. These techniques may be further enhanced by only storing an address in a sequential access memory when it differs from the most recently stored address in the memory.
Inventors
- 👤 Lawrence Letham
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 15:39
CPC Classifications
G; G11; G11C; G11C8/00; G11C8/04; G11C19/00; G11C7/00; G11C7/10; G11C7/1015; G11C7/103
Claims Analysis
Total Claims: 43
Claim 1
Independent Claim
99 words
A method of conserving digital memory space, comprising: transmitting a first address a first data segment associated with the first address, and a second address on a first bus coupled to a first-in first-out memory; storing the first address and the first data segment in the first-in first-out memory; comparing the first address to the second address to determine a first value corresponding to a difference between the first and second addresses; and writing the first value in the first-in first-out memory to represent the second address, the first value having a bit size smaller than the second address.
Claim 2
Independent Claim
99 words
A method of conserving digital memory space, comprising: transmitting a first address a first data segment associated with the first address, and a second address on a first bus coupled to a first-in first-out memory; storing the first address and the first data segment in the first-in first-out memory; comparing the first address to the second address to determine a first value corresponding to a difference between the first and second addresses; and writing the first value in the first-in first-out memory to represent the second address, the first value having a bit size smaller than the second address.
Claim 3
Dependent Claim
58 words
The method of claim 1, wherein a second bus is coupled to the first-in first-out memory, and further comprising buffering a digital information stream from the first bus to the second bus through the first-in first-out memory, the stream including a number of sets of digital information, the sets each including a data segment and an associated address.
Claim 4
Dependent Claim
41 words
The method of claim 1, wherein the first-in first-out memory includes a number of multibit sequentially accessible memory locations, and the first address is stored in a greater number of the locations of the first-in first-out memory than the first value.
Claim 5
Dependent Claim
19 words
The method of claim 1, further comprising generating the second address from the first value and the first address.
Claim 6
Dependent Claim
57 words
The method of claim 1, wherein the first value includes a first number of bits designating a portion of the second address, the portion contains at least one bit corresponding to the difference between the first and second addresses, and the first value includes a second number of bits corresponding to a bit pattern of the portion.
Claim 7
Dependent Claim
43 words
The method of claim 1, wherein the second address is transmitted on the first bus after the first data segment and the first value is written in the first-in first-out memory after the first data segment is stored in the first-in first-out memory.
Claim 8
Independent Claim
151 words
A method of conserving digital memory space, comprising: transmitting a first address, a first data segment associated with the first address, a second address, and a third address to a first-in first-out memory; storing the first data segment in the first-in first-out memory; comparing the first address to the second address to determine a first value corresponding to a difference between the first and second addresses; [and] storing the first value in the first-in first-out memory to represent the second address, the first value having a bit size smaller than the second address and being stored after the first data segment; comparing the second address to the third address to determine a second value corresponding to a difference between the second and third addresses; and storing the second value in the first-in first-out memory to represent the third address, the second value having a bit size smaller than the third address.
Claim 9
Independent Claim
151 words
A method of conserving digital memory space, comprising: transmitting a first address, a first data segment associated with the first address, a second address, and a third address to a first-in first-out memory; storing the first data segment in the first-in first-out memory; comparing the first address to the second address to determine a first value corresponding to a difference between the first and second addresses; [and] storing the first value in the first-in first-out memory to represent the second address, the first value having a bit size smaller than the second address and being stored after the first data segment; comparing the second address to the third address to determine a second value corresponding to a difference between the second and third addresses; and storing the second value in the first-in first-out memory to represent the third address, the second value having a bit size smaller than the third address.
Claim 10
Dependent Claim
24 words
The method of claim 7, further comprising storing the first address in the first-in first-out memory before the first and second values are stored.
Claim 11
Dependent Claim
32 words
The method of claim 7, further comprising generating the second address from the first value and the first address and generating the third address from the second value and the second address.
Claim 12
Dependent Claim
57 words
The method of claim 7, wherein the first value includes a first number of bits designating a portion of the second address, the portion contains at least one bit corresponding to the difference between the first and second addresses, and the first value includes a second number of bits corresponding to a bit pattern of the portion.
Claim 13
Dependent Claim
132 words
The method of claim 7, further comprising: transmitting the first data segment associated with the first address to the first-in first-out memory before the second address is transmitted to the first-in first-out memory; transmitting a second data segment associated with the second address to the first-in first-out memory after the first data segment is transmitted to the first-in first-out memory; storing the second data segment in the first-in first-out memory after the first data segment is stored in the first-in first-out memory; transmitting a third data segment associated with the third address to the first-in first-out memory after the second data segment is transmitted to the first-in first-out memory; and storing the third data segment in the first-in first-out memory after the second data segment is stored in the first-in first-out memory.
Claim 14
Dependent Claim
127 words
The method of claim 11, wherein the first-in first-out memory includes a number of sequentially accessible multibit locations, and further comprising: filling the locations of the first-in first-out memory with a number of sets of digital information, the sets each including a data segment and an associated address, a first one of the sets including the first data segment and the first address, a second one of the sets including the second data segment and the second address, a third one of the sets including the third data segment and the third address; sequentially accessing the sets after said filling; and generating the associated address for each of the sets as a function of at least two values each stored in a different one of the locations.
Claim 15
Independent Claim
101 words
A method of conserving digital memory space, comprising: (a) storing a first address in a sequential access memory, the first address being paired with a first data segment; (b) storing the first data segment in the sequential access memory; (c) comparing the first address and a second address paired with a second data segment; (d) storing a value corresponding to the second address in the sequential access memory after acts (a) through (c) unless the first address and the second address are the same; and (e) storing the second data segment in the sequential access memory after acts (a) through (c).
Claim 16
Independent Claim
101 words
A method of conserving digital memory space, comprising: (a) storing a first address in a sequential access memory, the first address being paired with a first data segment; (b) storing the first data segment in the sequential access memory; (c) comparing the first address and a second address paired with a second data segment; (d) storing a value corresponding to the second address in the sequential access memory after acts (a) through (c) unless the first address and the second address are the same; and (e) storing the second data segment in the sequential access memory after acts (a) through (c).
Claim 17
Dependent Claim
19 words
The method of claim 13, wherein the value represents a difference between the first address and the second address.
Claim 18
Dependent Claim
16 words
The method of claim 13, wherein the value is a binary representation of the second address.
Claim 19
Dependent Claim
38 words
The method of claim 13, wherein the sequential access memory includes a number of sequentially accessible multibit locations and the locations each include a flag bit which designates if a value corresponding to address information is stored therein.
Claim 20
Dependent Claim
21 words
The method of claim 13, further comprising multiplexing a data bus and an address bus coupled to the sequential access memory.
Claim 21
Independent Claim
96 words
A method of decoding, comprising: reading a number of sets of digital information from a first-in first-out memory, the sets each having a data portion and a corresponding code portion, the code portion of each of the sets corresponding to an address for the data portion and being established as a function of a difference between at least two different addresses; and generating the address for the data portion from the code portion corresponding thereto for each of the sets, the address having a bit size larger than the code portion for each of the sets.
Claim 22
Independent Claim
96 words
A method of decoding, comprising: reading a number of sets of digital information from a first-in first-out memory, the sets each having a data portion and a corresponding code portion, the code portion of each of the sets corresponding to an address for the data portion and being established as a function of a difference between at least two different addresses; and generating the address for the data portion from the code portion corresponding thereto for each of the sets, the address having a bit size larger than the code portion for each of the sets.
Claim 23
Dependent Claim
53 words
The method of claim 18, further comprising accessing a group of digital information stored in the first-in first-out memory, the group including a data portion and an address portion sequentially stored in the first-in first-out memory, and the address portion occupies more memory space than the code portion for any of the sets.
Claim 24
Dependent Claim
56 words
The method of claim 18, wherein the first-in first-out memory has an input port coupled to a first bus and an output port coupled to a second bus, and further comprising buffering transmission of a digital information stream from the first bus to the second bus through the first-in first-out memory, the stream including the sets.
Claim 25
Dependent Claim
78 words
The method of claim 20, wherein the stream includes a number of groups of digital information, the groups each having a data string and an address portion, the data string for each of the groups having the same number of bits as the data portion for each of the sets, and the address portion for each of the groups having the same number of bits as the address represented by the code portion for each of the sets.
Claim 26
Dependent Claim
45 words
The method of claim 18, wherein for each of the sets the code portion has: a first number of bits designating a segment of the address corresponding to the data portion; and a second number of bits corresponding to a bit pattern for the segment.
Claim 27
Dependent Claim
27 words
The method of claim 22, wherein the segment has a bit width that varies as a function of the difference between the at least two different addresses.
Claim 28
Independent Claim
112 words
A system for storing information, comprising: a sequential access memory with a number of multibit locations; a digital device configured to sequentially transmit a number of sets of digital information, the sets each having a data string and an address corresponding to the data string; and control logic operatively coupled to said digital device and said sequential access memory, said logic being configured to generate a number of coded multibit segments each representing the address of a corresponding one of the sets, the segments each corresponding to a difference between two of the addresses consecutively received from said digital device, the segments each having fewer bits than either of the two addresses.
Claim 29
Independent Claim
112 words
A system for storing information, comprising: a sequential access memory with a number of multibit locations; a digital device configured to sequentially transmit a number of sets of digital information, the sets each having a data string and an address corresponding to the data string; and control logic operatively coupled to said digital device and said sequential access memory, said logic being configured to generate a number of coded multibit segments each representing the address of a corresponding one of the sets, the segments each corresponding to a difference between two of the addresses consecutively received from said digital device, the segments each having fewer bits than either of the two addresses.
Claim 30
Dependent Claim
21 words
The system of claim 24, wherein said logic includes a multiplexer coupled between said digital device and said sequential access memory.
Claim 31
Dependent Claim
45 words
The system of claim 24, wherein: said sequential access memory includes an input port and an output port; and said logic includes a comparator coupled between said input port and said digital device, and a latch coupled between a digital bus and said output port.
Claim 32
Dependent Claim
58 words
The system of claim 24, wherein said sequential access memory defines a plurality of sequentially accessible multibit locations, the coded segments are each sized to fit in a corresponding one of the locations, and the address represented by one of the coded segments for each of the sets has a size larger than any one of the locations.
Claim 33
Dependent Claim
68 words
The method of claim 24, wherein the coded segments each have a first number of bits designating a portion of the address represented thereby, the portion contains at least one bit corresponding to the difference between the two addresses, and the coded segments each include a second number of bits corresponding to a bit pattern of the portion of the address designated by the first number of bits.
Claim 34
Dependent Claim
30 words
The system of claim 24, wherein said logic generates a first signal when said sequential access memory is empty and a second signal when said sequential access memory is full.
Claim 35
Dependent Claim
33 words
The system of claim 24, wherein the coded segments are each stored in said sequential access memory and said data string for each of said sets is stored in said sequential access memory.
Claim 36
Independent Claim
157 words
A system for storing information, comprising: a first digital bus configured to sequentially transmit a plurality of digital information groups each having a data string paired with an associated address of multiple bits; a second digital bus configured to transmit the groups; a first-in first-out memory with a number of multibit locations, said first-in first-out memory having an input port coupled to said first bus and an output port coupled to said second bus, said first-in first-out memory being configured to buffer transmission of the groups from said first bus to said second bus; and control logic operatively coupled to said first-in first-out memory, said first bus, and said second bus, said logic being configured to generate a plurality of values each representing the associated address for a corresponding one of a first number of the groups, the values each being stored in said first-in first-out memory and having fewer bits than the associated address being represented.
Claim 37
Independent Claim
157 words
A system for storing information, comprising: a first digital bus configured to sequentially transmit a plurality of digital information groups each having a data string paired with an associated address of multiple bits; a second digital bus configured to transmit the groups; a first-in first-out memory with a number of multibit locations, said first-in first-out memory having an input port coupled to said first bus and an output port coupled to said second bus, said first-in first-out memory being configured to buffer transmission of the groups from said first bus to said second bus; and control logic operatively coupled to said first-in first-out memory, said first bus, and said second bus, said logic being configured to generate a plurality of values each representing the associated address for a corresponding one of a first number of the groups, the values each being stored in said first-in first-out memory and having fewer bits than the associated address being represented.
Claim 38
Dependent Claim
53 words
The system of claim 31, wherein: said first-in first-out memory includes an input port and an output port; and said logic includes a comparator and a first multiplexer coupled between said input port and said digital device, and a latch and a second multiplexer coupled between a digital bus and said output port.
Claim 39
Dependent Claim
21 words
The system of claim 31, wherein the values each represent a difference between at least two different addresses from the groups.
Claim 40
Dependent Claim
30 words
The system of claim 31, wherein said logic generates a first signal when said first-in first-out memory is empty and a second signal when said first-in first-out memory is full.
Claim 41
Dependent Claim
45 words
The system of claim 31, wherein the values are each stored in said first-in first-out memory in place of the associated address represented thereby and the associated address for each of a second number of the groups is stored directly in said first-in first-out memory.
Claim 42
Dependent Claim
44 words
The system of claim 35, wherein the values are each sized for storage in a single one of the locations, and the associated address for each of the second number of groups has a size requiring at least two of the locations for storage.
Claim 43
Dependent Claim
53 words
The system of claim 31, wherein the locations each have a first bit length, the values each have a second bit length, the associated address has a third bit length, the second bit length does not exceed the first bit length, and the third bit length is greater than the first bit length.
References Cited (Backward Citations)
US4095283A
Cited
US4323790A
Cited
US4602333A
Cited
US4751675A
Cited
US4845678A
Cited
US5367649A
Cited
US5341318A
Cited
US5253213A
Cited
US5577218A
Cited
US5315696A
Cited
US5550782A
Cited
US5371870A
Cited
US5493282A
Cited
US5450599A
Cited
US5590279A
Cited
US5440753A
Cited
US5473756A
Cited
US5642486A
Cited
US5477490A
Cited
US5526316A
Cited
US5617506A
Cited
US5414701A
Cited
US5535199A
Cited
US5487049A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-12-26 | 2004-06-26 | 2004-12-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-12-26 | 2008-06-26 | 2008-12-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-12-26 | 2012-06-26 | 2012-12-26 | $7700.00 | Window Closed / Lapsed |