Patent application number | Description | Published |
20090046386 | DATA FORMATTING IN DATA STORAGE - A method of processing data comprising arranging data into a data group comprising a plurality of sub groups each said subgroup comprising a plurality of columns; for each column, determining at least one checksum data of said column; and for each column, storing the checksum data of that column within at least one said subgroup of the group, other than the subgroup to which said column belongs. | 02-19-2009 |
20100174848 | DATA PROCESSING APPARATUS - A data processing apparatus comprises a monolithic integrated circuit having a data processor, a non-volatile memory storing at least one security code, and at least one interface at the boundary of the integrated circuit via which communication with the data processor can occur. Processing by the data processor of data received at the at least one interface is controlled by the at least one security code. | 07-08-2010 |
20100174920 | DATA PROCESSING APPARATUS - A data processing apparatus comprises an integrated circuit containing a data processor and a non-volatile store storing at least one security code. A first memory external to the integrated circuit stores data, the data being cryptographically protected in a first format. A second memory external to the integrated circuit is provided for storing data. The apparatus is arranged to transfer data from the first memory via the integrated circuit to the second memory to be accessed by the data processor from the second memory. The integrated circuit is arranged to validate during the transfer the data read from the first memory using a security code stored in the non-volatile store. If the data is validated, cryptographic protection is applied in a second format to the validated data using a security code stored in the non-volatile store. The protected data is stored in the second memory in the second format. | 07-08-2010 |
20120032823 | METHOD AND APPARATUS FOR ADAPTIVE LOSSLESS DATA COMPRESSION - A method for performing adaptive lossless data compression using a buffer memory comprises the steps of receiving a plurality of first match signals (m( | 02-09-2012 |
20120047328 | DATA DE-DUPLICATION FOR SERIAL-ACCESS STORAGE MEDIA - Data storage and retrieval methods and apparatus are provided for facilitating data de-duplication for serial-access storage media such as tape. During data storage, input data is divided into a succession of chunks and, for each chunk, a corresponding data item is written to the storage media. The data item comprises the chunk data itself where it is the first occurrence of that data, and otherwise comprises a chunk-data identifier identifying that chunk of subject data. To facilitate reconstruction of the original data on read-back from the storage media a cache ( | 02-23-2012 |
20120098681 | HISTORY BUFFER APPARATUS AND METHOD FOR ADAPTIVE LOSSLESS DATA COMPRESSION - A history buffer for use in adaptive lossless data compression comprises a plurality of memory locations. The memory locations are partitioned into two or more segments, each segment configured to detect a match sequence independently of the other segments. Control logic is provided for controlling the detection of match sequences between the two or more segments. | 04-26-2012 |
20120293344 | COMPRESSING AND DECOMPRESSING DATA - A technique includes compressing or decompressing data using a relative displacement of a location of a data pattern. | 11-22-2012 |
20140215289 | PROVIDING MEMORY PROTECTION USING A MODIFIED ERROR CORRECTION CODE - Data and a corresponding initial error correction code is written to a first portion of a memory device. Based on an error in the first data and the initial error correction code, the initial error correction code is modified. | 07-31-2014 |
20140340778 | De-Duplication - A method and apparatus for data de-duplication is disclosed. Use de-duplication engine (DDE) divides data into regions. The DDE processes the regions in a serial fashion. The DDE clears its hash table before processing the first region. Each region is divided into a number of chunks. A hash is generated for each chunk in a region. When a hash for a chunk is not in a hash table, the hash is stored in the hash table and the chunk is stored on media. When the hash is a duplicate of a hash already in the table, the hash and chunk are discarded and a reference to the previously stored chunk is stored to the media. The DDE does not retain all the hashes from all the regions in the hash table at the same time. The DDE only retains the hashes for the current region being processed and N previous regions where N is a positive integer greater than zero. | 11-20-2014 |