Patent JPS5080853A successfully refreshed from Google Patents.
US5241663A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Hierarchically pairing memory blocks based upon relative storage capacities and simultaneously accessing each memory block within the paired memory blocks
Assignee: Sony Electronics Inc
•
Filing: 1990-05-31
•
Granted: 1993-08-31
•
Expires: 2010-05-31
Abstract
Abstract An automatic memory sizer for a digital video recorder is provided. The sizer in accordance with the present invention automatically examines and configures available memory space for efficient storage of digital video information regardless of whether the memory consists of similar devices and/or storage capacities. By checking for selectively placed conductive jumpers on the circuit boards containing the memory devices, or by systematically writing test data into and reading it back out of the memory devices, the sizer in accordance with the present invention automatically determines the presence or absence of available memory assemblies and their respective relative data storage capacities. The sizer then establishes a hierarchy of available memory assemblies for pairing portions thereof based upon their respective relative data storage capacities, creates a memory address allocation table based upon such pairings for efficient accessing thereof, and writes incoming video data into the memory assemblies according to the allocation table.
Inventors
- 👤 Thomas A. Rohwer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 23:27
CPC Classifications
H; H04; H04N; H04N5/00; H04N5/76; H04N5/907; H04N5/91; H04N5/93; H04N5/937
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
183 words
A method for allocating data storage capacity within a plurality of memory circuits for efficiently storing data therein, comprising the steps of: electrically sensing a data storage capacity available within each one of a plurality of memory circuits, wherein each one of the memory circuit data storage capacities includes at least one memory block and has a relative storage capacity with respect to the remaining memory circuit data storage capacities; hierarchically pairing memory blocks within two different ones of the plurality of memory circuits according to the relative storage capacities of each one of the plurality of memory circuits by generating and storing addresses in an address memory which correspond to the paired memory blocks within the plurality of memory circuits, thereby creating an address allocation table which contains addresses for addressing the paired memory blocks within the plurality of memory circuits according to a hierarchy; receiving data; and hierarchically storing the received data while simultaneously writing and reading previously stored data into and out from, respectively, the paired memory blocks within the plurality of memory circuits according to the address allocation table.
Claim 2
Independent Claim
183 words
A method for allocating data storage capacity within a plurality of memory circuits for efficiently storing data therein, comprising the steps of: electrically sensing a data storage capacity available within each one of a plurality of memory circuits, wherein each one of the memory circuit data storage capacities includes at least one memory block and has a relative storage capacity with respect to the remaining memory circuit data storage capacities; hierarchically pairing memory blocks within two different ones of the plurality of memory circuits according to the relative storage capacities of each one of the plurality of memory circuits by generating and storing addresses in an address memory which correspond to the paired memory blocks within the plurality of memory circuits, thereby creating an address allocation table which contains addresses for addressing the paired memory blocks within the plurality of memory circuits according to a hierarchy; receiving data; and hierarchically storing the received data while simultaneously writing and reading previously stored data into and out from, respectively, the paired memory blocks within the plurality of memory circuits according to the address allocation table.
Claim 3
Dependent Claim
49 words
A method as recited in claim 1, wherein the step of electrically sensing a data storage capacity available within each one of a plurality of memory circuits comprises electrically sensing an existence and placement of at least one conductive jumper in each one of the plurality of memory circuits.
Claim 4
Dependent Claim
53 words
A method as recited in claim 1, wherein the step of electrically sensing a data storage capacity available within each one of a plurality of memory circuits comprises storing test data into and reading the stored test data out from successively incremented memory locations within each one of the plurality of memory circuits.
Claim 5
Dependent Claim
116 words
A method as recited in claim 1, wherein the step of hierarchically pairing memory blocks within two different ones of the plurality of memory circuits according to the relative storage capacities of each one of the plurality of memory circuits comprises pairing a memory block within the memory circuit having a largest relative storage capacity with a memory block within the memory circuit having a next largest relative storage capacity, and the allocation table contains addresses which correspond to memory locations within the memory circuit having the next largest relative storage capacity and further contains addresses which correspond to a substantially equivalent number of memory locations within the memory circuit having the largest relative storage capacity.
Claim 6
Dependent Claim
77 words
A method as recited in claim 1, wherein the step of hierarchically storing the received data while simultaneously writing and reading previously stored data into and out from, respectively, the paired memory blocks within the plurality of memory circuits according to the address allocation table comprises storing data into the first one of a paired pair of memory blocks while simultaneously reading out previously stored data from the second one of the paired pair of memory blocks.
Claim 7
Dependent Claim
190 words
A computer programmed for allocating data storage capacity within a plurality of memory circuits for efficiently storing data therein, wherein the computer is programmed to perform the steps of: electrically sensing a data storage capacity available within each one of a plurality of memory circuits, wherein each one of the memory circuit data storage capacities includes at least one memory block and has a relative storage capacity with respect to the remaining memory circuit data storage capacities; hierarchically pairing memory blocks within two different ones of the plurality of memory circuits according to the relative storage capacities of each one of the plurality of memory circuits by generating and storing addresses in an address memory which correspond to the paired memory blocks within the plurality of memory circuits, thereby creating an address allocation table which contains addresses for addressing the paired memory blocks within the plurality of memory circuits according to a hierarchy; receiving data; and hierarchically storing the received data while simultaneously writing and reading previously stored data into and out from, respectively, the paired memory blocks within the plurality of memory circuits according to the address allocation table.
Claim 8
Dependent Claim
190 words
A computer programmed for allocating data storage capacity within a plurality of memory circuits for efficiently storing data therein, wherein the computer is programmed to perform the steps of: electrically sensing a data storage capacity available within each one of a plurality of memory circuits, wherein each one of the memory circuit data storage capacities includes at least one memory block and has a relative storage capacity with respect to the remaining memory circuit data storage capacities; hierarchically pairing memory blocks within two different ones of the plurality of memory circuits according to the relative storage capacities of each one of the plurality of memory circuits by generating and storing addresses in an address memory which correspond to the paired memory blocks within the plurality of memory circuits, thereby creating an address allocation table which contains addresses for addressing the paired memory blocks within the plurality of memory circuits according to a hierarchy; receiving data; and hierarchically storing the received data while simultaneously writing and reading previously stored data into and out from, respectively, the paired memory blocks within the plurality of memory circuits according to the address allocation table.
Claim 9
Dependent Claim
50 words
A computer as recited in claim 6, wherein the program step of electrically sensing a data storage capacity available within each one of a plurality of memory circuits comprises electrically sensing an existence and placement of at least one conductive jumper in each one of the plurality of memory circuits.
Claim 10
Dependent Claim
54 words
A computer as recited in claim 6, wherein the program step of electrically sensing a data storage capacity available within each one of a plurality of memory circuits comprises storing test data into and reading the stored test data out from successively incremented memory locations within each one of the plurality of memory circuits.
Claim 11
Dependent Claim
117 words
A computer as recited in claim 6, wherein the program step of hierarchically pairing memory blocks within two different ones of the plurality of memory circuits according to the relative storage capacities of each one of the plurality of memory circuits comprises pairing a memory block within the memory circuit having a largest relative storage capacity with a memory block within the memory circuit having a next largest relative storage capacity, and the allocation table contains addresses which correspond to memory locations within the memory circuit having the next largest relative storage capacity and further contains addresses which correspond to a substantially equivalent number of memory locations within the memory circuit having the largest relative storage capacity.
Claim 12
Dependent Claim
78 words
A computer as recited in claim 6, wherein the program step of hierarchically storing the received data while simultaneously writing and reading previously stored data into and out from, respectively, the paired memory blocks within the plurality of memory circuits according to the address allocation table comprises storing data into the first one of a paired pair of memory blocks while simultaneously reading out previously stored data from the second one of the paired pair of memory blocks.
References Cited (Backward Citations)
USRE31318E
Cited
US4342079A
Cited
GB2098021A
Cited
US4432055A
Cited
US4511964A
Cited
US4654787A
Cited
US4713759A
Cited
US5047920A
Cited
US4908789A
Cited
GB2204721A
Cited
US4980850A
Cited
US4772948A
Cited
US4780755A
Cited
US5093809A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-08-30 | 1997-03-01 | 1997-08-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-08-30 | 2001-03-01 | 2001-08-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-08-30 | 2005-03-01 | 2005-08-31 | $7700.00 | Window Closed / Lapsed |