US4069970A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data access circuit for a memory array
Assignee: AT&T Inc
•
Filing: 1976-06-24
•
Granted: 1978-01-24
•
Expires: 1996-06-24
Abstract
Abstract A memory array, having a plurality of intersecting rows and columns, stores digitized speech. Each row and column intersection consists of a binary storage cell for storing one bit of digitized speech. Incoming digitized speech is loaded into columns of the memory array in a plurality of repetitive loading sequences, each loading sequence including: reading out the bits stored in successive rows of binary storage cells, replacing in each successive row of bits, a predetermined one of the bits in the read out row with a successive one of the bits of the digitized speech and writing each read out row of bits including the replaced bit back into the row. Multibit binary grunts (digitized speech segments) stored in the array are read out therefrom by applying the bits of the grunts to time slots in frames on a time-division highway, each frame being of n bits duration and including one bit from each of n grunts stored in the array. A selected grunt is extracted from the highway by commencing a count of the bits on the highway with a first bit of the selected grunt and by extracting the first bit and every n th bit thereafter. Memory malfunction is indicated when the number of rows in the array containing parity errors exceeds a predetermined threshold number.
Inventors
- 👤 Clair Alan Buzzard
- 👤 Richard Cyril Gifford
- 👤 Frank William Lescinsky
- 👤 Robert Michael Zachok
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 12:55
CPC Classifications
G; G11; G11C; G11C8/00; G06; G06F; G06F11/00; G06F11/07; G06F11/0703; G06F11/0751; G06F11/0754; G06F12/00; G06F12/02; G06F12/0207; G06F3/00; G06F3/16; G06F5/00; G11C7/00; G11C8/04; G06F11/08; G06F11/10; G06F11/1008
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
175 words
A data access circuit for storing a string of successive binary bits in a memory array, the memory array including a plurality of intersecting rows and columns, each row and each column intersection consisting of a binary storage cell, each storage cell storing one binary bit, means responsive to the application of the string of bits to the data access circuit for producing repetitive loading sequences, each loading sequence being associated with an individual column of the memory array, means responsive to the producing means and operative during each of the loading sequences for reading out the bits stored in successive rows of the memory array, and means responsive to the reading out means and operative each time a successive row of bits is read out from the memory array for replacing the bit read out from the column associated with a particular repetitive loading sequence with a successive one of the bits in the string of bits and for writing the read out row of bits and the replaced bit back into the row.
Claim 2
Dependent Claim
175 words
A data access circuit for storing a string of successive binary bits in a memory array, the memory array including a plurality of intersecting rows and columns, each row and each column intersection consisting of a binary storage cell, each storage cell storing one binary bit, means responsive to the application of the string of bits to the data access circuit for producing repetitive loading sequences, each loading sequence being associated with an individual column of the memory array, means responsive to the producing means and operative during each of the loading sequences for reading out the bits stored in successive rows of the memory array, and means responsive to the reading out means and operative each time a successive row of bits is read out from the memory array for replacing the bit read out from the column associated with a particular repetitive loading sequence with a successive one of the bits in the string of bits and for writing the read out row of bits and the replaced bit back into the row.
Claim 3
Dependent Claim
49 words
A data access circuit in accordance with claim 1 wherein the replacing means includes means for storing the read out row of bits in a recirculating register and for recirculating the read out bits, and means for precluding the recirculation of the bit read out from the associated column.
Claim 4
Dependent Claim
104 words
A data access circuit in accordance with claim 2 wherein the recirculating register contains a number of binary storage positions equal in number to the number of columns in the memory array, each binary storage position being associated with one column of the memory array, the replacing means further including means for selecting a particular column of the memory array in which the string of bits are to be written, and means responsive to the selecting means for repetitively inserting successive ones of the string of bits into the binary storage position of the register associated with the particular column of the memory array.
Claim 5
Dependent Claim
74 words
A data access circuit in accordance with claim 1 further including means for checking the parity of the bits stored in each row of the memory array, means responsive to the checking means for counting the number of rows in which parity errors occur, and means responsive to the counting means for indicating a malfunction in the memory array at the time the number of rows containing parity errors exceed a predetermined threshold number.
Claim 6
Dependent Claim
106 words
A data access circuit in accordance with claim 1 further including means for distributing the bits read out from each row of the memory array to time slots in frames on a time-division highway, each frame being of n bits duration and including one bit from each of n multibit grunts contained in the memory array, means for identifying a selected multibit grunt to be extracted from the highway, and means responsive to the identifying means for commencing a count of the bits on the highway with a first bit of the selected grunt and for extracting the first bit and every n th bit thereafter.
Claim 7
Dependent Claim
112 words
In a memory array comprising a plurality of intersecting rows and columns, each row and column including a plurality of binary storage cells, each storage cell storing one binary bit, means for checking the parity of the bits stored in each row of the memory array and means responsive to the checking means for indicating a malfunction in the memory array, means responsive to the checking means for counting the number of rows in which parity errors occur, and means responsive to the counting means for normally disabling the indicating means and for enabling the indicating means at the time the number of rows containing parity errors exceed a predetermined threshold number.
Claim 8
Dependent Claim
112 words
In a memory array comprising a plurality of intersecting rows and columns, each row and column including a plurality of binary storage cells, each storage cell storing one binary bit, means for checking the parity of the bits stored in each row of the memory array and means responsive to the checking means for indicating a malfunction in the memory array, means responsive to the checking means for counting the number of rows in which parity errors occur, and means responsive to the counting means for normally disabling the indicating means and for enabling the indicating means at the time the number of rows containing parity errors exceed a predetermined threshold number.
Claim 9
Dependent Claim
139 words
In a memory array in accordance with claim 6 further including, means responsive to the application of a string of binary bits to the memory array for producing repetitive loading sequences, each loading sequence being associated with an individual column of the memory array, means responsive to the producing means and operative during each of the loading sequences for reading out the bits stored in successive rows of the memory array, and means responsive to the reading out means and operative each time a successive row of bits is read out from the memory array for replacing the bit read out from the column associated with a particular repetitive loading sequence with a successive one of the bits in the string of bits for writing the read out row of bits and the replaced bit back into the row.
Claim 10
Dependent Claim
102 words
A data access circuit in accordance with claim 7 further including means for distributing the bits read out from each row to time slots in frames on a time-division highway, each frame being of n bits duration and including one bit from each of n multibit grunts contained in the memory array, means for identifying a selected multibit grunt to be extracted from the highway, and means responsive to the identifying means for commencing a count of the bits on the highway with a first bit of the selected grunt and for extracting the first bit and every n th bit thereafter.
Claim 11
Independent Claim
132 words
A method for storing a string of successive binary bits in a memory array, the memory array including a plurality of intersecting rows and columns, each row and column intersection consisting of a binary storage cell, each storage cell storing one binary bit, the method comprising the step of producing repetitive loading sequences, each loading sequence being associated with an individual column of the memory array, and each loading sequence further including the steps of, reading out the bits stored in successive rows of the memory array, replacing, in each read out row, the bit read out from the associated column of the memory array with a successive one of the bits in the string of bits, writing the read out row of bits and the replaced bit back into the row.
Claim 12
Independent Claim
132 words
A method for storing a string of successive binary bits in a memory array, the memory array including a plurality of intersecting rows and columns, each row and column intersection consisting of a binary storage cell, each storage cell storing one binary bit, the method comprising the step of producing repetitive loading sequences, each loading sequence being associated with an individual column of the memory array, and each loading sequence further including the steps of, reading out the bits stored in successive rows of the memory array, replacing, in each read out row, the bit read out from the associated column of the memory array with a successive one of the bits in the string of bits, writing the read out row of bits and the replaced bit back into the row.
Claim 13
Dependent Claim
61 words
A method for storing a string of successive binary bits in a memory array in accordance with claim 9 wherein the replacing step further includes the steps of storing each read out row of bits in a recirculating register, recirculating the read out bits stored in the register, and precluding the recirculation of the bit read out from the associated column.
Claim 14
Independent Claim
141 words
A method for selectively extracting a multibit binary word from a memory array, the memory array containing n multibit binary words, the method comprising the steps of, reading out the n multibit binary words stored in the memory array, distributing the bits of the multibit binary words to time slots in frames on a time-division highway, each frame being of n bits duration and including one bit from each of the n multibit binary words, identifying a selected multibit binary word to be extracted from the memory array, counting the bits on the time-division highway, commencing with a selected bit in a time slot in a first one of the frames on the time-division highway, the selected bit being the first bit from the selected multibit binary word, and repetitively extracting every n th bit counted subsequent to the selected bit.
Claim 15
Independent Claim
141 words
A method for selectively extracting a multibit binary word from a memory array, the memory array containing n multibit binary words, the method comprising the steps of, reading out the n multibit binary words stored in the memory array, distributing the bits of the multibit binary words to time slots in frames on a time-division highway, each frame being of n bits duration and including one bit from each of the n multibit binary words, identifying a selected multibit binary word to be extracted from the memory array, counting the bits on the time-division highway, commencing with a selected bit in a time slot in a first one of the frames on the time-division highway, the selected bit being the first bit from the selected multibit binary word, and repetitively extracting every n th bit counted subsequent to the selected bit.
Claim 16
Independent Claim
89 words
A method for detecting a malfunction in a memory array, the memory array consisting of a plurality of intersecting rows and columns, each row and column including a plurality of binary storage cells, each storage cell storing one binary bit, the method comprising the steps of, checking the parity of the bits stored in each row of the memory array, counting the number of rows in which parity errors occur, and indicating a malfunction at the time the number of rows containing parity errors exceed a predetermined threshold number.
Claim 17
Independent Claim
89 words
A method for detecting a malfunction in a memory array, the memory array consisting of a plurality of intersecting rows and columns, each row and column including a plurality of binary storage cells, each storage cell storing one binary bit, the method comprising the steps of, checking the parity of the bits stored in each row of the memory array, counting the number of rows in which parity errors occur, and indicating a malfunction at the time the number of rows containing parity errors exceed a predetermined threshold number.
Claim 18
Dependent Claim
203 words
A data access circuit, comprising, means for identifying selected multibit binary words to be extracted from a memory array containing n multibit binary words and means for extracting the selected multibit binary words from the memory array, the extracting means, including, means for reading out the n multibit binary words from the memory array, means responsive to the reading out means for distributing the bits of the multibit binary words to time slots in frames on a time-division highway, each frame being of n bits duration and including one bit from each of the n multibit binary words, characterized by the extracting means further including, a plurality of output means, each of the output means for repetitively counting the bits on the time-division highway and for extracting every n th bit counted, and means responsive to the identifying means for enabling each of the output means at selected points in time, aligned in time with various time slots in a first one of the frames on the time-division highway, each of the various time slots containing a first bit from one of the selected multibit binary words, whereby each of the output means extract one selected multibit binary word from the time-division highway.
Claim 19
Dependent Claim
203 words
A data access circuit, comprising, means for identifying selected multibit binary words to be extracted from a memory array containing n multibit binary words and means for extracting the selected multibit binary words from the memory array, the extracting means, including, means for reading out the n multibit binary words from the memory array, means responsive to the reading out means for distributing the bits of the multibit binary words to time slots in frames on a time-division highway, each frame being of n bits duration and including one bit from each of the n multibit binary words, characterized by the extracting means further including, a plurality of output means, each of the output means for repetitively counting the bits on the time-division highway and for extracting every n th bit counted, and means responsive to the identifying means for enabling each of the output means at selected points in time, aligned in time with various time slots in a first one of the frames on the time-division highway, each of the various time slots containing a first bit from one of the selected multibit binary words, whereby each of the output means extract one selected multibit binary word from the time-division highway.
Claim 20
Dependent Claim
161 words
A circuit in accordance with claim 13 further including means for storing a string of successive binary bits in the memory array, the memory array including a plurality of intersecting rows and columns, each row and each column intersection consisting of a binary storage cell, each storage cell storing one binary bit, the storing means further including, means responsive to the application of the string of bits to the memory array for producing repetitive loading sequences, each loading sequence being associated with an individual column of the memory array, means operative during each of the loading sequences for reading out the bits stored in successive rows of the memory array, and means responsive to the reading out of each row of bits for replacing the bit read out from the associated column with a successive one of the bits in the string of bits and for writing the read out row of bits and the replaced bit back into the row.
Claim 21
Dependent Claim
74 words
A data access circuit in accordance with claim 14 further including means for checking the parity of the bits stored in each row of the memory array, means responsive to the checking means for counting the number of rows in which parity errors occur, and means responsive to the counting means for indicating a malfunction in the memory array at the time the number of rows containing parity errors exceed a predetermined threshold number.
References Cited (Backward Citations)
US2904781A
Cited
US3398241A
Cited
US3641496A
Cited
US3652998A
Cited
US3789204A
Cited
US3898443A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1981-01-23 | 1981-07-25 | 1982-01-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-01-23 | 1985-07-25 | 1986-01-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-01-23 | 1989-07-25 | 1990-01-24 | $7700.00 | Window Closed / Lapsed |