# Patent

## Title
Systems and methods for parity shared data encoding

## Abstract

Various embodiments of the present invention provide systems and methods for data processing. For example, a low density parity check encoding system is described that includes: a low density parity check encoder circuit, and a combining circuit. The low density parity check encoder circuit is operable to encode a first data set to yield a first low density parity check encoded sub-codeword, and to encode a second data set to yield a second low density parity check encoded sub-codeword. The combining circuit is operable to: generate a composite low density parity check sub-codeword by mathematically combining at least the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword; and combine at least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into an overall codeword.

## Background
BACKGROUND OF THE INVENTION
The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for data decoding.
Various storage systems include data processing circuitry implemented with a data decoding circuit. In some cases, the data decoding circuit operates on a very large codeword that includes a number of parity bits. It is an advantage to use increasingly large codewords to achieve increased data processing performance. However, such large codewords require large and complex data decoding circuits. Such large and complex data decoding circuits require significant die area and power. One approach to dealing with this situation is to make a very large codeword out of a number of smaller codewords that are concatenated together. Such smaller codewords allow for reducing the size and power required by the data decoding circuit, but come with a corresponding reduction in processing performance.
Hence, for at least the aforementioned reasons, there exists a need in the art for advanced systems and methods for data processing.
BRIEF SUMMARY OF THE INVENTION
The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for data decoding.
Various embodiments of the present invention provide low density parity check encoding systems. Such encoding systems include: a low density parity check encoder circuit, and a combining circuit. The low density parity check encoder circuit is operable to encode a first data set to yield a first low density parity check encoded sub-codeword, and to encode a second data set to yield a second low density parity check encoded sub-codeword. The combining circuit is operable to: generate a composite low density parity check sub-codeword by mathematically combining at least the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword; and combine at least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into an overall codeword.
In some instances of the aforementioned embodiments, generating the composite low density parity check sub-codeword includes performing a mod 2 mathematical process on a bit by bit basis of the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword to yield the composite low density parity check sub-codeword. In various instances of the aforementioned embodiments, mathematically combining at least the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword to yields a valid low density parity check codeword. In one or more instances of the aforementioned embodiments, the composite low density parity check sub-codeword, the first low density parity check encoded sub-codeword, and the second low density parity check encoded sub-codeword are all decodable using the same low density parity check decoding algorithm.
Other embodiments of the present invention provide methods for encoding data. The methods include: encoding a first data set using a low density parity check encoding algorithm to yield a first low density parity check encoded sub-codeword; encoding a second data set using a low density parity check encoding algorithm to yield a second low density parity check encoded sub-codeword; mathematically calculating a composite low density parity check sub-codeword based at least in part on the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword; and combining at least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into an overall codeword. In some cases, mathematically calculating the composite low density parity check sub-codeword includes performing mod 2 combination on a bit by bit basis of the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword. In various cases, mathematically calculating the composite low density parity check sub-codeword yields a valid low density parity check codeword. In one or more cases, the composite low density parity check sub-codeword, the first low density parity check encoded sub-codeword, and the second low density parity check encoded sub-codeword are all decodable using the same low density parity check decoding algorithm.
Various embodiments of the present invention provide data processing systems that include a data detector circuit, a data decoder circuit, and a processing circuit. The data detector circuit is operable to apply a data detection algorithm to a data set to yield a detected output. The data set includes at least a first encoded sub-codeword and a composite sub-codeword. The data decoder circuit is operable to apply a data decode algorithm to the encoded sub-codeword to yield a first decoded output, and to apply the data decode algorithm to the composite sub-codeword to yield a second decoded output. The processing circuit is operable to: reconstitute a second encoded sub-codeword from a combination of data including the first encoded sub-codeword and the composite sub-codeword; and correct an error in one of the first encoded sub-codeword and the second encoded sub-codeword based at least in part on a combination of the first encoded sub-codeword, the second encoded sub-codeword, and the composite sub-codeword.
In some instances of the aforementioned embodiments, the data processing system is implemented as part of a storage device or a receiving device. In some cases, the storage device is a disk based storage device. In other cases, the storage device is a solid state storage device. In various instances of the aforementioned embodiments, the data processing system is implemented as part of an integrated circuit. In one or more instances of the aforementioned embodiments the data detection algorithm is a maximum a posteriori data detection algorithm. In other instances, the data detection algorithm is a Viterbi detection algorithm. In some instances of the aforementioned embodiments, the data decode algorithm is a low density parity check algorithm.
In some instances of the aforementioned embodiments, the composite codeword is a mathematical combination of at least the first encoded sub-codeword and the second encoded sub-codeword. In particular instances of the aforementioned embodiments, the composite codeword is a mod 2 combination of at least the first encoded sub-codeword and the second encoded sub-codeword. In some cases, reconstituting the second encoded sub-codeword from the combination of data including the first encoded sub-codeword and the composite sub-codeword includes reversing the mathematical combination of at least the first encoded sub-codeword and the second encoded sub-codeword. In particular cases, correcting the error in one of the first encoded sub-codeword and the second encoded sub-codeword based at least in part on a combination of the first encoded sub-codeword, the second encoded sub-codeword, and the composite sub-codeword includes modifying an element of one of the first encoded sub-codeword and the second encoded sub-codeword such that the mathematical combination of at least the first encoded sub-codeword and the second encoded sub-codeword yields a correct mathematical relationship. In some cases, the data decoder circuit includes: a first decode circuit operable to apply the data decode algorithm to the encoded sub-codeword to yield the first decoded output, and a second decode circuit operable to apply the data decode algorithm to the composite sub-codeword to yield the second decoded output. In other cases, the data decoder circuit includes a decode circuit that is operable to apply the data decode algorithm to the encoded sub-codeword to yield the first decoded output during a first time period, and apply the data decode algorithm to the composite sub-codeword to yield the second decoded output during a second time period.
Other embodiments of the present invention provide methods for data processing. The methods include receiving a data set that includes at least a first encoded sub-codeword and a composite sub-codeword. A data detection algorithm is performed by a data detector circuit on the data set to yield a detected output. A data decode algorithm is performed on a second data set derived from the detected output to yield a first decoded output corresponding to the first encoded sub-codeword, and the data decode algorithm is performed on a third data set derived from the detected output to yield a second decoded output corresponding to the composite sub-codeword. A second encoded sub-codeword is reconstituted from a combination of data including the second decoded output and the first decoded output, and an error in one of the first decoded output and the second decoded output is corrected based at least in part on a combination of the first encoded sub-codeword, the second encoded sub-codeword, and the composite sub-codeword. In some cases, the composite codeword is a mathematical combination of at least the first encoded sub-codeword and the second encoded sub-codeword. In various cases, reconstituting the second encoded sub-codeword from the combination of data including the second decoded output and the first decoded output includes reversing the mathematical combination of at least the first encoded sub-codeword and the second encoded sub-codeword. In some such cases, correcting the error in one of the first decoded output and the second decoded output based at least in part on the combination of the first encoded sub-codeword, the second encoded sub-codeword, and the composite sub-codeword includes modifying an element of one of the first encoded sub-codeword and the second encoded sub-codeword such that the mathematical combination of at least the first encoded sub-codeword and the second encoded sub-codeword yields a correct mathematical relationship.
This summary provides only a general outline of some embodiments of the invention. Many other objects, features, advantages and other embodiments of the invention will become more fully apparent from the following detailed description, the appended claims and the accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
A further understanding of the various embodiments of the present invention may be realized by reference to the figures which are described in remaining portions of the specification. In the figures, like reference numerals are used throughout several figures to refer to similar components. In some instances, a sub-label consisting of a lower case letter is associated with a reference numeral to denote one of multiple similar components. When reference is made to a reference numeral without specification to an existing sub-label, it is intended to refer to all such multiple similar components.
FIG. 1 shows a data processing circuit including a shared parity data decoding circuit in accordance with one or more embodiments of the present invention;
FIG. 2 graphically depicts a process for generating a shared parity codeword that may be used in relation to embodiments of the present invention;
FIG. 3 shows a disk based storage device including a read channel having shared parity data decoding circuitry in accordance with one or more embodiments of the present invention;
FIG. 4 shows a solid state storage device including a flash access controller having shared parity data decoding circuitry in accordance with one or more embodiments of the present invention;
FIG. 5 shows a data transmission system including a receiver having shared parity data decoding circuitry in accordance with some embodiments of the present invention;
FIG. 6 is a flow diagram showing method for shared parity codeword processing in accordance with various embodiments of the present invention;
FIG. 7 depicts a shared parity codeword encoding circuit in accordance with some embodiments of the present invention; and
FIG. 8 is a flow diagram showing method for encoding shared parity codewords in accordance with one or more embodiments of the present invention.



DETAILED DESCRIPTION OF THE INVENTION
The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for data decoding.
Various embodiments of the present invention provide systems and methods for data processing. Such systems and methods rely on an overall codeword that shares parity between a number of sub-codewords. Such an approach allows for enhanced data processing performance where the error correction power of the overall codeword is greater than any one sub-codeword, while allowing for reduced circuit size and power. In some embodiments of the present invention, shared parity codewords are created by aggregating a number of sub-codewords, and encoding one of the number of sub-codewords to include parity that represents processing across multiple sub-codewords. Where data decoding of one or more sub-codewords fails to converge, the sub-codeword incorporating parity from across the sub-codewords may be used to regenerate the otherwise non-converging sub-codeword. In some cases, two or more sub-code-words may be processed by a common data decoder circuit in a time sharing approach that further reduces circuit size.
Turning to FIG. 1, a data processing circuit 100 is shown that includes a shared parity data decoding circuit 170 that is operable to decode shared parity codewords in accordance with one or more embodiments of the present invention. Data processing circuit 100 includes an analog front end circuit 110 that receives an analog signal 105. Analog front end circuit 110 processes analog signal 105 and provides a processed analog signal 112 to an analog to digital converter circuit 114. Analog front end circuit 110 may include, but is not limited to, an analog filter and an amplifier circuit as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of circuitry that may be included as part of analog front end circuit 110. In some cases, analog signal 105 is derived from a read/write head assembly (not shown) that is disposed in relation to a storage medium (not shown). In other cases, analog signal 105 is derived from a receiver circuit (not shown) that is operable to receive a signal from a transmission medium (not shown). The transmission medium may be wired or wireless. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of source from which analog input 105 may be derived.
Analog to digital converter circuit 114 converts processed analog signal 112 into a corresponding series of digital samples 116. Analog to digital converter circuit 114 may be any circuit known in the art that is capable of producing digital samples corresponding to an analog input signal. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of analog to digital converter circuits that may be used in relation to different embodiments of the present invention. Digital samples 116 are provided to an equalizer circuit 120. Equalizer circuit 120 applies an equalization algorithm to digital samples 116 to yield an equalized output 125. In some embodiments of the present invention, equalizer circuit 120 is a digital finite impulse response filter circuit as are known in the art. In some cases, equalizer 120 includes sufficient memory to maintain one or more codewords until a data detector circuit 130 is available for processing. It may be possible that equalized output 125 may be received directly from a storage device in, for example, a solid state storage system. In such cases, analog front end circuit 110, analog to digital converter circuit 114 and equalizer circuit 120 may be eliminated where the data is received as a digital data input.
Data detector circuit 130 is operable to apply a data detection algorithm to a received codeword or data set, and in some cases data detector circuit 130 can process two or more codewords in parallel. In some embodiments of the present invention, data detector circuit 130 is a Viterbi algorithm data detector circuit as are known in the art. In other embodiments of the present invention, data detector circuit 130 is a maximum a posteriori data detector circuit as are known in the art. Of note, the general phrases “Viterbi data detection algorithm” or “Viterbi algorithm data detector circuit” are used in their broadest sense to mean any Viterbi detection algorithm or Viterbi algorithm detector circuit or variations thereof including, but not limited to, bi-direction Viterbi detection algorithm or bi-direction Viterbi algorithm detector circuit. Also, the general phrases “maximum a posteriori data detection algorithm” or “maximum a posteriori data detector circuit” are used in their broadest sense to mean any maximum a posteriori detection algorithm or detector circuit or variations thereof including, but not limited to, simplified maximum a posteriori data detection algorithm and a max-log maximum a posteriori data detection algorithm, or corresponding detector circuits. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of data detector circuits that may be used in relation to different embodiments of the present invention. Data detector circuit 130 is started based upon availability of a data set from equalizer circuit 120 or from a central memory circuit 150.
Upon completion, data detector circuit 130 provides detector output 196. Detector output 196 includes soft data. As used herein, the phrase “soft data” is used in its broadest sense to mean reliability data with each instance of the reliability data indicating a likelihood that a corresponding bit position or group of bit positions has been correctly detected. In some embodiments of the present invention, the soft data or reliability data is log likelihood ratio data as is known in the art. Detected output 196 is provided to a local interleaver circuit 142. Local interleaver circuit 142 is operable to shuffle sub-portions (i.e., local chunks) of the data set included as detected output and provides an interleaved codeword 146 that is stored to central memory circuit 150. Interleaver circuit 142 may be any circuit known in the art that is capable of shuffling data sets to yield a re-arranged data set. Interleaved codeword 146 is stored to central memory circuit 150. Interleaved codeword 146 is comprised of a number of encoded sub-codewords designed to reduce the complexity of a downstream data decoder circuit while maintaining reasonable processing ability. An example of such a codeword comprised of encoded sub-codewords is discussed in relation to FIG. 2.
Turning to FIG. 2, a graphical depiction 200 of a process for generating a shared parity codeword that may be used in relation to embodiments of the present invention. Graphical depiction 200 shows a 4 Kb codeword formed of a number of encoded sub-codewords 205, 210, 215. It should be noted that the codeword is merely an example, and that a codeword greater than or less than 4 Kb may be used and the codeword may be broken into more or fewer than the three shown encoded sub-codewords. In some cases, the encoded sub-codewords are encoded using low density parity check (LDPC) encoding as is known in the art.
Encoded sub-codewords 205, 210, 215 are each constructed by encoding a portion of user data such that each of sub-codewords include parity bits calculated during the encoding process that are calculated based upon the portion of user data represented by the respective sub-codeword. The parity check matrix,




  
    [
    
      
        
          
            H
            ⁢
            
              
            
            ⁢
            1
          
        
      
      
        
          
            H
            ⁢
            
              
            
            ⁢
            2
          
        
      
    
    ]
  
  ,




may be designed such that H2=φ, and sub-codeword 205 and sub-codeword 215 are the same code. Since sub-codeword 205 and sub-codeword 215 have a similar parity check matrix part as H1, the encoding of encoded sub-codeword 205, encoded sub-codeword 210, and encoded sub-codeword 215 can be simplified as portions of the circuitry can be shared. The encoding may not limit to this simple example (H1 and H2), but rather can be anything which can construct different correction power low density parity check codes as component codewords.

Prior to transferring encoded sub-codewords to a storage medium or via another transfer medium, encoded sub-codeword 205, encoded sub-codeword 210 and encoded sub-codeword 215 are mathematically combined to yield a composite encoded sub-codeword 220. In one particular embodiment of the present invention, the mathematical combination is a mod 2 operation. In such a case, encoded sub-codeword 205 is combined on an element by element basis using a mod 2 process to yield an interim codeword. The interim codeword is then combined on an element by element basis with encoded sub-codeword 215 using a mod 2 process to yield composite encoded sub-codeword 220. Of note, combining two or more encoded sub-codewords in such a way yields a valid encoded codeword that incorporates parity related to information from more than one encoded sub-codeword. Once the combining is completed, the encoded sub-codewords are combined to yield an overall codeword 250 where encoded sub-codeword 215 is replaced by composite encoded sub-codeword 220. Overall codeword 250 is then transferred to a storage medium or other transfer medium. Overall codeword 250 has the advantage that it may be processed on a sub-codeword basis, but because it includes composite encoded sub-codeword 220 with parity representing information from a number of encoded sub-codewords, increased processing performance is achievable when compared with encoded sub-codewords 205, 210, 215 being processed separately.
Returning to FIG. 1, once shared parity data decoding circuit 170 is available, a previously stored interleaved codeword 146 is accessed from central memory circuit 150 as a stored codeword 186 and globally interleaved by a global interleaver/de-interleaver circuit 184. Global interleaver/De-interleaver circuit 184 may be any circuit known in the art that is capable of globally rearranging codewords. Global interleaver/De-interleaver circuit 184 provides a decoder input 152. As described more fully below, decoder input 152 includes a number of sub-codewords that each include parity with at least one of the sub-codewords including parity that incorporates information from multiple sub-codewords. Each of the sub-codewords is provided to a respective one of a subset decoder circuit 162, a subset decoder circuit 164 and a subset decoder circuit 166 incorporated within shared parity data decoding circuit 170. Each of subset decoder circuit 162, subset decoder circuit 164 and subset decoder circuit 166 is operable to apply a data decode algorithm to the respective sub-codeword. Subset decoder circuit 162 provides a sub-decoded output 163; subset decoder circuit 164 provides a sub-decoded output 165; and subset decoder circuit 166 provides a sub-decoded output 167. In some embodiments of the present invention, the data decode algorithm is a low density parity check algorithm as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize other decode algorithms that may be used in relation to different embodiments of the present invention. It should be noted that while shared parity data decoding circuit 170 is shown with three separate subset decoder circuits 162, 164, 166, it is not required to have physically distinct subset decoder circuits. Rather, tie sharing can be used within a smaller number of decoder circuits to simplify circuit design and further reduce circuit area. For example, a single subset decoder circuit may be employed that: (1) processes encoded sub-codeword 205 by performing a partial codeword check to variable node update or variable node to check node during a first time slot, (3) processes encoded sub-codeword 210 by performing a partial codeword check to variable node update or variable node to check node during a second time slot, and (3) processes composite encoded sub-codeword 220 by performing a partial codeword check to variable node update or variable node to check node during a third time slot, and so on.
Each of subset decoder circuits 162, 164, 166 operates on a smaller codeword (e.g., one of encoded sub-codeword 205, encoded sub-codeword 210 or composite encoded sub-codeword 220) than it would be operating on if the respective circuit processed a unified codeword including all of the encoded sub-codewords. Because of this, the aggregate size and power requirements of subset decoder circuits 162, 164, 166 is less than what would be required if a unified codeword including all of the sub-codewords was processed by a single data decoding circuit. It should be noted that while FIG. 1 shows three subset decoder circuits, that more than or fewer than three subset decoder circuits may be used in relation to different embodiments of the present invention.
In particular, using the example of FIG. 2, subset decoder circuit 162 receives encoded sub-codeword 205, subset decoder circuit 164 receives encoded sub-codeword 210, and subset decoder circuit 166 receives composite encoded sub-codeword 220. Of note, each of encoded sub-codeword 205, encoded sub-codeword 210, and composite encoded sub-codeword 220 includes noise introduced from various sources and represented as El for encoded sub-codeword 205, E2 for encoded sub-codeword 210, and E3 for composite encoded sub-codeword 220. Each of subset decoder circuits 162, 164, 166 applies an LDPC decoding algorithm to the received encoded sub-codeword to yield sub-decoded output 163, sub-decoded output 165, and sub-decoded output 167, respectively.
Sub-decoded output 163, sub-decoded output 165, and sub-decoded output 167 are provided to a soft data processing circuit 175 included as part of shared parity data decoding circuit 170. Soft data processing circuit 175 is operable to assemble the various sub-decoded outputs and to determine whether the respective sub-decoded outputs converged (i.e., the resulting sub-decoded output matches the originally written data set as indicated by the lack of parity errors). Where all of the sub-decoded outputs converged, soft data processing circuit 175 assembles the sub-decoded outputs into an output codeword 172. Output codeword 172 is provided to a de-interleaver circuit 180. De-interleaver circuit 180 rearranges the data to reverse both the global and local interleaving applied to the data to yield a de-interleaved output 182. De-interleaved output 182 is provided to a hard decision output circuit 190. Hard decision output circuit 190 is operable to re-order data sets that may complete out of order back into their original order. The originally ordered data sets are then provided as a hard decision output 192.
Alternatively, where one or more of the sub-decoded outputs failed to converge, soft data processing circuit 175 uses the knowledge from other sub-decoded outputs to correct any remaining errors in a given sub-decoded output. For this processing, soft data processing circuit 175 may set the soft data for the converged encoded sub-codeword to high reliability values. Such high reliability values will be used to help other encoded sub-codeword decoding and speed up the convergence of other encoded sub-codewords.
As an example, where encoded sub-codeword 205 and encoded sub-codeword 210 can be properly decoded yielding sub-decoded output 163 and sub-decoded output 165 that converge, but composite sub-codeword 220 cannot be properly decoded such that sub-decoded output 167 does not converge, the process for generating composite sub-codeword 220 discussed above in relation to FIG. 2 may be reversed to generate a corrected encoded sub-codeword 215. This operation of reversing includes using the error equation:

encoded subcodeword 215=encoded subcodeword 205+encoded subcodeword 210+composite encoded subcodeword 220+E3

to generate encoded sub-codeword 215. Subset decoder circuit 166 can then decode the following information:

encoded subcodeword 215+E3

To recover the original encoded sub-codeword 215 that is provided as sub-decoded output 167 to soft data processing circuit 175 where, if sub-decoded output 167 converged, it can be combined with the other converged sub-decoded outputs to yield output codeword 172.
Alternatively, where any remaining errors are not correctable, soft data processing circuit 175 provides the respective portions of a given sub-decode output back to a corresponding subset decoder circuit for additional processing where another local iteration is allowed. Where another local iteration is not allowed, soft data processing circuit 175 writes the sub-decoded outputs as a decoded output 154 back to central memory circuit 150 where they are stored awaiting another global iteration through data detector circuit 130 and shared parity data decoding circuit 170. Prior to storage of decoded output 154 to central memory circuit 150, decoded output 154 is globally de-interleaved to yield a globally de-interleaved output 188 that is stored to central memory circuit 150. The global de-interleaving reverses the global interleaving earlier applied to stored codeword 186 to yield decoder input 152. Once data detector circuit 130 is available, a previously stored de-interleaved output 188 is accessed from central memory circuit 150 and locally de-interleaved by a de-interleaver circuit 144. De-interleaver circuit 144 re-arranges decoder output 148 to reverse the shuffling originally performed by interleaver circuit 142. A resulting de-interleaved output 197 is provided to data detector circuit 130 where it is used to guide subsequent detection of a corresponding data set receive as equalized output 125.
In some cases, the aforementioned processing by soft data processing circuit 175 may be performed on the soft data (i.e., log-likelihood ration (LLR) information) derived from data detector circuit 130. In such a case, using the example from above, the LLR information of reconstituted encoded sub-codeword 215 (L′215) can be expressed based upon the corresponding LLR information from encoded sub-codeword 205 (L205), encoded sub-codeword 210 (L210), and composite encoded sub-codeword 220 (L220) as follows:




  
    
      L
      215
      
        ′
        ⁡
        
          (
          j
          )
        
      
    
    =
    
      
        
          L
          205
          
            (
            j
            )
          
        
        +
        
          L
          210
          
            (
            j
            )
          
        
        +
        
          L
          220
          
            (
            j
            )
          
        
        +
        
          
            L
            205
            
              (
              j
              )
            
          
          ⁢
          
            L
            210
            
              (
              j
              )
            
          
          ⁢
          
            L
            220
            
              (
              j
              )
            
          
        
      
      
        1
        +
        
          
            L
            205
            
              (
              j
              )
            
          
          ⁢
          
            L
            210
            
              (
              j
              )
            
          
        
        +
        
          
            L
            205
            
              (
              j
              )
            
          
          ⁢
          
            L
            220
            
              (
              j
              )
            
          
        
        +
        
          
            L
            215
            
              (
              j
              )
            
          
          ⁢
          
            L
            220
            
              (
              j
              )
            
          
        
      
    
  
  ,




where j is the j-th bit of encoded sub-codeword 205, encoded sub-codeword 210, encoded sub-codeword 215, and composite encoded sub-codeword 220.

The LDPC decoding may be designed to use multiple local iterations (i.e., consecutive passes through subset decoder circuits 162, 164, 166). For each local iteration, the LLR information for the j-th bit of encoded sub-codeword 205 (L205), encoded sub-codeword 210 (L210), and composite encoded sub-codeword 220 (L220) may be expressed as:



  
    
      
        L
        205
        
          (
          j
          )
        
      
      =
      
        
          
            L
            210
            
              (
              j
              )
            
          
          +
          
            L
            220
            
              (
              j
              )
            
          
          +
          
            L
            215
            
              (
              j
              )
            
          
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
        
          1
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
          
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
          +
          
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
      
    
    ,
    
      

    
    ⁢
    
      
        L
        210
        
          (
          j
          )
        
      
      =
      
        
          
            L
            205
            
              (
              j
              )
            
          
          +
          
            L
            220
            
              (
              j
              )
            
          
          +
          
            L
            215
            
              (
              j
              )
            
          
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
        
          1
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
          
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
      
    
    ,
    and
  




  
    
      L
      220
      
        (
        j
        )
      
    
    =
    
      
        
          
            L
            205
            
              (
              j
              )
            
          
          +
          
            L
            210
            
              (
              j
              )
            
          
          +
          
            L
            215
            
              ′
              ⁡
              
                (
                j
                )
              
            
          
          +
          
            
              L
              210
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
            ⁢
            
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
        
          1
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              210
              
                (
                j
                )
              
            
          
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
      
      .
    
  



Turning to FIG. 3, a disk based storage device 300 including a read channel circuit 310 having shared parity data decoding circuitry is shown in accordance with one or more embodiments of the present invention. Disk based storage system 300 may be, for example, a hard disk drive. Disk based storage system 300 also includes a preamplifier 370, an interface controller 320, a hard disk controller 366, a motor controller 368, a spindle motor 372, a disk platter 378, and a read/write head assembly 376. Interface controller 320 controls addressing and timing of data to/from disk platter 378. The data on disk platter 378 consists of groups of magnetic signals that may be detected by read/write head assembly 376 when the assembly is properly positioned over disk platter 378. In one embodiment, disk platter 378 includes magnetic signals recorded in accordance with either a longitudinal or a perpendicular recording scheme.
In a typical read operation, read/write head assembly 376 is accurately positioned by motor controller 368 over a desired data track on disk platter 378. Motor controller 368 both positions read/write head assembly 376 in relation to disk platter 378 and drives spindle motor 372 by moving read/write head assembly to the proper data track on disk platter 378 under the direction of hard disk controller 366. Spindle motor 372 spins disk platter 378 at a determined spin rate (RPMs). Once read/write head assembly 378 is positioned adjacent the proper data track, magnetic signals representing data on disk platter 378 are sensed by read/write head assembly 376 as disk platter 378 is rotated by spindle motor 372. The sensed magnetic signals are provided as a continuous, minute analog signal representative of the magnetic data on disk platter 378. This minute analog signal is transferred from read/write head assembly 376 to read channel circuit 310 via preamplifier 370. Preamplifier 370 is operable to amplify the minute analog signals accessed from disk platter 378. In turn, read channel circuit 310 decodes and digitizes the received analog signal to recreate the information originally written to disk platter 378. This data is provided as read data 303 to a receiving circuit. A write operation is substantially the opposite of the preceding read operation with write data 301 being provided to read channel circuit 310. This data is then encoded and written to disk platter 378.
During operation, data may be encoded prior to a write operation. The data encoding may be done such that a data set is encoded into multiple sub-codewords with parity in one or more of the sub-codewords being shared across a number of sub-codewords. Such encoding may be done using a circuit similar to that discussed below in relation to FIG. 7, and/or may perform the encoding using a method similar to that discussed below in relation to FIG. 8. Data read back from disk platter 378 may be decoded using a number of subset decoder circuits each operating on a respective sub-codeword. One or more of the sub-codewords may include parity that extends across multiple sub-codewords. Such sub-codeword decoding may be done using a circuit similar to that discussed above in relation to FIG. 1, and/or may be done similar to the method discussed below in relation to FIG. 6.
It should be noted that storage system may utilize SATA, SAS or other storage technologies known in the art. Also, it should be noted that storage system 300 may be integrated into a larger storage system such as, for example, a RAID (redundant array of inexpensive disks or redundant array of independent disks) based storage system. It should also be noted that various functions or blocks of storage system 400 may be implemented in either software or firmware, while other functions or blocks are implemented in hardware.
Turning to FIG. 4, a solid state storage device 400 including a flash access controller 430 having shared parity data decoding circuitry in accordance with one or more embodiments of the present invention. Solid state storage device 400 includes a solid state memory circuit 440 that includes a number of memory cells. In one particular embodiment of the present invention, solid state memory circuit 440 includes a number of FLASH memory cells as are known in the art. Flash access controller 430 includes sub-codeword encoding circuitry operable to encode an overall codeword having a number of encoded sub-codewords with at least one of the encoded sub-codewords incorporating parity information from across two or more encoded sub-codewords. Such encoding circuitry may be implemented similar to that discussed below in relation to FIG. 7 and/or may operate similar to that discussed below in relation to FIG. 8. Further, flash access controller 430 includes sub-codeword decoding circuitry operable to decode an overall codeword having a number of encoded sub-codewords with at least one of the encoded sub-codewords incorporating parity information from across two or more encoded sub-codewords. Such decoding circuitry may be implemented similar to that discussed above in relation to FIG. 1 and/or may operate similar to that discussed below in relation to FIG. 6. Decoded data is provided from flash access controller 430 to an input buffer circuit 410 where it may be accessed by a host (not shown). In addition, data to be stored to solid state memory 440 is received from a host that writes the data to n output buffer circuit 420 that in turn provides the information to flash access controller 430.
Turning to FIG. 5, a data transmission system 500 including a transceiver 520 having reliability data based tuning circuitry is shown in accordance with some embodiments of the present invention. Data transmission system 500 includes a transmitter 510 that is operable to transmit encoded information via a transfer medium 530 as is known in the art. The encoded data is received from transfer medium 530 by receiver 520. Transceiver 520 incorporates sub-codeword decoding and encoding circuitry. While processing received data, received data is converted from an analog signal to a series of corresponding digital samples, and the digital samples are equalized to yield an equalized output. The equalized output is then provided to a data processing circuit including both a data detector circuit and a data decoder circuit. Data is passed between the data decoder and data detector circuit via a central memory allowing for variation between the number of processing iterations that are applied to different data sets. It should be noted that transfer medium 530 may be any transfer medium known in the art including, but not limited to, a wireless medium, an optical medium, or a wired medium. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of transfer mediums that may be used in relation to different embodiments of the present invention. Data may be encoded by transceiver 520 for transmission to another receiver circuit (not shown).
During operation, data may be encoded prior to a transmission operation by transceiver 520. The data encoding may be done such that a data set is encoded into multiple sub-codewords with parity in one or more of the sub-codewords being shared across a number of sub-codewords. Such encoding may be done using a circuit similar to that discussed below in relation to FIG. 7, and/or may perform the encoding using a method similar to that discussed below in relation to FIG. 8. Data received from transfer medium 530 may be decoded using a number of subset decoder circuits each operating on a respective sub-codeword. One or more of the sub-codewords may include parity that extends across multiple sub-codewords. Such sub-codeword decoding may be done using a circuit similar to that discussed above in relation to FIG. 1, and/or may be done similar to the method discussed below in relation to FIG. 6.
Turning to FIG. 6, a flow diagram 600 shows a method for shared parity codeword processing in accordance with various embodiments of the present invention. Following flow diagram 600, an analog input is received (block 605). The analog input may be derived from, for example, a storage medium or a data transmission channel. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of sources of the analog input. The analog input is converted to a series of digital samples (block 610). This conversion may be done using an analog to digital converter circuit or system as are known in the art. Of note, any circuit known in the art that is capable of converting an analog signal into a series of digital values representing the received analog signal may be used. The resulting digital samples are equalized to yield an equalized output (block 615). In some embodiments of the present invention, the equalization is done using a digital finite impulse response circuit as are known in the art. Based upon the disclosure provided herein, one of ordinary skill in the art will recognize a variety of equalizer circuits that may be used in place of such a digital finite impulse response circuit to perform equalization in accordance with different embodiments of the present invention. The equalized output represents an overall codeword comprised of a number of encoded sub-codewords and at least one composite encoded sub-codeword similar to those discussed above in relation to FIG. 2. In some cases, the input may be received as a digital input. In such cases, the processes of blocks 605, 601, 615 may be eliminated.
It is determined whether a data detector circuit is available (block 620). Where a data detector circuit is available (block 620), a data detection algorithm is applied to the equalized output guided by a data set derived from a decoded output where available (e.g., the second and later iterations through the data detector circuit and the data decoder circuit) from a central memory circuit to yield a detected output (block 625). In some embodiments of the present invention, data detection algorithm is a Viterbi algorithm as are known in the art. In other embodiments of the present invention, the data detection algorithm is a maximum a posteriori data detector circuit as are known in the art. A signal derived from the detected output (e.g., a locally interleaved version of the detected output) is stored to the central memory to await processing by a data decoder circuit (block 630).
In parallel to the previously discussed data detection processing, it is determined whether a data decoder circuit is available (block 640). Where the data decoder circuit is available (block 640) a previously stored derivative of a detected output is accessed from the central memory (block 645). The accessed data set is disaggregated into one or more sub-codewords and one or more composite sub-codewords (block 650). This process may include, using the example of FIG. 2, separating overall codeword 250 into its component parts: encoded sub-codeword 205, encoded sub-codeword 210, and composite encoded sub-codeword 220. A data decoding algorithm is performed on each of the respective sub-codeword(s) and composite encoded sub-codeword(s) to yield corresponding decoded outputs (block 655). In some cases, the data decode algorithm is a low density parity check algorithm as are known in the art.
The original sub-codewords are reconstituted by reversing the mathematic process applied to the original sub-codeword(s) and composite sub-codeword(s) using decoded outputs (block 660). Where, for example, the mathematic process for creating the composite sub-codeword is that described above in relation to FIG. 2, reconstituting the original sub-codewords may be done using the following equations where L205 is soft data from a decoded output corresponding to encoded sub-codeword 205, L210 is soft data from a decoded output corresponding to encoded sub-codeword 210, and L220 is soft data from a decoded output corresponding to composite encoded sub-codeword 220:




  
    
      L
      215
      
        ′
        ⁡
        
          (
          j
          )
        
      
    
    =
    
      
        
          L
          205
          
            (
            j
            )
          
        
        +
        
          L
          210
          
            (
            j
            )
          
        
        +
        
          L
          220
          
            (
            j
            )
          
        
        +
        
          
            L
            205
            
              (
              j
              )
            
          
          ⁢
          
            L
            210
            
              (
              j
              )
            
          
          ⁢
          
            L
            220
            
              (
              j
              )
            
          
        
      
      
        1
        +
        
          
            L
            205
            
              (
              j
              )
            
          
          ⁢
          
            L
            210
            
              (
              j
              )
            
          
        
        +
        
          
            L
            205
            
              (
              j
              )
            
          
          ⁢
          
            L
            220
            
              (
              j
              )
            
          
        
        +
        
          
            L
            215
            
              (
              j
              )
            
          
          ⁢
          
            L
            220
            
              (
              j
              )
            
          
        
      
    
  
  ,




where j is the j-th bit of encoded sub-codeword 205, encoded sub-codeword 210, encoded sub-codeword 215, and composite encoded sub-codeword 220; and L′215 is the soft data corresponding to the reconstituted encoded sub-codeword 215.

It is determined whether each of the decoded outputs converged (i.e., whether the decode algorithm applied to each of the sub-codeword(s) and composite sub-codeword(s) converged)(block 665). Where all of the decoded outputs converged (block 665), the hard decision data associated with the decoded outputs is assembled together and provided as a data output (block 680). Otherwise, where all of the decoded outputs did not converge (block 665), additional error correction is applied using the sub-codeword(s), composite sub-codeword(s), and reconstituted sub-codeword(s) to correct any errors remaining in one or more otherwise non-converged sub-codeword(s)(block 670). The error correction utilizes the equations corresponding to the mathematical process originally applied to generate the composite sub-codeword. Using the example of FIG. 2, the equations are as follow:



  
    
      
        L
        205
        
          (
          j
          )
        
      
      =
      
        
          
            L
            210
            
              (
              j
              )
            
          
          +
          
            L
            220
            
              (
              j
              )
            
          
          +
          
            L
            215
            
              (
              j
              )
            
          
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
        
          1
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
          
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
          +
          
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
      
    
    ,
    
      

    
    ⁢
    
      
        L
        210
        
          (
          j
          )
        
      
      =
      
        
          
            L
            205
            
              (
              j
              )
            
          
          +
          
            L
            220
            
              (
              j
              )
            
          
          +
          
            L
            215
            
              (
              j
              )
            
          
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
        
          1
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
          
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
          +
          
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
      
    
    ,
    and
  




  
    
      L
      220
      
        (
        j
        )
      
    
    =
    
      
        
          
            L
            205
            
              (
              j
              )
            
          
          +
          
            L
            210
            
              (
              j
              )
            
          
          +
          
            L
            215
            
              ′
              ⁡
              
                (
                j
                )
              
            
          
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              220
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
        
          1
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              210
              
                (
                j
                )
              
            
          
          +
          
            
              L
              205
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
          +
          
            
              L
              210
              
                (
                j
                )
              
            
            ⁢
            
              L
              215
              
                ′
                ⁡
                
                  (
                  j
                  )
                
              
            
          
        
      
      .
    
  



It is determined whether all remaining errors have been corrected (block 675). Where all remaining errors have been corrected (block 675), the hard decision data associated with the decoded outputs is assembled together and provided as a data output (block 680). Otherwise, it is determined if another local iteration is expected (block 685). Where another local iteration is expected (block 685), the decoded outputs (block 655) are processed again through the processes of blocks 640-685. Alternatively, where another local iteration is not expected (block 685), the decoded outputs (block 655) are stored back to the central memory to await another global iteration through the processes of blocks 620-685 (block 690).
Turning to FIG. 7, a shared parity codeword encoding circuit 700 is depicted in accordance with some embodiments of the present invention. Shared parity codeword encoding circuit 700 includes a sub-codeword encoder circuit 710 that receives a data input 705. Data input 705 is provided from a host (not shown) that is writing data to a storage medium or transferring data via a transfer medium. Data input 705 is separated by sub-codeword encoder circuit 710 into portions, and sub-codeword encoder circuit 710 applies a data encoding algorithm to the respective portions to yield a number of encode sub-codewords 715. In some embodiments of the present invention, the data encoding algorithm is a low density parity check encoding algorithm as are known in the art. The encoding algorithm adds parity information to the encoded sub-codeword based upon the respective portion of data input 705. Encoded sub-codewords 715 are provided to a sub-codeword combining circuit 720 where two or more encoded sub-codewords 715 are mathematically combined to yield a composite encoded sub-codeword. Sub-codeword combining circuit 720 assembles the encoded sub-codewords 715 with the composite encoded sub-codeword replacing one of the encoded sub-codewords to yield an overall codeword 725. The mathematical generation of the composite encoded sub-codeword may use a mod 2 combination of multiple encoded sub codewords to yield the composite encoded sub-codeword, and the subsequent combining of encoded sub-codewords and the composite encoded sub-codeword maybe done similar to that described above in relation to FIG. 2. Overall codeword 725 is provided to a combined codeword writing circuit 730 that performs any remaining operations in preparation for sending a codeword 735 to a storage medium or a receiving device.
Turning to FIG. 8, a flow diagram 800 shows a method for encoding shared parity codewords in accordance with one or more embodiments of the present invention. Following flow diagram 800, a data input is received (block 805). The data input includes user bits and may be received, for example, from a host. A number of the user bits are collected for inclusion in a sub-codeword (block 810). In some cases, the number of bits is pre-defined. In other cases, the number of bits is programmable. It is determined whether enough user bits have been received to form a sub-codeword (block 815). Where an insufficient number of user bits have been collected (block 815), the processes of blocks 805-815 are repeated. Alternatively, where a sufficient number of user bits have been collected (block 815), the collected user bits are encoded to yield an encoded sub-codeword (block 820). In some embodiments of the present invention, the data encoding is a low density parity check encoding as are known in the art. The encoding algorithm adds parity information to the collected user bits to yield an encoded sub-codeword.
It is determined whether enough sub-codewords have been encoded to create an overall codeword (block 825). Where an insufficient sub-codewords have been encoded (block 825), the next sub-codeword is prepared (block 830) by repeating the processes of blocks 805-825 until sufficient sub-codewords have been prepared. Otherwise, where sufficient sub-codewords have been encoded (block 815), a composite codeword is generated (block 840). Generating the composite codeword includes mathematically combining a number of encoded sub-codewords to yield the composite sub-codeword. In some cases, the mathematical process for combining is a mod 2 combination of two or more encoded sub-codewords. The encoded sub-codewords are combined with the composite sub-codeword to yield an overall codeword (block 850). The combining process includes replacing one of the encoded sub-codewords with the composite sub-codeword. The mathematical generation of the composite encoded sub-codeword, and the subsequent combining of encoded sub-codewords and the composite encoded sub-codeword maybe done similar to that described above in relation to FIG. 2.
It should be noted that the various blocks discussed in the above application may be implemented in integrated circuits along with other functionality. Such integrated circuits may include all of the functions of a given block, system or circuit, or only a subset of the block, system or circuit. Further, elements of the blocks, systems or circuits may be implemented across multiple integrated circuits. Such integrated circuits may be any type of integrated circuit known in the art including, but are not limited to, a monolithic integrated circuit, a flip chip integrated circuit, a multichip module integrated circuit, and/or a mixed signal integrated circuit. It should also be noted that various functions of the blocks, systems or circuits discussed herein may be implemented in either software or firmware. In some such cases, the entire system, block or circuit may be implemented using its software or firmware equivalent. In other cases, the one part of a given system, block or circuit may be implemented in software or firmware, while other parts are implemented in hardware.
In conclusion, the invention provides novel systems, devices, methods and arrangements for data processing. While detailed descriptions of one or more embodiments of the invention have been given above, various alternatives, modifications, and equivalents will be apparent to those skilled in the art without varying from the spirit of the invention. Therefore, the above description should not be taken as limiting the scope of the invention, which is defined by the appended claims.

## Claims

1. A low density parity check encoding system, the system comprising:
a low density parity check encoder circuit operable to encode a first data set to yield a first low density parity check encoded sub-codeword, and to encode a second data set to yield a second low density parity check encoded sub-codeword;
a combining circuit operable to:
generate a composite low density parity check sub-codeword by mathematically combining at least the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword; and
combine at least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into an overall codeword.

2. The system of claim 1, wherein the system is implemented as part of a device selected from a group consisting of: a disk based storage device, a solid state storage device, and a receiving device.

3. The system of claim 1, wherein the system is implemented as part of an integrated circuit.

4. The system of claim 1, wherein generating the composite low density parity check sub-codeword includes performing a mod 2 mathematical process on a bit by bit basis of the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword to yield the composite low density parity check sub-codeword.

5. The system of claim 1, wherein mathematically combining at least the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword to yields a valid low density parity check codeword.

6. The system of claim 1, wherein the composite low density parity check sub-codeword, the first low density parity check encoded sub-codeword, and the second low density parity check encoded sub-codeword are all decodable using the same low density parity check decoding algorithm.

7. The system of claim 1, wherein the low density parity check encoder circuit is further operable to encode a third data set to yield a third low density parity check encoded sub-codeword; wherein generating the composite low density parity check sub-codeword is done by mathematically combining at least the first low density parity check encoded sub-codeword, the second low density parity check encoded sub-codeword, and the third low density parity check encoded sub-codeword; and wherein combining least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into the overall codeword includes combining at least the first low density parity check encoded sub-codeword, the second low density parity check encoded sub-codeword and the composite low density parity check sub-codeword to yield the overall codeword.

8. A method for encoding data, the method comprising:
encoding a first data set using a low density parity check encoding algorithm to yield a first low density parity check encoded sub-codeword;
encoding a second data set using a low density parity check encoding algorithm to yield a second low density parity check encoded sub-codeword;
mathematically calculating a composite low density parity check sub-codeword based at least in part on the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword; and
combining at least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into an overall codeword.

9. The method of claim 8, wherein mathematically calculating the composite low density parity check sub-codeword includes performing mod 2 combination on a bit by bit basis of the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword.

10. The method of claim 8, wherein mathematically calculating the composite low density parity check sub-codeword yields a valid low density parity check codeword.

11. The method of claim 8, wherein the composite low density parity check sub-codeword, the first low density parity check encoded sub-codeword, and the second low density parity check encoded sub-codeword are all decodable using the same low density parity check decoding algorithm.

12. The method of claim 8, wherein the method further comprises:
encoding a third data set using the low density parity check encoding algorithm to yield a third low density parity check encoded sub-codeword; and
wherein mathematically calculating a composite low density parity check sub-codeword based at least in part on the first low density parity check encoded sub-codeword, the second low density parity check encoded sub-codeword, and the third low density parity check encoded sub-codeword; and wherein combining at least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into the overall codeword includes combining at least the first low density parity check encoded sub-codeword, the second low density parity check encoded sub-codeword and the composite low density parity check sub-codeword to yield the overall codeword.

13. A data transfer device, the data transfer device comprising:
a low density parity check encoder circuit operable to encode a first data set to yield a first low density parity check encoded sub-codeword, and to encode a second data set to yield a second low density parity check encoded sub-codeword;
a combining circuit operable to:
generate a composite low density parity check sub-codeword by mathematically combining at least the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword;
combine at least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into an overall codeword; and

a write circuit operable to transfer the overall codeword.

14. The data transfer device of claim 13, wherein the data transfer device is a storage device having a storage medium, and wherein the storage device transfers information derived from the overall codeword to the storage medium.

15. The data transfer device of claim 14, wherein the storage medium is selected from a group consisting of: a magnetic storage medium, and a solid state memory.

16. The data transfer device of claim 13, wherein the data transfer device is a transceiver.

17. The data transfer device of claim 13, wherein generating the composite low density parity check sub-codeword includes performing a mod 2 mathematical process on a bit by bit basis of the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword to yield the composite low density parity check sub-codeword.

18. The data transfer device of claim 13, wherein mathematically combining at least the first low density parity check encoded sub-codeword and the second low density parity check encoded sub-codeword to yields a valid low density parity check codeword.

19. The data transfer device of claim 13, wherein the composite low density parity check sub-codeword, the first low density parity check encoded sub-codeword, and the second low density parity check encoded sub-codeword are all decodable using the same low density parity check decoding algorithm.

20. The data transfer device of claim 13, wherein the low density parity check encoder circuit is further operable to encode a third data set to yield a third low density parity check encoded sub-codeword; wherein generating the composite low density parity check sub-codeword is done by mathematically combining at least the first low density parity check encoded sub-codeword, the second low density parity check encoded sub-codeword, and the third low density parity check encoded sub-codeword; and wherein combining least the first low density parity check encoded sub-codeword and the composite low density parity check sub-codeword into the overall codeword includes combining at least the first low density parity check encoded sub-codeword, the second low density parity check encoded sub-codeword and the composite low density parity check sub-codeword to yield the overall codeword.