# Patent

## Title
Error correcting code encoder supporting multiple code rates and throughput speeds for data storage systems

## Abstract

Embodiments of ECC encoders supporting multiple code rates and throughput speeds for data storage systems are disclosed. In one embodiment, an encoder can provide for flexible and scalable encoding, particularly when quasi-cyclic low-density parity-check code (QC-LDPC) encoding is used. The encoder can be scaled in size based on, for example, the desired encoding throughput and/or computational cycle duration. The encoder can thus be used to support multiple code rates and throughput speeds. Accordingly, encoding speed and efficiency and system performance is improved.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
The present application claims the benefit of priority under 35 U.S.C. §120 as a continuation of U.S. patent application Ser. No. 13/718,289 entitled “Error Correcting Code Encoder Supporting Multiple Code Rates and Throughput Speeds for Data Storage Systems,” filed on Dec. 18, 2012, the disclosure of which is hereby incorporated by reference in its entirety for all purposes.


BACKGROUND
Technical Field
This disclosure relates to data storage systems for computer systems. More particularly, the disclosure relates to ECC encoder supporting multiple code rates and throughput speeds.
Description of the Related Art
Non-volatile memory arrays often have limited endurance. The endurance of the memory array is typically contingent on usage pattern and wear. In addition, the endurance depends on a type of the non-volatile memory array used. For example, memory arrays with multi-level cell (MLC) NAND media typically have a lower endurance than memory arrays with single-level cell (SLC) NAND media. To protect user data stored to memory arrays from corruption, which may be caused by a diminished endurance, parity data can be generated and stored along with user data to facilitate error detection and/or correction. Generation of parity data can time consuming and resource intensive. Accordingly, it is desirable to provide more efficient mechanisms for generating parity data.



BRIEF DESCRIPTION OF THE DRAWINGS
Systems and methods that embody the various features of the invention will now be described with reference to the following drawings, in which:
FIG. 1A illustrates a combination of a host system and a data storage system that implements ECC encoder supporting multiple code rates and throughput speeds according to one embodiment of the invention.
FIG. 1B illustrates a combination of a host system and a data storage system that implements ECC encoder supporting multiple code rates and throughput speeds according to another embodiment of the invention.
FIG. 2 illustrates encoding performed by ECC encoder supporting multiple code rates and throughput speeds according to one embodiment of the invention.
FIG. 3 illustrates a block diagram of a portion of ECC encoder supporting multiple code rates and throughput speeds according to one embodiment of the invention.
FIG. 4 illustrates a block diagram of a portion of ECC encoder supporting multiple code rates and throughput speeds according to another embodiment of the invention.
FIG. 5A illustrates a data path of ECC encoder supporting multiple code rates and throughput speeds according to one embodiment of the invention.
FIG. 5B illustrates an encoder module of ECC encoder supporting multiple code rates and throughput speeds according to one embodiment of the invention.
FIG. 6 illustrates a data path of ECC encoder supporting multiple code rates and throughput speeds according to another embodiment of the invention.
FIG. 7 is a flow diagram illustrating a process of storing data according to one embodiment of the invention.



DETAILED DESCRIPTION
While certain embodiments are described, these embodiments are presented by way of example only, and are not intended to limit the scope of protection. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions, and changes in the form of the methods and systems described herein may be made without departing from the scope of protection.
Overview
Data storage systems, such as solid state drives, typically include one or more controllers coupled with one or more non-volatile memory arrays. Depending on the type of non-volatile memory array used, stored data may be subject to corruption as a result of, for example, read/write disturbs, loss of data retention, and/or loss of endurance. Data storage systems can utilize one or more error correction or error coding mechanisms to detect and/or correct errors in the stored data. One such mechanism can determine parity data when writing user data. Parity data can be stored, for example, in a memory array. When stored user data is retrieved, parity data can be utilized to determine the integrity of the retrieved user data. If one or more errors are detected in the retrieved user data, such errors may be corrected.
Generation of parity data can involve considerable system overhead, such as processing time overhead, system resources overhead, and/or system components overhead (e.g., necessity to use additional hardware, firmware, etc.). Furthermore, storing parity data (e.g., in a memory array) can reduce memory space available for storage of user data. Accordingly, it can be advantageous for a data storage system to support different error code rates, code lengths, and/or different coding throughput speeds. For example, a data storage system can encode stored data using a higher coding rate, so that less parity data is generated and stored, when non-volatile memory is early in the lifecycle and thus has sufficient retention and/or endurance. As non-volatile memory wears out over time, the data storage system can switch to lower coding rates such that more parity data is generated to protect user data from errors. However, supporting multiple code rates, lengths, and/or throughput speeds can require adding and/or duplicating system components (hardware, firmware, etc.).
Embodiments of the present invention are directed to an ECC encoder supporting multiple code rates and throughput speeds. In one embodiment, the ECC encoder can support multiple error code rates and/or error code lengths by using nominal or no redundancy of system components. For example, the ECC encoder can be configured so that the existing encoding components can be used and/or reused for supporting various code rates and/or lengths. The ECC encoder can further support multiple error coding throughput speeds by, for example, utilizing parallel computation techniques. In other words, the architecture of the ECC encoder can be scalable and/or flexible. Accordingly, encoding efficiency and, consequently, data storage system performance can be increased without a substantial increase in the number and/or size of system components data encoding.
System Overview
FIG. 1A illustrates a combination 100A of a host system and a data storage system that implements an ECC encoder supporting multiple code rates and throughput speeds according to one embodiment of the invention. As is shown, the data storage system 120A (e.g., a solid-state drive) includes a controller 130 and a non-volatile memory array 150. The non-volatile memory array 150 may comprise non-volatile memory, such as flash integrated circuits, Chalcogenide RAM (C-RAM), Phase Change Memory (PC-RAM or PRAM), Programmable Metallization Cell RAM (PMC-RAM or PMCm), Ovonic Unified Memory (OUM), Resistance RAM (RRAM), NAND memory (e.g., single-level cell (SLC) memory, multi-level cell (MLC) memory, or any combination thereof), NOR memory, EEPROM, Ferroelectric Memory (FeRAM), Magnetoresistive RAM (MRAM), other discrete NVM (non-volatile memory) chips, or any combination thereof. The data storage system 120A can further comprise other types of storage.
The controller 130 can be configured to receive data and/or storage access commands from a storage interface module 112 (e.g., a device driver) of a host system 110. Storage access commands communicated by the storage interface 112 can include write data and read data commands issued by the host system 110. Read and write commands can specify a logical address (e.g., logical block addresses or LBAs) used to access the data storage system 120A. The controller 130 can execute the received commands in the non-volatile memory array 150.
Data storage system 120A can store data communicated by the host system 110. In other words, the data storage system 120A can act as memory storage for the host system 110. To facilitate this function, the controller 130 can implement a logical interface. The logical interface can present to the host system 110 data storage system's memory as a set of logical addresses (e.g., contiguous address) where user data can be stored. Internally, the controller 130 can map logical addresses to various physical locations or addresses in the non-volatile memory array 150 and/or other storage modules. The controller 130 includes a data storage and error correction module 132 configured to store data in and retrieve data from the non-volatile memory array 150, determine integrity of data retrieved from the non-volatile memory array, perform, if necessary, error correction of retrieved data, and perform transfer of data between the data storage system 120A and the host system 110.
FIG. 1B illustrates a combination 100B of a host system and a data storage system that ECC encoder supporting multiple code rates and throughput speeds according to another embodiment of the invention. As is illustrated, data storage system 120B (e.g., hybrid disk drive) includes a controller 130, a non-volatile memory array 150, and magnetic storage 160, which comprises magnetic media 164. These and other components of the combination 100B are described above.
Overview of Low-Density Parity-Check (LDPC) Coding
In one embodiment, an ECC encoder can utilize low-density parity-check (LDPC) linear block codes for generation of data. LDPC codes can be generated using a generator matrix GK×N, where K=N−M corresponds to the number of information units or bits per codeword, which correspond to user data. Accordingly, M=N−k corresponds to the number parity bits. The LDPC encoder generates a codeword u=(u0, u1, . . . , uN-1) from a user data vector v=(v0, v1, . . . , vk−1) via following matrix multiplication:

v=u×G  (1)

A generator matrix of an LDPC coder can be referred to as matrix producing systematic codes if the encoded codewords include the original user data bits followed by N−K parity check bits. Such generator matrix can be represented as:

GK×N=[IK×K|QK×(N−K)]  (2)

For LDPC codes, Q submatrix of the generator matrix G is generally a high density matrix, and I submatrix is a k×k identity matrix. In one embodiment, the generator matrix G used for Quasi-Cyclic LDPC (QC-LDPC) encoding can have the following form:



  
    
      
    
    ⁢
    
      (
      3
      )
    
  




  
    
      G
      QC
    
    =
    
      
        [
        
          
            
              I
            
            
              0
            
            
              ...
            
            
              0
            
            
              
                G
                
                  1
                  ,
                  1
                
              
            
            
              
                G
                
                  1
                  ,
                  2
                
              
            
            
              ...
            
            
              
                G
                
                  1
                  ,
                  m
                
              
            
          
          
            
              0
            
            
              I
            
            
              ...
            
            
              0
            
            
              
                G
                
                  2
                  ,
                  1
                
              
            
            
              
                G
                
                  2
                  ,
                  2
                
              
            
            
              ...
            
            
              
                G
                
                  2
                  ,
                  m
                
              
            
          
          
            
              ⋮
            
            
              ⋮
            
            
              ⋱
            
            
              ⋮
            
            
              ⋮
            
            
              ⋮
            
            
              ⋱
            
            
              ⋮
            
          
          
            
              0
            
            
              0
            
            
              ...
            
            
              I
            
            
              
                G
                
                  
                    n
                    -
                    m
                  
                  ,
                  1
                
              
            
            
              
                G
                
                  
                    n
                    -
                    m
                  
                  ,
                  2
                
              
            
            
              ...
            
            
              
                G
                
                  
                    n
                    -
                    m
                  
                  ,
                  m
                
              
            
          
        
        ]
      
      =
      
        [
        
          
            I
            
              
                (
                
                  n
                  -
                  m
                
                )
              
              ⁢
              p
            
          
          |
          Q
        
        ]
      
    
  



where I is a p×p identity matrix, 0 is a p×p zero matrix, Gi,j for 1≦i≦n−m and 1≦j≦m is a p×p circulant, and n=N/p and m=M/p. In p×p circulant matrix Gi,j row number y is rotated to the right by one as compared to row number y−1. In one embodiment, code rate for QC-LDPC encoding can be defined as:




  
    
      
        R
        =
        
          
            1
            -
            
              M
              N
            
          
          =
          
            1
            -
            
              m
              n
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




In one embodiment, when systematic LDPC codes are used, multiplication by a systematic portion of the generator matrix GQC (e.g., I(n-m)p) may be dispensed with. In one embodiment, non-systematic portion Q of the generator matrix is not a low-density matrix. Still, matrix Q may be follow QC format (e.g., be circulant). Further, user data bits can be divided into k (or n−m) segments:

u={s1,s2,s3, . . . ,sn-m}  (5)

where sj is a jth subsegment of user data of size P (e.g., P bits). In one embodiment, gi,j can correspond to the first row of Gi,j matrix and hi,j can correspond to the first column of Gi,j matrix. In addition, gi,j(f) can correspond to gi,j right-shifted by f and hi,j(f) can correspond to hi,j right-shifted by f Jth segment of parity data with size of P bits can be represented as:

Qj=si×Gi,j=s1G1,j+s2G2,j+ . . . +sn-mGn-m,j  (6)

FIG. 2 illustrates encoding 200 performed by an ECC encoder supporting multiple code rates and throughput speeds according to one embodiment of the invention. In one embodiment, matrix multiplication is performed by the controller 130 and/or data storage and error correction module 132. Row 210 represents a segment of user data having length k. This segment comprises subsegments 212, 214, . . . , 216 having length P, where P is an integer (e.g., 128, 256, 512, 1024, etc.). Matrix 220 represents generator matrix G. In one embodiment, matrix 220 can correspond to matrix Q of equation (3). Matrix 220 can be divided into a plurality of submatrices 228, which can be, for example, of size P×P. The number of submatrices 228 along the column dimension 230 of matrix 220 can be, for example, n−k, (n−k)/P, and so on. The number of submatrices 228 along the row dimension 232 of matrix 220 can be, for example, k, k/P, and so on. In one embodiment, there are m submatrices 228 along the column dimension 230 of matrix 220.
In one embodiment, encoding 200 can include the following operations. User data 210 subsegment 212 can be multiplied by submatrices 228 in row 222 in order to determine:

Qj=s1G1,j for j={0,m−1}  (7a)

User data 210 subsegment 214 can be multiplied by submatrices 228 in row 224 in order to determine:

Qj=Qj+s2G2,j for j={0,m−1}  (7b)

These multiplication operations can be continued and Qj of equation (6) can be determined as follows:

Qj=Qj+sn-mGn-m j for j={0,m−1}  (7c)

Finally, user data 210 subsegment 216 can be multiplied by submatrices 228 in row 226 in order to determine the final value of Qj. The result can be saved in a row vector 230.
ECC Encoder Supporting Multiple Code Rates and Throughput Speeds
FIG. 3 illustrates a block diagram of a portion of ECC encoder 300 supporting multiple code rates and throughput speeds according to one embodiment of the invention. In one embodiment, the encoder 300 can perform the multiplication si×Gij of equation (6). Register 310 can be configured to store a subsegment of user data (e.g., of size p). Register 320 can be configured to store a row of a submatrix 228 (e.g., of size 1×p) of the matrix G. In one embodiment, such as for example when encoder 300 is configured to perform QC-LDPC encoding, matrix G can be a circulant matrix and the submatrix can also be circulant. Accordingly, shifting or rotating (e.g., to the left or the right) the content of register 320 can produce a next row of the submatrix. As a result, only one row of the submatrix can be stored in the register 320 for performing the multiplication si×Gi,j of equation (6). Logic gates 330 and 340 can be configured to perform the multiplication operations. In one embodiment, AND and XOR gates can be utilized. In other embodiments, any other suitable combinations of logic gates can be used, such as NAND, OR, NOR, etc. Register 350 can be configured to store the result of the multiplication.
In one embodiment, the encoder 300 can determine si×Gi,j as follows. A row gi,j of the submatrix is loaded into the register 320 and next user subsegment (e.g., of size p bits) is loaded in the register 310. Every computational cycle one bit si of register 310 is feed to as input into the logic gates 330. This can be accomplished by right shifting the register 310. The result of the multiplication by si is computed and stored in the register 350, which can indicate a completion of a computational cycle. In one embodiment, a computational cycle can correspond to a system clock cycle. At the start of the next computational cycle, the contents of the register 320 can be right-rotated by one, which results in loading the next row of the submatrix. Then, the next bit si from register 310 is feed as input to the logic gates 330, and the foregoing process is repeated. In one embodiment, the contents of the register 320 are right-rotated by one every computational cycle. It can take a total of P computational cycles to perform the operation si×Gi,j. At the completion of P cycles, the encoder 300 can compute si×Gi+1,j by loading a row gi+1,j of the next submatrix into the register 320. As is illustrated in FIG. 3, the encoder 300 comprises three registers having size P, P logic gates 330 (e.g., AND gates), and P logic gates 340 (e.g., XOR). The encoder 300 can be referred to as shift-register-adder-accumulator (SRAA).
In one embodiment, any number of encoders 300 can be utilized in order to improve throughput associated with the computation of parity data. In one embodiment, an LDPC encoder comprising, for example, an encoding module having five encoders 300 configured to compute parity data associated with user data in parallel may still provide throughput below a target throughput. For instance, the throughput in one embodiment can be about 100 MBytes/s when clock frequency of about 800 MHz is used. Many encoding modules may be needed to achieve higher throughput. For example, 80 or more encoding modules may be needed to achieve the throughput of about 8 GBytes/s or higher, with each encoding module having five encoders 300. In such configuration, the overall logic may comprise multiple million(s) of logic gates and use a large amount of buffer memory.
FIG. 4 illustrates a block diagram of a portion of ECC encoder 400 supporting multiple code rates and throughput speeds according to another embodiment of the invention. In one embodiment, the encoder 400 can perform the multiplication si×Gi,j of equation (6). Register 410 can be configured to store a subsegment of user data (e.g., of size p). Register 420 can be configured to store a row of a submatrix 228 (e.g., of size 1×p) of the matrix G. In one embodiment, such as for example when encoder 400 is configured to perform QC-LDPC encoding, matrix G can be a circulant matrix and the submatrix can also be circulant. Accordingly, shifting or rotating (e.g., to the left or the right) the content of register 420 can produce a next row of the submatrix. As a result, only one row of the submatrix can be stored in the register 420 for performing the multiplication si×Gi,j of equation (6). Logic gates 430 and 440 can be configured to perform the multiplication operations. In one embodiment, AND and XOR gates can be utilized. In other embodiments, any other suitable combinations of logic gates can be used, such as NAND, OR, NOR, etc. Register 450 can be configured to store the result of the multiplication.
In one embodiment, the encoder 400 is configured to perform in parallel and/or substantially in parallel multiplication of X bits of user data stored in the register 410. X can be an integer value, such as 2, 8, 16, 32, 64, and so on, and X corresponds to the internal parallelism of the encoder 400. In some embodiments, the internal parallelism can be scaled up and/or down depending on the desired tradeoff between throughput of the encoder and size of logic associated with the encoder.
In one embodiment, the encoder 400 configured can determine si×Gi,j as follows. The encoder 400 can be configured with X=32. A row gi,j of the submatrix is loaded into the register 420 and next user subsegment (e.g., of size p bits) is loaded in the register 410. Every computational cycle X bits (e.g., 32 bits or 4 bytes) of user data si,X stored in register 410 are feed as input to the logic gates 430. This can be accomplished by right shifting the register 410 by X. The result of the multiplication by si,X is computed and stored in the register 450, which can indicate a completion of a computational cycle. At the start of the next computational cycle, the contents of the register 420 can be right-rotated by X (e.g., 32 bits or 4 bytes). Then, the next X bits si+1,X stored in register 410 is feed to as input into the logic gates 430, and the foregoing process is repeated. In one embodiment, the contents of the register 420 are right-rotated by X every computational cycle. In one embodiment, there are X−1 virtual copies of the register 420 having corresponding matrix data corresponding to right-rotated data by 1, 2, . . . , X−1. It can take a total of P/X (e.g., P/32) computational cycles to perform the operation si×Gi,j. At the completion of P/X cycles, the encoder 400 can compute the si×Gi+1,j by loading a row gi+1,j of the next submatrix into the register 420. As is illustrated in FIG. 4, the encoder 400 comprises three registers having size P, X*P logic gates 430 (e.g., AND gates) having X inputs, and P logic gates 440 (e.g., XOR) having X+1 inputs.
FIG. 5A illustrates a data path of ECC encoder 500 supporting multiple code rates and throughput speeds according to one embodiment of the invention. The encoder 500 comprises a plurality of encoder modules 520 configured to compute in parallel and/or substantially in parallel parity data associated with a plurality of user data units 510, each unit comprising subsegments of user data. In one embodiment, the encoder 400 illustrated in FIG. 4 can be used as the encoder modules 520. In one embodiment, the throughput of the encoder 500 can be determined according to X*frequency of the system clock. For example, when X=32 and frequency of the clock is about 800 MHz, the throughput of the encoder 500 is about 3200 MBytes/s (or about 3.2 GBytes/s).
In one embodiment, a number of encoder modules 520 can be selected in accordance with a desired throughput. For example, the number of encoder modules can be 1, 2, 3, 4, and so on. In one embodiment, the upper limit on the number of encoder modules can be selected as a number of submatrices in the generator matrix. In such embodiment, parity data can be determined in parallel or substantially in parallel using all submatrices. In one embodiment, coding rate of the encoder 500 can be selected based on the combination of the number of submatrices and the value of P. In another embodiment, coding rate of the encoder 500 can be selected based on the combination of the values of X and P.
FIG. 5B illustrates an encoder module 520 of the ECC encoder 500 supporting multiple code rates and throughput speeds according to one embodiment of the invention. As is illustrated, the encoder module 520 accepts and operates on one or more subunits of user data 530. The encoder module 520 can be partitioned into a plurality of encoding blocks 540. The partitioning is depicted by lines 542. One or more encoding blocks 540 can be configured to compute parity data associated with one or more subunits of user data. In one embodiment, one or more encoding block 540 can be configured with desired X and/or P. For example, the encoder module 520 can be configured as: one encoding block 540 with X=32 and P=1024, one encoding block 540 with X=32 and P=512 and one encoding block 540 with X=32 and P=256, two encoding blocks 540 with X=32 and P=256, four encoding blocks 540 with X=32 and P=256, two encoding blocks 540 with X=32 and P=512, and so on. In one embodiment, configuring the encoder module blocks 540 with X=32 and P=1024 can result in a throughput of about 3.2 GBytes/s. In one embodiment, configuring the encoder module 520 as one encoding block 540 with X=32 and P=512 and one encoding block 540 with X=32 and P=256 can provide throughput of about 6.4 GBytes/s.
FIG. 6 illustrates a data path of ECC encoder 600 supporting multiple code rates and throughput speeds according to another embodiment of the invention. As is illustrated, the encoder 600 comprises five encoder modules 620 operating on user data 610. In one embodiment, the encoder modules 620 can be configured with X=32. Such configuration can be used to determine parity data using 4/5*P parity submatrix. The number of computational cycles for determining parity data can be proportional to the size (e.g., length) of the user data. In another embodiment, one or more encoder modules 620 can be configured with any suitable value(s) of A. In one embodiment, configuring the encoder module 620 with one encoding block having X=32 and P=1024 may cause the encoder module to wait until the encoding operations are completed for a current subunit of user data before encoding next subunit of user data.
In one embodiment, each encoder module 620 includes three registers having size P, X*P logic gates (e.g., logic gates 430) having X inputs, and P logic gates (e.g., logic gates 440) having X+1 inputs. Accordingly, the encoder 600 includes 15 register groups having size P, 5*X*P logic gates having X inputs, and 5*P logic gates having X+1 inputs. For example, for X=32 the encoder 600 includes 15 register groups having size P, 160*P logic gates having 32 inputs, and P logic gates having X+33 inputs. In one embodiment, a double buffer may be used for registers 410, 420, and/or 450 of FIG. 4 to provide a sustained throughput, such as to provide output and queue input simultaneously or nearly simultaneously. In one embodiment, routing complexity associated with the logic of the encoder module 620 may increase with increase in X.
FIG. 7 is a flow diagram illustrating a process 700 of storing data according to one embodiment of the invention. The process 700 can be executed by the controller 130 and/or the data storage and error correction module 132. The process 700 starts in block 702 where it selects size of a subset or subsegment of user data to be stored. The selection can be performed based in part on a size (e.g., P) of the submatrices of the generator matrix. For example, as explained above, user data subsegments of size P can be selected. In block 704, the process 700 generates in parallel or substantially in parallel subsets of parity data corresponding to the subsegments of user data. As is explained above, parity data can be generated by multiplying subsegments of user data by the plurality of submatrices of the generator matrix. Further, parity data corresponding to a given subsegment of user data can be generated in parallel or substantially in parallel. For example, multiplications of the subsegment or part of the subsegment by at least some submatrices of the generator matrix can be performed in parallel or substantially in parallel. Accordingly, parity data can be generated in parallel or substantially in parallel across the subsegments of the user data as well for data bits of a given subsegment. In block 706, the process 700 stores the user data along with generated parity data in data storage system memory. For example, the process 700 can store the user data and parity data in the non-volatile memory array 150.
CONCLUSION
Utilizing ECC encoder supporting multiple code rates and throughput speeds as is disclosed herein can provide for flexible and scalable encoding of user data, particularly when QC-LDPC encoding is used. The encoder can be scaled in size based on, for example, the desired encoding throughput and/or computational cycle duration. The encoder architecture can thus be used to support multiple code rates and throughput speeds. Accordingly, encoding speed and efficiency and system performance is improved.
OTHER VARIATIONS
Those skilled in the art will appreciate that in some embodiments, other suitable error correction mechanisms can be used in addition to and/or in place of LDPC coding. For example, Hamming coding, Reed-Solomon coding, BCH coding, and the like can be used. Further, user data can encompass data provided by a host system, data generated internally by a data storage system, etc., and/or a combination thereof. Also, any suitable unit or grouping of data, such as octet, nibble, word, byte, etc., can be used in addition to or in place of a bit of user data. Moreover, when code shortening techniques are utilized, encoding may be partially or fully skipped. The actual steps taken in the disclosed processes, such as the processes illustrated in FIG. 7, may differ from those shown in the figure. Additional system components can be utilized, and disclosed system components can be combined or omitted. Depending on the embodiment, certain of the steps described above may be removed, others may be added. Accordingly, the scope of the present disclosure is intended to be defined only by reference to the appended claims.
While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the protection. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the protection. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the protection. For example, the systems and methods disclosed herein can be applied to hard disk drives, hybrid hard drives, and the like. In addition, other forms of storage (e.g., DRAM or SRAM, battery backed-up volatile DRAM or SRAM devices, EPROM, EEPROM memory, etc.) may additionally or alternatively be used. As another example, the various components illustrated in the figures may be implemented as software and/or firmware on a processor, ASIC/FPGA, or dedicated hardware. Also, the features and attributes of the specific embodiments disclosed above may be combined in different ways to form additional embodiments, all of which fall within the scope of the present disclosure. Although the present disclosure provides certain preferred embodiments and applications, other embodiments that are apparent to those of ordinary skill in the art, including embodiments which do not provide all of the features and advantages set forth herein, are also within the scope of this disclosure. Accordingly, the scope of the present disclosure is intended to be defined only by reference to the appended claims.

## Claims

1. A data storage system, comprising:
a controller configured to select one or more segment sizes from a plurality of predetermined segment sizes for encoding operations on user data received from a host system,
wherein the controller comprises a plurality of encoding modules, at least one of the encoding modules comprising an input register and being configured to receive and operate on a respective data segment of the user data to generate a plurality of subunits of encoded data based on the respective data segment of the user data and respective portions of a generator matrix loaded by the encoding module, wherein a first portion and a second portion of the respective portions each have a size corresponding to one of the selected one or more segment sizes, the size of the first portion being different than the size of the second portion, and wherein the size of the first portion and second portion are based on a different multiplication of a same submatrix size, and
wherein a first subunit of the plurality of subunits is a different size than a second subunit of the plurality of subunits.

2. The data storage system of claim 1, wherein the plurality of encoding modules are configured to receive and process a plurality of data segments including the respective data segment, from respective input registers in parallel.

3. The data storage system of claim 2, wherein a throughput of the plurality of encoding modules is based on a number of the plurality of data segments processed in parallel by the plurality of encoding modules.

4. The data storage system of claim 1, wherein the at least one encoding module is configured to operate on the respective data segment of the user data based on a computation of the first portion and the second portion of the multiple portions of the generator matrix.

5. The data storage system of claim 4, wherein the at least one portion of the generator matrix comprises a circulant submatrix, a length of the circulant submatrix corresponding to a length of a submatrix of the submatrix size.

6. The data storage system of claim 4,
wherein a throughput of the plurality of encoding modules is based at least in part on the respective sizes of the first and second portions of the generator matrix.

7. The data storage system of claim 4, wherein each encoder module of the plurality of encoding modules comprises a plurality of logic gates receiving input from the input register, wherein a number of the logic gates configured to receive input are selected based in part on a number of submatrices in the generator matrix, and wherein the number of logic gates configured to receive input is based in part on a ratio of the selected segment size to an integer N, wherein N is selected based at least in part on a desired throughput of the system.

8. The data storage system of claim 7, wherein each encoding module is configured to generate the encoded data in a number of computational cycles corresponding to the ratio.

9. The data storage system of claim 1, wherein the encoded data comprises parity data.

10. A method, comprising:
selecting one or more portion sizes of user data from a plurality of predetermined portion sizes for encoding the user data by a plurality of encoding modules;
receiving the user data; and
encoding, by the plurality of encoding modules, the received user data, at least one of the encoding modules generating encoded data for a respective portion of the user data,
wherein the at least one of the encoding modules generates a plurality of subunits of encoded data based on the respective data portion of the user data and respective divisions of a generator matrix loaded by the encoding module, wherein a first division and a second division of the respective divisions each have a size corresponding to one of the selected one or more portion sizes, the size of the first division being different than the size of the second division, and wherein the size of the first division and the second division are based on a different multiplication of a same submatrix size.

11. The method of claim 10, wherein the user data comprises a plurality of data segments, including the respective data segment, and wherein the plurality of encoding modules process the plurality of data segments in parallel.

12. The method of claim 11, wherein a throughput of the plurality of encoding modules is based on a number of the plurality of data segments processed in parallel by the plurality of encoding modules.

13. The method of claim 10, wherein the at least one encoding module is configured to operate on the respective portions of the user data based on a computation of the first portion and the second portion of the multiple portions of the generator matrix.

14. The method of claim 13, wherein the at least one portion of the generator matrix comprises a circulant submatrix, a length of the circulant submatrix corresponding to a length of a submatrix of the submatrix size.

15. The method of claim 13,
wherein a throughput of the at least one of the encoding modules is based at least in part on the respective sizes of the first and second portions of the generator matrix.

16. The method of claim 13, wherein a respective encoder module of the plurality of encoding modules comprises a plurality of logic gates receiving bit values based on the respective portion of the user data processed by the at least one encoding module, and wherein the number of logic gates receiving bit values is equal to a ratio of the selected portion size to an integer N, the method further comprising:
selecting N based at least in part on a desired throughput of the system.

17. The method of claim 16, wherein the at least one encoding module is configured to generate the encoded data in a number of computational cycles corresponding to the ratio.

18. The method of claim 10, wherein the encoded data comprises parity data.