Patent application number | Description | Published |
20080256422 | Apparatus for Providing Error Correction Capability to Longitudinal Position Data - A method and apparatus for providing error correction capability to longitudinal position data are disclosed. Initially, data are encoded via a set of even LPOS words and a set of odd LPOS words. The encoded data are then decoded by generating a set of syndrome bits for each of the LPOS words. A determination is then made as to whether or not there is an error within one of the LPOS words based on its corresponding syndrome bits. | 10-16-2008 |
20080256423 | Apparatus for Providing Error Correction Capability to Longitudinal Position Data - A method and apparatus for providing error correction capability to longitudinal position data are disclosed. Initially, data are encoded via a set of even LPOS words and a set of odd LPOS words. The encoded data are then decoded by generating a set of syndrome bits for each of the LPOS words. A determination is then made as to whether or not there is an error within one of the LPOS words based on its corresponding syndrome bits. | 10-16-2008 |
20080284624 | HIGH-RATE RLL ENCODING - An unencoded m-bit data input sequence is divided into a block of n bits and a block of m−n bits. The block of n bits is divided into a first set of n+1 encoded bits, wherein at least one of P1 subblocks of the first set satisfies a G, M and I constraints. The first set of n+1 encoded bits is mapped into a second set of n+1 encoded bits wherein at least one of P2 subblocks of the second set gives rise to at least Q1 transitions after 1/(1+D | 11-20-2008 |
20090027242 | HIGH-RATE RLL ENCODING - An unencoded m-bit data input sequence is divided into a block of n bits and a block of m-n bits. The block of n bits is divided into a first set of n+1 encoded bits, wherein at least one of P1 subblocks of the first set satisfies a G, M and I constraints. The first set of n+1 encoded bits is mapped into a second set of n+1 encoded bits wherein at least one of P2 subblocks of the second set gives rise to at least Q1 transitions after 1/(1+D | 01-29-2009 |
20090089645 | DATA STORAGE SYSTEMS - Method and apparatus for decoding data in a data storage system. In operation, a detector generates an output bit stream in dependence on a data block received from a storage subsystem of the data storage system. A post processor connected to the detector generates a first error corrected bit stream in dependence on the output bit stream and the data block. An error correction decoder connected to the post processor generates a second error corrected bit stream in dependence on the first error corrected bit stream and also generates a checksum in dependence of the second error corrected bit stream. A feedback path supplies from the error correction decoder to the post processor pinning data indicative of locations of correct bits in the second error corrected bit stream in the event that the checksum is indicative of errors in the second error corrected bit stream and the second error corrected bit stream comprises at least one correct interleave. The post processor regenerates the first error corrected bit stream in dependence on the pinning data received from the error correction decoder. | 04-02-2009 |
20090279201 | JOINT SPECIFICATION OF SERVO FORMAT AND SERVO READER PARAMETERS FOR TAPE DRIVE SYSTEMS - A servo pattern, including stripes arranged in servo bursts for use in position error signal (PES) generation, is provided in which a stripe width is narrower than 1.7 μm and in which the stripes are oriented at an azimuth angle which in absolute value is equal to or larger than 6 degrees. | 11-12-2009 |
20090279202 | HEAD DESIGN FOR WRITING SERVO PATTERNS ON MAGNETIC TAPE - A servo write head is provided and is configured to simultaneously write at least two servo patterns in respective servo bands on linear magnetic tape. Centerlines of the servo patterns are substantially uniformly spaced in the lateral direction. In addition, the servo patterns of all adjacent respective servo bands are displaced relative to each other in a longitudinal direction by an amount that is related to a length of a servo frame and a type of the servo patterns. | 11-12-2009 |
20100177420 | REWRITING CODEWORD OBJECTS TO MAGNETIC DATA TAPE UPON DETECTION OF AN ERROR - During a read-after-write operation on magnetic tape, a first SCO is formed which includes two encoded processed user data units and is one of T SCOs in a first SCO set. The user data units are each one of T user data units in first and second user data unit sets, respectively, within the first SCO set. The first SCO set is written to the magnetic tape and is immediately read. When an error is detected in one of the user data units, a second SCO is formed to include the first user data unit and, only if an error is not detected in a user data unit in the other user data unit set, to not include the other user data unit, the second SCO being one of T SCOs in a second SCO set. Then, the second SCO set is rewritten to a later position on the tape later. | 07-15-2010 |
20100177422 | REWRITE-EFFICIENT ECC/INTERLEAVING FOR MULTI-TRACK RECORDING ON MAGNETIC TAPE - For writing data to multi-track tape, a received data set is received and segmented into unencoded subdata sets, each comprising an array having K | 07-15-2010 |
20100180180 | ECC INTERLEAVING FOR MULTI-TRACK RECORDING ON MAGNETIC TAPE - Conventional C2 coding and interleaving for multi-track data tape in LTO-¾ do not support recording data onto a number of concurrent tracks which is not a power of two. Higher-rate longer C2 codes, which do not degrade error rate performance, are provided. An adjustable format and interleaving scheme accommodates future tape drives in which the number of concurrent tracks is not necessarily a power of two. A data set is segmented into a plurality of unencoded subdata sets and parity bytes are generated for each row and column. The parameters of the C2 code include N | 07-15-2010 |
20100226037 | COMBINING INFORMATION FROM PARALLEL SERVO CHANNELS - A weighted combining scheme exploits information from two servo channels operating in parallel. A timing-based servo module servo module comprises two servo channels coupled respectively to receive two digital servo signals read from a data tape. Both channels have outputs for an unweighted metric and for a measure of the channel reliability. A weight computation module provides first and second weight signals using the measures of channel reliability from the servo channels. A first multiplying node receives a first unweighted metric and a first weight signal and is operable to output a first weighted metric. A second multiplying node receives a second unweighted metric and a second weight signal and outputs a second weighted metric. A summing node receives the first and second weighted metrics and outputs a combined weighted metric to an LPOS word decoder. | 09-09-2010 |
20100226039 | COMBINING INFORMATION FROM PARALLEL SERVO CHANNELS - A weighted combining scheme exploits information from two servo channels operating in parallel. A timing-based servo module comprises two synchronous servo channels coupled respectively to receive two digital servo signals read from a data tape. Both channels have outputs for an unweighted parameter estimate and for a measure of the channel reliability. A weight computation module provides first and second weight signals using the measures of channel reliability from the servo channels. An offset computation module provides first and second offset terms which are summed with the unweighted parameter estimates. Multiplying nodes receive the unweighted parameter estimates and the weight signals and outputs offset weighted parameter estimates. A summing node receives the offset weighted parameter estimates and outputs a combined offset weighted parameter estimate to a servomechanism. | 09-09-2010 |
20100302666 | DETECTING A PERIODIC SEQUENCE OF SERVO SIGNALS - A system and method are disclosed for detecting a periodic sequence. A value detector module detects a plurality of values of a periodic sequence. In one embodiment, a transformation module transforms the plurality of values into transformed values. A confinement module confines the values to a limited set of confined values. A correlation module correlates the confined values with a plurality of instances of the periodic sequence. In addition, a selection module selects an instance of the periodic sequence with the highest correlation to the confined values as an observed periodic sequence. | 12-02-2010 |
20100328803 | COMBINING INFORMATION FROM PARALLEL SERVO CHANNELS - A weighted combining scheme exploits information from two servo channels operating in parallel. A timing-based servo module comprises two synchronous servo channels coupled respectively to receive two digital servo signals read from a data tape. Both channels have outputs for an unweighted parameter estimate and for a measure of the channel reliability. A weight computation module provides first and second weight signals using the measures of channel reliability from the servo channels. An offset computation module provides first and second offset terms which are summed with the unweighted parameter estimates. Multiplying nodes receive the unweighted parameter estimates and the weight signals and outputs offset weighted parameter estimates. A summing node receives the offset weighted parameter estimates and outputs a combined offset weighted parameter estimate to a servomechanism. | 12-30-2010 |
20110007418 | COMBINING INFORMATION FROM PARALLEL SERVO CHANNELS - A weighted combining scheme exploits information from two servo channels operating in parallel. A timing-based servo module comprises two synchronous servo channels coupled respectively to receive two digital servo signals read from a data tape. Both channels have outputs for an unweighted parameter estimate and for a measure of the channel reliability. A weight computation module provides first and second weight signals using the measures of channel reliability from the servo channels. An offset computation module provides first and second offset terms which are summed with the unweighted parameter estimates. Multiplying nodes receive the unweighted parameter estimates and the weight signals and outputs offset weighted parameter estimates. A summing node receives the offset weighted parameter estimates and outputs a combined offset weighted parameter estimate to a servomechanism. | 01-13-2011 |
20110131472 | SOLID-STATE STORAGE SYSTEM WITH PARALLEL ACCESS OF MULTIPLE FLASH/PCM DEVICES - Systems and methods are provided that confront the problem of failed storage integrated circuits (ICs) in a solid state drive (SSD) by using a fault-tolerant architecture along with one error correction code (ECC) mechanism for random/burst error corrections and an L-fold interleaving mechanism. The systems and methods described herein keep the SSD operational when one or more integrated circuits fail and allow the recovery of previously stored data from failed integrated circuits and allow random/burst errors to be corrected in other operational integrated circuits. These systems and methods replace the failed integrated circuits with fully functional/operational integrated circuits treated herein as spare integrated circuits. Furthermore, these systems and methods improve I/O performance in terms of maximum achievable read/write data rate. | 06-02-2011 |
20110138103 | INTRA-BLOCK MEMORY WEAR LEVELING - A method for intra-block wear leveling within solid-state memory subjected to wear, having a plurality of memory cells includes the step of writing to at least certain ones of the plurality of memory cells, in a non-uniform manner, such as to balance the wear of the at least certain ones of the plurality of memory cells within the solid-state memory, at intra-block level. For example, if a behavior of at least some of the plurality of memory cells is not characterized, then the method may comprise characterizing a behavior of at least some of the plurality of memory cells and writing to at least certain ones of the plurality of memory cells, based on the characterized behavior, and in a non-uniform manner. | 06-09-2011 |
20110252290 | INTEGRATED DATA AND HEADER PROTECTION FOR TAPE DRIVES - A method for integrating data and header protection in tape drives includes receiving an array of data organized into rows and columns. The array is extended to include one or more headers for each row of data in the array. The method provides two dimensions of error correction code (ECC) protection for the data in the array and a single dimension of ECC protection for the headers in the array. A corresponding apparatus is also disclosed herein. | 10-13-2011 |
20120033321 | TAPE LAYOUT DESIGN FOR RELIABLE ECC DECODING - A method for physically laying out data on tape is disclosed herein. In one embodiment, such a method includes receiving a data set, wherein the data set includes S sub data sets (SDSs) of fixed size and each SDS includes N codeword interleaves (CWIs). The method further distributes the CWIs for the S SDSs across T tracks on a physical tape medium such that the distances between CWIs of the same SDS are substantially maximized on the physical tape medium. To maximize the distances, the method periodically rotates the tracks within the data set by a track rotation value R, wherein the number of tracks T is equal to 2 | 02-09-2012 |
20120036318 | EFFICIENT REWRITE TECHNIQUE FOR TAPE DRIVES - A method for efficiently rewriting data to tape is disclosed herein. In one embodiment, such a method includes writing a data set to tape, the data set comprising S sub data sets of fixed size, each sub data set comprising N code word interleaves (CWIs). The method further includes reading the data set while writing it to the tape to identify faulty CWIs. While reading the data set, the method buffers the faulty CWIs (such as by storing, identifying, and/or marking the faulty CWIs) for later retrieval. When the end of the data set is reached, the method writes corrected versions of the faulty CWIs to the end of the data set. A corresponding apparatus is also disclosed and claimed herein. | 02-09-2012 |
20120079351 | Systems and Methods for Memory Devices - A method for writing data to a memory array includes receiving a write request including data from a processor, compressing the data, assigning a page strength to the compressed data, the page strength defined by a compression ratio used to compress the data, generating a parity data block associated with the compressed data, and saving the compressed data and the parity data block in a page of the memory array, the page of the memory array having a page strength corresponding to the assigned page strength of the compressed data. | 03-29-2012 |
20120144271 | DECODING ENCODED DATA CONTAINING INTEGRATED DATA AND HEADER PROTECTION - A method for decoding encoded data comprising integrated data and header protection is disclosed herein. In one embodiment, such a method includes receiving an extended data array. The extended data array includes a data array organized into rows and columns, headers appended to the rows of the data array, column ECC parity protecting the columns of the data array, and row ECC parity protecting the rows and headers combined. The method then decodes the extended data array. Among other operations, this decoding step includes checking the header associated with each row to determine whether the header is legal. If the header is legal, the method determines the contribution of the header to the corresponding row ECC parity. The method then reverses the contribution of the header to the corresponding row ECC parity. A corresponding apparatus (i.e., a tape drive configured to implement the above-described method) is also disclosed herein. | 06-07-2012 |
20120210194 | INTEGRATED DATA AND HEADER PROTECTION FOR TAPE DRIVES - A method for integrating data and header protection in tape drives includes receiving an array of data organized into rows and columns. The array is extended to include one or more headers for each row of data in the array. The method provides two dimensions of error correction code (ECC) protection for the data in the array and a single dimension of ECC protection for the headers in the array. A corresponding apparatus is also disclosed herein. | 08-16-2012 |
20120260150 | DATA MANAGEMENT IN SOLID STATE STORAGE SYSTEMS - Methods and apparatus are provided for controlling data management operations including storage of data in solid state storage of a solid state storage system. Input data is stored in successive groups of data write locations in the solid state storage. Each group comprises a set of write locations in each of a plurality of logical subdivisions of the solid state storage. The input data to be stored in each group is encoded in accordance with first and second linear error correction codes. The encoding is performed by constructing from the input data to be stored in each group a logical array of rows and columns of data symbols. The rows and columns are respectively encoded in accordance with the first and second linear error correction codes to produce an encoded array in which all rows correspond to respective first codewords and columns correspond to respective second codewords. | 10-11-2012 |
20120266050 | Data Management in Solid State Storage Devices - A mechanism is provided for controlling a solid state storage device in which the solid state storage comprises erasable blocks each comprising a plurality of data write locations. Input data is stored in successive groups of data write locations, each group comprising write locations in a set of erasable blocks in each of a plurality of logical subdivisions of the solid state storage. The input data is error correction encoded such that each group contains an error correction code for the input data in that group. Metadata, indicating the location of input data in the solid state storage, is maintained in memory, An indication of validity of data stored in each data write location is also maintained, Prior to erasing a block, valid input data is recovered from the or each said group containing write locations in that block. The recovered data is then re-stored as new input data. | 10-18-2012 |
20120290899 | METHOD, DEVICE AND COMPUTER PROGRAM PRODUCT FOR DECODING A CODEWORD - A method and apparatus for decoding a codeword received from a flash memory. The flash memory comprises multi-level flash memory cells, wherein each multi-level flash memory cell stores one symbol of the codeword. An ECC decoder is arranged for decoding the codeword into a decoded codeword and correcting a maximum number of errors. The method determines the number of errors in the codeword. If the number of errors is more than the maximum number of errors that the ECC decoder can correct, the method generates modified codewords, calculates a corrective effect of a modified codeword, and determines a decoded codeword based on the corrective effect. | 11-15-2012 |
20120307389 | TRACK-DEPENDENT DATA RANDOMIZATION MITIGATING FALSE VFO DETECTION - A method for randomizing data to mitigate false VFO detection is described. In one embodiment, such a method includes simultaneously receiving multiple input data streams. Each input data stream is associated with a different track on a magnetic tape medium. The input data streams are simultaneously scrambled to produce multiple randomized data streams. The input data streams are scrambled such that different bit patterns are produced in the randomized data streams even where corresponding bit patterns in the input data streams are identical. The randomized data streams are simultaneously written to their associated data tracks on the magnetic tape medium. | 12-06-2012 |
20120307393 | TRACK-DEPENDENT DATA RANDOMIZATION MITIGATING FALSE VFO DETECTION - A method for randomizing data to mitigate false VFO detection is described. In one embodiment, such a method includes simultaneously receiving multiple input data streams. Each input data stream is associated with a different track on a magnetic tape medium. The input data streams are simultaneously scrambled to produce multiple randomized data streams. The input data streams are scrambled such that different bit patterns are produced in the randomized data streams even where corresponding bit patterns in the input data streams are identical. The randomized data streams are simultaneously written to their associated data tracks on the magnetic tape medium. A corresponding apparatus is also described. | 12-06-2012 |
20130013974 | DATA ENCODING IN SOLID STATE STORAGE DEVICES - Methods and apparatus are provided for encoding input data for recording in s-level storage of a solid state storage device, where s f 2. Input data words are encoded in groups of M input data words in accordance with first and second BCH codes to produce, for each group, a set of M first codewords of the first BCH code. The set of M first codewords is produced such that at least one predetermined linear combination of the M first codewords produces a second codeword of the second BCH code, this second BCH code being a sub-code of the first BCH code. The sets of M first codewords are then recorded in the s-level storage. If each of the first and second codewords comprises N q-ary symbols where q=p | 01-10-2013 |
20130013980 | Data Management in Solid State Storage Devices - A mechanism is provided for controlling a solid state storage device in which the solid state storage comprises erasable blocks each comprising a plurality of data write locations. Input data is stored in successive groups of data write locations, each group comprising write locations in a set of erasable blocks in each of a plurality of logical subdivisions of the solid state storage. The input data is error correction encoded such that each group contains an error correction code for the input data in that group. Metadata, indicating the location of input data in the solid state storage, is maintained in memory. An indication of validity of data stored in each data write location is also maintained. Prior to erasing a block, valid input data is recovered from the or each said group containing write locations in that block. The recovered data is then re-stored as new input data. | 01-10-2013 |
20130107393 | LONGITUDINAL POSITION INFORMATION ON A MAGNETIC TAPE MEDIA | 05-02-2013 |
20130166827 | WEAR-LEVEL OF CELLS/PAGES/SUB-PAGES/BLOCKS OF A MEMORY - The invention is directed to a method for wear-leveling cells or pages or sub-pages or blocks of a memory such as a flash memory, the method comprising:—receiving (S | 06-27-2013 |
20130169453 | GENERATING A CODE ALPHABET OF SYMBOLS TO GENERATE CODEWORDS FOR WORDS USED WITH A PROGRAM - Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet is generated having a first number of symbols that provide variable length codings of the words. The symbols in the first code alphabet are merged into a second number of groups of the symbols in the first code alphabet, where the second number is less than the first number. A second code alphabet is generated having the second number of symbols, wherein a second average codeword length of the codewords produced using the symbols in the second code alphabet is smaller than the codeword length (b) of the words, and wherein the second code alphabet comprises the code alphabet used by the deployed program. | 07-04-2013 |
20130279040 | COMBINED SOFT DETECTION/SOFT DECODING IN TAPE DRIVE STORAGE CHANNELS - In one embodiment, a tape drive system includes a soft detector for executing a first forward loop of a detection algorithm on a first block of signal samples during a first time interval; and logic for executing forward and reverse loops during several time intervals; and logic adapted for outputting a first decoded block of signal samples based on the executing the decoding algorithm on the first block during a sixth time interval, wherein a sum of second, third, fourth, fifth, and sixth time intervals are about equal in duration to the first time interval. | 10-24-2013 |
20130283127 | COMBINED SOFT DETECTION/SOFT DECODING IN TAPE DRIVE STORAGE CHANNELS - In one embodiment, a method includes executing a first forward loop of a detection algorithm on a block of signal samples during a first time interval, executing a first reverse loop of the detection algorithm on the block during a second time interval to produce first soft information, executing a decoding algorithm on the block during a third time interval using the first soft information to produce second soft information, executing a second forward loop of the detection algorithm on the block during a fourth time interval using the second soft information, executing a second reverse loop of the detection algorithm on the block during a fifth time interval to produce third soft information, executing the decoding algorithm on the block during a sixth time interval using the third soft information to produce a decoded block of signal samples, and outputting the decoded block of signal samples. | 10-24-2013 |
20130326305 | DATA FORMAT USING AN EFFICIENT REVERSE CONCATENATED MODULATION CODE FOR MAGNETIC TAPE RECORDING - In one embodiment, a tape drive system includes a write channel for writing data to a magnetic tape, the write channel utilizing a rate-(232/234) reverse concatenated modulation code. The write channel includes logic adapted for receiving a data stream comprising one or more data sets, logic adapted for separating each data set into a plurality of sub data sets, logic adapted for encoding each sub data set with a C2 encoding, logic adapted for encoding each C2-encoded sub data set with a modulation code, logic adapted for encoding each modulated sub data set with a C1 encoding, and logic adapted for simultaneously writing the encoded modulated sub data sets to data tracks of the magnetic tape. Other systems for writing data to a magnetic tape utilizing a rate-(232/234) reverse concatenated modulation code are described according to various other embodiments. | 12-05-2013 |
20130326306 | PARTIAL REVERSE CONCATENATION FOR DATA STORAGE DEVICES USING COMPOSITE CODES - In one embodiment, a data storage system includes a write channel for writing data to a storage medium, the write channel configured to utilize a partial reverse concatenated modulation code. The write channel includes logic adapted for encoding data sets using a C2 encoding scheme, logic adapted for adding a header to each subunit of the data sets, logic adapted for encoding the headers of the data sets with a first modulation encoding scheme, logic adapted for encoding data portions of the data sets with a second modulation encoding scheme, logic adapted for encoding portions of the one or more C2-encoded data sets using a C1 encoding scheme, logic adapted for combining the C1-encoded portions with the modulation-encoded headers of the C2-encoded data sets using a multiplexer, and logic adapted for writing the one or more combined C1- and C2-encoded data sets to data tracks. | 12-05-2013 |
20130326307 | METHODS FOR PARTIAL REVERSE CONCATENATION FOR DATA STORAGE DEVICES USING COMPOSITE CODES - In one embodiment, a method includes writing data to a storage medium of a data storage system using a partial reverse concatenated modulation code by encoding data sets using a C2 encoding scheme, adding a header to each subunit of the data sets, encoding the headers of the data sets with a first modulation encoding scheme, encoding data portions of the data sets with a second modulation encoding scheme, encoding portions of the one or more C2-encoded data sets using a C1 encoding scheme, combining the C1-encoded portions with the modulation-encoded headers of the C2-encoded data sets using a multiplexer, and writing the one or more combined C1- and C2-encoded data sets to data tracks of the storage medium. Other methods for writing data to a storage medium of a data storage system using a partial reverse concatenated modulation code are presented according to more embodiments. | 12-05-2013 |
20130326311 | MAGNETIC TAPE RECORDING IN DATA FORMAT USING AN EFFICIENT REVERSE CONCATENATED MODULATION CODE - In one embodiment, a method for writing data to a magnetic tape utilizing a rate-(232/234) reverse concatenated modulation code includes receiving a data stream comprising one or more data sets, separating each data set into a plurality of sub data sets, encoding each sub data set with a C2 encoding, encoding each C2-encoded sub data set with the modulation code, encoding each modulated sub data set with a C1 encoding, and simultaneously writing the encoded modulated sub data sets to data tracks of the magnetic tape. Other methods for writing data to a magnetic tape utilizing a rate-(232/234) reverse concatenated modulation code are described according to various other embodiments. | 12-05-2013 |
20130342374 | GENERATING A CODE ALPHABET OF SYMBOLS TO GENERATE CODEWORDS FOR WORDS USED WITH A PROGRAM - Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet has a first number of symbols that provide variable length codings of the words. A second code alphabet is generated having a second number of symbols formed by merging the symbols in the first code alphabet, wherein the second code alphabet comprises the code alphabet used by the deployed program. | 12-26-2013 |
20130346823 | ENCODING OF DATA FOR TRANSMISSION - A data encoding method for encoding a sequence of N input blocks of bits into an output block for transmission includes adding an L-bit control indicator, indicating whether the sequence contains any control blocks, and if so, producing an output block in which the order of data and control blocks is preserved by deleting a set of bits from the block-type field of at least one control block, adding to the sequence an N-bit position indicator indicating positions of data and control blocks in the sequence, and providing in bit positions of remaining bits of the block-type field of the at least one control block an indication of the type of that control block; wherein the position indicator bits are added at bit-positions such that, in a header-first transmission order of the output block, all data and control blocks succeed the position indicator bits indicating positions of those blocks. | 12-26-2013 |
20140036383 | WRITING DATA TO TAPE STORAGE MEDIUM - A method for writing data to a tape storage medium includes: writing first user data to a first physical region ( | 02-06-2014 |
20140085114 | MODULATION ENCODING AND DECODING - A method for producing N-bit output words of RLL-encoded data having both a global constraint G | 03-27-2014 |
20140108881 | BLOCK-INTERLEAVED AND ERROR CORRECTION CODE (ECC)-ENCODED SUB DATA SET (SDS) FORMAT - In one embodiment, a system for encoding data includes logic adapted for receiving data having one or more sub data sets, a C1 encoder module adapted for generating a plurality of C1 codewords during C1 ECC encoding of the one or more sub data sets, logic adapted for interleaving the plurality of C1 codewords into C1 codeword interleaves (CWIs), each CWI having a predetermined number of C1 codewords interleaved therein, a C2 encoder module adapted for generating a plurality of C2 codewords during C2 ECC encoding of the one or more sub data sets, wherein each C2 codeword has at most one symbol from each C1 codeword in each CWI, and wherein each C2 codeword has one symbol from at least two different C1 codewords in each CWI, and logic adapted for writing the one or more encoded sub data sets to a storage medium. | 04-17-2014 |
20140189461 | UNEQUAL ERROR PROTECTION SCHEME FOR HEADERIZED SUB DATA SETS - In one embodiment, a method includes receiving a headerized SDS protected by unequal error protection; decoding a header from the headerized SDS and removing an impact of the header from C1 row parity to obtain a SDS; for a number of iterations: performing C2 column decoding, for no more than a number of interleaves in each row of the SDS: overwriting a number of columns with successfully decoded C2 codewords, erasing a number of C2 codewords, and maintaining remaining columns as uncorrected, performing C1 row decoding; for no more than a number of interleaves in each row of the SDS: overwriting a number of rows with successfully decoded C1 codewords, erasing a number of C1 codewords, and maintaining remaining rows as uncorrected; and outputting the SDS when all rows include only C1 codewords and all columns include only C2 codewords; otherwise, outputting indication that the SDS cannot be decoded properly. | 07-03-2014 |
20140281830 | DATA ENCODING AND DECODING - A data encoding method includes receiving a sequence of N scrambled blocks produced by scrambling a sequence of N preliminary blocks comprising one of a data block and a control block, the control block being one of K types and including a block-type field, each scrambled block having a block header indicating a scrambled data block or a scrambled control block; encoding the sequence of N scrambled blocks into an encoded block by deleting the block headers, and in the event the sequence contains any scrambled control blocks, deleting a set of scrambled bits corresponding to respective block-type field bits of at least one control block in the sequence of preliminary blocks such that the other block-type field bits are sufficient to indicate the type of control block, and adding position indicator bits indicating position of each scrambled control block in the received sequence of scrambled blocks. | 09-18-2014 |
20140347762 | COMBINED SOFT DETECTION/SOFT DECODING IN TAPE DRIVE STORAGE CHANNELS - In one embodiment, a tape drive system includes a soft detector having logic configured to execute a first forward loop of a detection algorithm on a first block of signal samples during a first time interval, execute a first reverse loop of the detection algorithm on the first block of signal samples during a second time interval, execute a second reverse loop of the detection algorithm on the first block of signal samples during a fifth time interval, and execute a second forward loop of the detection algorithm on the first block of signal samples during a fourth time interval using second soft information. Other tape drive systems and computer program products for decoding data are presented in more embodiments. | 11-27-2014 |
20140355147 | CYCLE-SLIP RESILIENT ITERATIVE DATA STORAGE READ CHANNEL ARCHITECTURE - According to one embodiment, a magnetic medium's readback signal samples are processed iteratively to provide a slip-resistant read channel by feeding the decoder output decisions back to the read channel front end where they are used to drive the decision-aided digital signal processing functions and control loops. Since data decisions provided by the decoder are typically more reliable than those provided by the detector, a significant performance improvement is obtained. A more reliable operation of the digital front-end signal processing functions in turn allows improvements to the reliability of the decoded data. Usage of Error Correcting Code (ECC) schemes that are soft decodable makes the read channel technique, described according to various embodiments herein, particularly efficient. | 12-04-2014 |
20140355149 | ITERATIVE DATA STORAGE READ CHANNEL ARCHITECTURE HAVING DROPOUT MITIGATION - According to one embodiment, a magnetic medium's readback signal samples are processed iteratively to provide dropout mitigation for a read channel by feeding the decoder output decisions back to the read channel front end where they are used to drive the decision-aided digital signal processing functions and control loops. Since data decisions provided by the decoder are typically more reliable than those provided by the detector, a significant performance improvement is obtained. A more reliable operation of the digital front-end signal processing functions in turn allows improvements to the reliability of the decoded data. Usage of Error Correcting Code (ECC) schemes that are soft decodable makes the read channel technique, described according to various embodiments herein, particularly efficient. | 12-04-2014 |
20140355151 | TAPE HEADER PROTECTION SCHEME FOR USE IN A TAPE STORAGE SUBSYSTEM - In one embodiment, a system for integrating data and header protection in tape recording includes a processor and logic adapted to: provide a data array organized in rows and columns, each row of the data array including four interleaved C1 codewords (CWI-4), add a header to each row of the data array, each header including a CWI-4 Designation (CWID) which indicates a location of the CWI-4 within the data array, calculate ECC parity for at least one C1 codeword in each of the headerized rows, and modify the headerized rows to include the ECC parity, wherein each modified row includes four interleaved codewords, at least one codeword being a C1′ codeword which includes ECC parity for a data portion of a C1 codeword and a portion of a header, wherein none of the CWIDs are split across multiple C1′ codewords in a single modified row. | 12-04-2014 |
20140358871 | DEDUPLICATION FOR A STORAGE SYSTEM - A method and system for deduplication of data to be stored on a storage system. A deduplication system performs a method that includes the steps of: segmenting a storage object into a plurality of data segments; generating a content similarity key indicative of a content of a data segment as well as associating a physical position on the storage medium for the data segment with the generated content similarity key; storing the association in deduplication index information; and using the stored associations for optimizing the deduplication. | 12-04-2014 |
20140359396 | ITERATIVE DATA STORAGE READ CHANNEL ARCHITECTURE - In one embodiment, a method for iterative read channel operation includes executing digital front-end (DFE) functions on signal samples employing decisions provided by a detector executing a detection algorithm, executing an error correcting code (ECC) decoding algorithm on the signal samples using a decoder employing the decisions provided by the detector to generate decisions provided by the decoder, storing the signal samples and the decisions provided by the detector and the decoder, and in an iterative process: executing the DFE functions on the signal samples employing the decisions provided by the decoder, executing the detection algorithm on the signal samples using the detector employing the decisions provided by the decoder to regenerate the decisions provided by the detector, executing the decoding algorithm using the decisions provided by the detector to regenerate the decisions provided by the decoder, and outputting decoding information when the decoding algorithm produces a valid codeword. | 12-04-2014 |
20140380118 | UNEQUAL ERROR PROTECTION SCHEME FOR HEADERIZED SUB DATA SETS - A method for decoding a headerized sub data set (SDS) according to one embodiment includes decoding a header from a headerized SDS to obtain a SDS. C1 and C2 decoding are performed on the SDS in a number of iterations based on a number of interleaves in each row of the SDS. A number of columns of the SDS are overwritten with successfully decoded C2 codewords. A number of rows of the SDS are overwritten with successfully decoded C1 codewords. A number of C1 and/or C2 codewords of the SDS are erased. Remaining rows and/or columns of the SDS are maintained as uncorrected. The SDS is output when all rows of the SDS include only C1 codewords and all columns of the SDS include only C2 codewords. | 12-25-2014 |
20150015982 | OPTIMUM TAPE LAYOUT SELECTION FOR IMPROVED ERROR CORRECTION CAPABILITY - According to one embodiment, a system for selecting an optimum tape layout to store data on a tape medium may include a processor and logic integrated with and/or executable by the processor, the logic being configured to: select a family of data set layouts based on parameters associated with at least a tape drive and the tape medium, compute a set of all minimum distances for the selected family of data set layouts, calculate a first performance metric associated with each possible set of parameters, select a best first performance metric from all calculated first performance metrics and store a set of parameters associated with the best first performance metric, and select a data set layout algorithm which utilizes the set of parameters associated with the best first performance metric, wherein the data set layout algorithm and a rewrite layout algorithm combine to form an optimum tape layout. | 01-15-2015 |
20150046767 | COMBINATION ERROR AND ERASURE DECODING FOR PRODUCT CODES - In one embodiment, a system for combination error and erasure decoding for product codes includes a processor and logic integrated with and/or executable by the processor, the logic being configured to receive captured data, generate erasure flags for the captured data and provide the erasure flags to a C2 decoder, set a stop parameter to be equal to a length of C1 codewords in a codeword interleave used to encode the captured data, and selectively perform, in an iterative process, error or erasure C1 decoding followed by error or erasure C2 decoding until decoding is successful or unsuccessful. In more embodiments, a method and/or a computer program product may be used for combination error and erasure decoding for product codes. | 02-12-2015 |
20150058696 | TAPE HEADER FORMAT HAVING EFFICIENT AND ROBUST CODEWORD INTERLEAVE DESIGNATION (CWID) PROTECTION - In one embodiment, a system for providing header protection in magnetic tape recording is adapted to write a codeword interleave (CWI) set on a magnetic tape including a plurality of CWIs equal to a number of tracks, wherein a data set includes a plurality of CWI sets, provide a CWI set header for the CWI set, the CWI set header including a CWI header for each CWI in the CWI set, each CWI header including at least a CWI Designation (CWID) which indicates a location of the CWI within the data set, calculate or obtain CWID parity for all CWIDs in the CWI set header, the CWID parity including error correction coding (ECC) parity, and store the CWID parity to one or more fields which are repeated for each CWI header in the CWI set header without using reserved bits in the CWI set header to store the CWID parity. | 02-26-2015 |
20150085393 | TAPE HEADER PROTECTION SCHEME FOR USE IN A TAPE STORAGE SUBSYSTEM - In one embodiment, a system for integrating data and header protection includes a processor and logic integrated with and/or executable by the processor, the logic being configured to receive a data array organized in rows and columns, each row of the data array comprising two or more interleaved C1 codewords (CWI), and modify one or more rows of the data array to include a header and error correction code (ECC) parity to form one or more modified rows, wherein each modified row includes two or more interleaved codewords, at least one codeword being a C1′ codeword which includes ECC parity, wherein each header comprises a CWI Designation (CWID) which indicates a location of the CWI within the data array, and wherein none of the CWIDs are split across multiple C1′ codewords in a single modified row. Other systems, methods, and computer program products are presented in additional embodiments. | 03-26-2015 |