Random access memory device

Claim 2

A random access storage and retrieval circuit, comprising: a plurality of storage elements arranged in a logical sequence of storage locations; means for inserting input data into a selected storage location and moving previously stored data to vacate the selected location and maintain the stored data in a single continuous sequence of storage locations; and means for reading output data from a selected storage location and optionally purging the output data and consolidating the remaining stored data into a single continuous sequence of storage locations.

Claim 3

A random access storage and retrieval circuit as set forth in claim 1, wherein: said data storage elements are arranged in a sequence numbered 0 through n; said means for inserting input data functions to shift data stored in locations i through n-1 to locations i+1 through n, respectively, before insertion into location i; and said means for reading output data functions to shift data from locations k+1 through n to locations k through n-1, respectively, after reading from location k.

Claim 4

A random access storage and retrieval circuit as set forth in claim 2, wherein: said means for inserting input data is operative to write always into location 0.

Claim 5

A random access storage and retrieval circuit as set forth in claim 2 wherein: said means for inserting input data is operative to write into the lowest-numbered unoccupied location.

Claim 6

A random access storage and retrieval circuit as set forth in claim 2 wherein: each of said storage elements includes a plurality of single-bit storage cells, each of which has a master flip-flop and a slave flip-flop, containing identical data at the beginning and end of a read or write operation; and said circuit performs write and read operations on said master flip-flops, and performs necessary shifting operations under the control of two spaced clock signals, the first of which initiates the shifting of data between master and slave flip-flops of adjacent storage locations, and the second of which initiates the copying of data in an appropriate direction between master and slave flip-flops of the same storage location.

Claim 7

A random access storage and retrieval circuit, comprising: a plurality of storage elements arranged in a logical sequence of contiguous locations; a write control line, to enable a writing operation into said circuit; a set of write address lines, to define the location into which data is to be written; an insert control line to allow optional insertion of written data into the logical sequence of contiguous locations; a read control line, to enable a reading operation from said circuit; a set of read address lines, to define the location from which data is to be read; a purge control line, to allow optional purging of data read from said circuit; data reading means responsive to signals on said read control line and said read address lines, for reading data from the read location specified by said read address lines; data purging means, coupled to said data reading means and responsive to signals on said purge control line, for purging data from the specified read location, and consolidating the remaining data into a single region of contiguous locations, by shifting by one location all data stored on a preselected side of the specified read location; data writing means responsive to signals on said write control line and said write address lines, for writing new data into a write location specified by said write address lines; and data insertion means, coupled to said data writing means and responsive to signals on said insert control line, for preserving previously stored data by first shifting by one location the data in and to a preselected side of the specified write location.

Claim 8

A random access storage and retrieval circuit, comprising: a plurality of storage elements arranged in a logical sequence of contiguous locations; a write control line, to enable a writing operation into said circuit; a set of write address lines, to define the location into which data is to be written; an insert control line to allow optional insertion of written data into the logical sequence of contiguous locations; a read control line, to enable a reading operation from said circuit; a set of read address lines, to define the location from which data is to be read; a purge control line, to allow optional purging of data read from said circuit; data reading means responsive to signals on said read control line and said read address lines, for reading data from the read location specified by said read address lines; data purging means, coupled to said data reading means and responsive to signals on said purge control line, for purging data from the specified read location, and consolidating the remaining data into a single region of contiguous locations, by shifting by one location all data stored on a preselected side of the specified read location; data writing means responsive to signals on said write control line and said write address lines, for writing new data into a write location specified by said write address lines; and data insertion means, coupled to said data writing means and responsive to signals on said insert control line, for preserving previously stored data by first shifting by one location the data in and to a preselected side of the specified write location.

Claim 9

A random access storage and retrieval circuit as set forth in claim 6, wherein: said data storage elements are arranged in a sequence numbered 0 through n; said data insertion means functions to shift data stored in locations i through n-1 to locations i+1 through n, respectively, before insertion into location i as called for by said write address lines; and said data purging means functions to shift data from locations k+1 through n to locations k through n-1, respectively, after reading from location k as called for by said read address lines.

Claim 10

A random access storage and retrieval circuit as set forth in claim 7, wherein: said data writing means is operative to write always into location 0.

Claim 11

A random access storage and retrieval circuit as set forth in claim 7, wherein: said data writing means is operative to write into the lowest-numbered unoccupied location.

Claim 12

A random access storage and retrieval circuit as set forth in claim 7, wherein: each of said storage elements includes a plurality of single-bit storage cells, each of which has a master flip-flop and a slave flip-flop, containing identical data at the beginning and end of a read or write operation; and said circuit performs write and read operations on said master flip-flops, and performs necessary shifting operations under the control of two spaced clock signals, the first of which initiates the shifting of data between master and slave flip-flops of adjacent storage locations, and the second of which initiates the copying of data in an appropriate direction between master and slave flip-flops of the same storage location.

Claim 13

A random access storage and retrieval circuit, comprising: a plurality of storage elements arranged in a logical sequence of contiguous locations numbered from 0 through n; a write control line, to enable a writing operation into said circuit; a set of write address lines, to define the location WA into which data is to be written; an insert control line to allow optional insertion of written data into the logical sequence of contiguous locations; a read control line, to enable a reading operation from said circuit; a set of read address lines, to define the location RA from which data is to be read; a purge control line, to allow optional purging of data read from said circuit; data reading means responsive to signals on said read control line and said read address lines, for reading data from the read location RA specified by said read address lines; data purging means, coupled to said data reading means and reponsive to signals on said purge control line, for purging data from the specified read location RA, and consolidating the remaining data into a single region of contiguous locations, by shifting down by one location all data stored in and above locations WA+1; data writing means responsive to signals on said write control line and said write address lines, for writing new data into the write location WA specified by said write address lines; and data insertion means, coupled to said data writing means and responsive to signals on said insert control line, for preserving previously stored data by first shifting up by one location the data stored in and above location WA.

Claim 14

A random access storage and retrieval circuit, comprising: a plurality of storage elements arranged in a logical sequence of contiguous locations numbered from 0 through n; a write control line, to enable a writing operation into said circuit; a set of write address lines, to define the location WA into which data is to be written; an insert control line to allow optional insertion of written data into the logical sequence of contiguous locations; a read control line, to enable a reading operation from said circuit; a set of read address lines, to define the location RA from which data is to be read; a purge control line, to allow optional purging of data read from said circuit; data reading means responsive to signals on said read control line and said read address lines, for reading data from the read location RA specified by said read address lines; data purging means, coupled to said data reading means and reponsive to signals on said purge control line, for purging data from the specified read location RA, and consolidating the remaining data into a single region of contiguous locations, by shifting down by one location all data stored in and above locations WA+1; data writing means responsive to signals on said write control line and said write address lines, for writing new data into the write location WA specified by said write address lines; and data insertion means, coupled to said data writing means and responsive to signals on said insert control line, for preserving previously stored data by first shifting up by one location the data stored in and above location WA.

Claim 15

A random access storage and retrieval circuit as set forth in claim 11, wherein: said data writing means is operative to write always into location 0.

Claim 16

A random access storage and retrieval circuit as set forth in claim 11, wherein: said data writing means is operative to write into the lowest-numbered unoccupied location.

Claim 17

A random access storage and retrieval circuit as set forth in claim 11, wherein: each of said storage elements includes a plurality of single-bit storage cells, each of which has a master flip-flop and a slave flip-flop, containing identical data at the beginning and end of a read or write operation; and said circuit performs write and read operations on said master flip-flops, and performs necessary shifting operations under the control of two spaced clock signals, the first of which initiates the shifting of data between master and slave flip-flops of adjacent storage locations, and the second of which initiates the copying of data in an appropriate direction between master and slave flip-flops of the same storage location.

Claim 18

For use in a computer with multiple processors, a random access storage and retrieval circuit, comprising: a plurality of storage elements arranged in a logical sequence of storage locations; means for inserting input data into a selected storage location and moving previously stored data to vacate the selected location and maintain the stored data in a single continuous sequence of storage locations; and means for reading output data from a selected storage location and optionally purging the output data and consolidating the remaining stored data into a single continuous sequence of storage locations.

Claim 19

For use in a computer with multiple processors, a random access storage and retrieval circuit, comprising: a plurality of storage elements arranged in a logical sequence of storage locations; means for inserting input data into a selected storage location and moving previously stored data to vacate the selected location and maintain the stored data in a single continuous sequence of storage locations; and means for reading output data from a selected storage location and optionally purging the output data and consolidating the remaining stored data into a single continuous sequence of storage locations.

Claim 20

A random access storage and retrieval circuit as set forth in claim 15, wherein: said data storage elements are arranged in a sequence numbered 0 through n; said means for inserting input data functions to shift data stored in locations i through n-1 to locations i+1 through n, respectively, before insertion into location i; and said means for reading output data functions to shift data from locations k+1 through n to locations k through n-1, respectively, after reading from location k.

Claim 21

A random access storage and retrieval circuit as set forth in claim 16, wherein: said means for inserting input data is operative to write always into location 0.

Claim 22

A random access storage and retrieval circuit as set forth in claim 16, wherein: said means for inserting input data is operative to write into the lowest-numbered unoccupied location.

Claim 23

A random access storage and retrieval circuit as set forth in claim 16, wherein: each of said storage elements includes a plurality of single-bit storage cells, each of which has a master flip-flop and a slave flip-flop, containing identical data at the beginning and end of a read or write operation; and said circuit performs write and read operations on said master flip-flops, and performs necessary shifting operations under the control of two spaced clock signals, the first of which initiates the shifting of data between master and slave flip-flops of adjacent storage locations, and the second of which initiates the copying of data in an appropriate direction between master and slave flip-flops of the same storage location.