US10810120B2 - Encoder, associated encoding method and flash memory controller - Google Patents

Encoder, associated encoding method and flash memory controller Download PDF

Info

Publication number
US10810120B2
US10810120B2 US16/273,093 US201916273093A US10810120B2 US 10810120 B2 US10810120 B2 US 10810120B2 US 201916273093 A US201916273093 A US 201916273093A US 10810120 B2 US10810120 B2 US 10810120B2
Authority
US
United States
Prior art keywords
blocks
parity blocks
inverse matrix
generate
parity
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US16/273,093
Other versions
US20200117591A1 (en
Inventor
Shiuan-Hao Kuo
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Silicon Motion Inc
Original Assignee
Silicon Motion Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Silicon Motion Inc filed Critical Silicon Motion Inc
Assigned to SILICON MOTION INC. reassignment SILICON MOTION INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: KUO, SHIUAN-HAO
Publication of US20200117591A1 publication Critical patent/US20200117591A1/en
Application granted granted Critical
Publication of US10810120B2 publication Critical patent/US10810120B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1008—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
    • G06F11/1012—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices using codes or arrangements adapted for a specific type of error
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/3004—Arrangements for executing specific machine instructions to perform operations on memory
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C7/00—Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/10—Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
    • G11C7/1006—Data managing, e.g. manipulating data before writing or reading out, data bus switches or control circuits therefor
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/23—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory codes
    • H03M13/235—Encoding of convolutional codes, e.g. methods or arrangements for parallel or block-wise encoding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
    • H03M13/611—Specific encoding aspects, e.g. encoding by means of decoding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6502—Reduction of hardware complexity or efficient processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/10—Providing a specific technical effect
    • G06F2212/1032—Reliability improvement, data loss prevention, degraded operation etc
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72—Details relating to flash memory management
    • G06F2212/7207—Details relating to flash memory management management of metadata or control data

Definitions

  • the present invention is related to encoders, and more particularly, to an encoder for a flash memory controller, an associated encoding method, and an associated flash memory controller.
  • a general encoder may have a parity-check matrix in order to check whether the parity generated by the encoder is correct. For example, after the encoder encodes data to generate parity (e.g. check code), the encoder may multiply the data and the parity by this parity-check matrix, where if the multiplication result is “0”, the encoding is determined to be correct; otherwise, the encoding is determined to be incorrect. In response to this parity-check matrix, the encoder may have a corresponding parity generator matrix in order to generate appropriate parity. The parity generator matrix is not able to be found under some conditions, however.
  • parity generator matrix is not able to be found under some conditions, however.
  • the encoder may need to perform multiple matrix multiplying operations and/or compensation/adjustment operations in order to generate parity that is similar to the parity generated by the parity generator matrix, and therefore complexity of the encoder increases. More particularly, the aforementioned multiple matrix multiplying operations usually comprise circular convolution calculations, which may greatly increase hardware costs of the encoder.
  • An objective of the present invention is to provide an encoder, which is able to reduce the hardware for the circular convolution calculations within the encoder in order to prevent the condition of greatly increasing hardware costs.
  • an encoder configured in a flash memory controller, wherein the encoder comprises a barrel shifter module, a first inverse matrix calculating circuit and a calculating circuit.
  • the barrel shifter module is arranged to process a plurality of data blocks to generate a plurality of partial parity blocks, wherein the plurality of partial parity blocks comprise a first portion, a second portion and a third portion;
  • the first inverse matrix calculating circuit is coupled to the barrel shifter module, and is arranged to perform inverse matrix calculating operations on the first portion to generate a first portion of parity blocks;
  • the calculating circuit is coupled to the barrel shifter module and the first inverse matrix calculating circuit, and is arranged to perform the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks; wherein the first portion of the parity blocks, the second portion of the parity blocks, and the
  • a flash memory controller is disclosed, where the flash memory controller is arranged to access a flash memory module, and the flash memory controller comprises a memory, a microprocessor and an encoder, where the memory is arranged to store a program code, the microprocessor is arranged to execute the program code to control access to the flash memory module, and the encoder is arranged to encode a plurality of data blocks to obtain a plurality of parity blocks.
  • the encoder comprises a barrel shifter module, a first inverse matrix calculating circuit and a calculating circuit.
  • the barrel shifter module is arranged to process the plurality of data blocks to generate a plurality of partial parity blocks, wherein the plurality of partial parity blocks comprise a first portion, a second portion and a third portion;
  • the first inverse matrix calculating circuit is coupled to the barrel shifter module, and is arranged to perform inverse matrix calculating operations on the first portion to generate a first portion of parity blocks;
  • the calculating circuit is coupled to the barrel shifter module and the first inverse matrix calculating circuit, and is arranged to perform the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks; wherein the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks serve as the plurality of parity blocks generated by the encoder in response to the plurality of data blocks, and the plurality of data blocks and the plurality of parity blocks are written into a
  • an encoding method for a flash memory controller comprises the following steps: processing a plurality of data blocks to generate a plurality of partial parity blocks, wherein the plurality of partial parity blocks comprise a first portion, a second portion and a third portion; performing inverse matrix calculating operations on the first portion to generate a first portion of parity blocks; performing the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks, wherein the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks serve as a plurality of parity blocks generated by the encoder in response to the plurality of data blocks; and writing the plurality of data blocks and the plurality of parity blocks into a flash memory.
  • FIG. 1 is a diagram illustrating a memory device according to an embodiment of the present invention.
  • FIG. 2 is a diagram illustrating a parity-check matrix and a parity generator matrix.
  • FIG. 3 is a diagram illustrating a matrix according to an embodiment of the present invention.
  • FIG. 4 is a diagram illustrating an encoder according to an embodiment of the present invention.
  • FIG. 5 is a flowchart illustrating an encoding method according to an embodiment of the present invention.
  • FIG. 1 is a diagram illustrating a memory device 100 according to an embodiment of the present invention.
  • the memory device 100 comprises a flash memory module 120 and a flash memory controller 110 , and the flash memory controller 110 is arranged to access the flash memory module 120 .
  • the flash memory controller 110 comprises a microprocessor 112 , a read only memory (ROM) 112 M, a control logic 114 , a buffer memory 116 and an interface logic 118 .
  • the ROM 112 M is arranged to store a program code 112 C
  • the microprocessor 112 is arranged to execute the program code 112 C to control access to the flash memory module 120 .
  • the control logic 114 comprises an encoder 132 and a decoder 134 , where the encoder 132 is arranged to encode data that is written into the flash memory module 120 to generate a corresponding check code (or error correction code (ECC)), and the decoder 134 is arranged to decode data that is read out from the flash memory module 120 .
  • ECC error correction code
  • the flash memory module 120 comprises a plurality of flash memory chips, and each of the plurality of flash memory chips comprises a plurality of blocks.
  • the controller e.g. the flash memory controller 110 controlled by the microprocessor 112 through executing the program code 112 C
  • a block may record a specific number of data pages, where the controller (e.g. the flash memory controller 110 controlled by the microprocessor 112 through executing the program code 112 C) performs a writing data operation on the flash memory module 120 in the unit of data pages.
  • the memory controller 110 controlled by the microprocessor 112 through executing the program code 112 C may utilize internal components thereof to perform various control operations; for example, utilizing the control logic 114 to control access operations of the flash memory module 120 (more particularly, access operations on at least one block or at least one data page), utilizing the buffer memory 116 to perform required buffer operations, and utilizing the interface logic 118 to communicate with the host device 130 .
  • the memory device 100 may be a portable memory device (e.g. a memory card conforming to SD/MMC, CF, MS or XD specifications), and the host device 130 may be an electronic device that is connectable with a portable memory device; for example, mobile phones, laptop computers, personal computers, etc.
  • the memory device 100 may be configured in an electronic device (for example, in a mobile phone, a laptop computer or a personal computer), and the host device 130 may be a processor of this electronic device.
  • LDPC low-density parity check
  • an inverse matrix K ⁇ 1 of the matrix L is found, and then the inverse matrix K ⁇ 1 is multiplied by the matrix M to obtain a matrix P, where a transpose matrix of the matrix P may be taken as the parity generator matrix.
  • the encoder 132 may multiply the data from the host device 130 by the transpose matrix of the matrix P to obtain a parity corresponding to the data, and the encoder 132 then multiplies both the data and this parity by the parity-check matrix in order to determine whether this parity is correct.
  • the encoding is determined to be correct; otherwise, the encoding is determined to be incorrect.
  • the data and the corresponding parity are written into a data page within the flash memory module 120 .
  • each unit within the aforementioned parity-check matrix is a block in practice, and the block may be a square matrix (e.g. a 64*64 matrix or a 192*192 matrix).
  • the parity-check matrix comprises c*t blocks.
  • the encoder 132 may therefore need to perform multiple matrix multiplying operations and/or compensation/adjustment operations to obtain content that is similar to the inverse matrix K ⁇ 1 , in order to find the parity generator matrix and generate the parity.
  • the present invention therefore provides a circuit structure which can finish the operations of the encoder 132 , which is able to save hardware costs of the encoder as much as possible. It should be noted that the encoding process of the encoder 132 involves many complicated mathematics operations; the main point of the present invention is the design of the circuit structure, and related matrix descriptions and derivation process are omitted, for brevity.
  • FIG. 3 is a diagram illustrating the matrix K according to an embodiment of the present invention. Rows and columns of the matrix K are respectively divided into three segments, and these three segment respectively comprise A blocks, S blocks and B blocks, where A, S and B are positive integers.
  • the upper-right region of the matrix K shown in FIG. 3 (such as a region 302 ) is a blank region, where all values within all blocks within the region 302 are zero.
  • the shading portion such as a region 304 is a non-zero region, where each of the blocks within the region 304 comprises at least one non-zero value.
  • other regions of the matrix K are not limited to blank regions or non-zero regions.
  • the encoder 132 shown in the following descriptions is designed based in the matrix K shown in FIG. 3 , but the present invention is not limited thereto.
  • FIG. 4 is a diagram illustrating an encoder 400 according to an embodiment of the present invention, where the encoder 400 may be the encoder 132 shown in FIG. 1 .
  • the encoder 400 comprises a barrel shifter module 410 , a first inverse matrix calculating circuit 420 and a calculating circuit 430 , where the calculating 430 comprises three barrel shifter modules 431 , 434 and 435 , a first adjustment circuit 432 , a second inverse matrix calculating circuit 433 , a second adjustment circuit 436 , a third inverse matrix calculating circuit 437 and a calculating circuit 440 , where the calculating circuit 440 comprises a barrel shifter module 441 , a fourth inverse matrix calculating circuit 442 and a third adjustment circuit 443 .
  • the barrel shifter modules 410 , 431 , 434 , 435 , 441 may be implemented by multiple barrel shifters and multiple accumulator circuits
  • the first inverse matrix calculating circuit 420 , the second inverse matrix calculating circuit 433 , the third inverse matrix calculating circuit 437 and the fourth inverse matrix calculating circuit 442 may be implemented by a circular convolution calculating circuit and a compensation circuit.
  • the encoder 400 divides a set of data from the host device 130 into a plurality of data blocks (the plurality of data blocks are N data blocks DB_ 1 -DB_N (such as data blocks DB_ 1 , DB 2 , . . .
  • the data blocks DB_ 1 -DB_N encodes the data blocks DB_ 1 -DB_N to generate a plurality of parity blocks (the plurality of parity blocks are (A+S+B) parity blocks PB_a, PB_s and PB_b).
  • the size of a data block e.g. each of the data blocks DB_ 1 -DB_N
  • that of a parity block e.g. each of the parity blocks PB_a, PB_s and PB_b
  • the size of the data block can be decided by the designer; for example, 64*64 bits or 192*192 bits.
  • the barrel shifter module 410 may process the data blocks DB_ 1 -DB_N to generate a plurality of partial parity blocks. More particularly, the barrel shifter module 410 respectively shifts the data blocks DB_ 1 -DB_N through a first barrel shifter inside, and adds up the shifted data blocks through an accumulator circuit to obtain a first partial parity block; then, the barrel shifter module 410 respectively shifts the data blocks DB_ 1 -DB_N through a second barrel shifter inside, and adds up the shifted data blocks through the accumulator circuit to obtain a second partial parity block; and the rest may be induced by analogy, where the barrel shifter module 410 totally generates (A+S+B) partial parity blocks.
  • the partial parity blocks may be divided into three portions for different processing, where the first portion comprises A partial parity blocks, the second portion comprises S partial parity blocks, and the third portion comprises B partial parity blocks.
  • the first inverse matrix calculating circuit 420 performs inverse matrix calculating operations (e.g. circular convolution operations and compensation operations) on the A partial parity blocks, to generate A parity blocks PB_a.
  • the calculating circuit 430 then generate S parity blocks PB_s and B parity blocks PB_b according to the A parity blocks PB_a, the S partial parity blocks and the B partial parity blocks.
  • the barrel shifter module 431 may process the A parity blocks PB_a to generate B processed blocks, and the first adjustment circuit 432 may add up the B processed blocks and the B partial parity blocks to generate an adjusted third portion of data.
  • the second inverse matrix calculating circuit 433 then performs the inverse matrix calculating operations on the adjusted third portion of data to generate a first calculation result;
  • the barrel shifter module 435 processes the A parity blocks PB_a to generate S first processed blocks;
  • the barrel shifter module 434 processes the first calculation result to generate S second processed blocks;
  • the second adjustment circuit 436 adds up the S first processed blocks, the S second processed blocks and the S partial parity blocks to generate an adjusted second portion of data.
  • the third inverse matrix calculating circuit 437 then performs the inverse matrix calculating operations on the adjusted second portion of data to generate the S parity blocks PB_s.
  • the barrel shifter module 441 then processes the S parity blocks PB_s to generate B processed blocks;
  • the fourth inverse matrix calculating circuit 442 performs the inverse matrix calculating operations on the B processed blocks to generate a second calculation result;
  • the third adjustment circuit 443 generates the B parity blocks PB_b according to the first calculation result and the second calculation result.
  • the encoder 400 may multiply the data blocks DB_ 1 -DB_N in conjunction with the parity blocks PB_a, PB_s and PB_b by the parity-check matrix in order to determine whether the parity blocks PB_a, PB_s and PB_b are correct. If yes, the flash memory controller 110 will write the data blocks DB_ 1 -DB_N in conjunction with the parity blocks PB_a, PB_s and PB_b into a data page of a block within the flash memory module 120 .
  • the barrel shifter module 410 may correspond to the matrix M shown in FIG. 2 , and the first inverse matrix calculating circuit 420 and the calculating circuit 430 are arranged to generate content that is similar to the inverse matrix K ⁇ 1 shown in FIG. 2 in order to generate the parity blocks PB_a, PB_s and PB_b under a condition that the inverse matrix K ⁇ 1 cannot be found. Additionally, the encoder 400 can greatly reduce the number of circular convolution calculating circuits in the inverse matrix calculating circuit.
  • the third inverse matrix calculating circuit 437 only needs one circular convolution calculating circuit
  • the fourth inverse matrix calculating circuit 442 needs twenty-five circular convolution calculating circuits, where only sixty-seven circular convolution calculating circuits are needed in this embodiment, meaning the hardware costs of the encoder 400 can be greatly reduced.
  • the first inverse matrix calculating circuit 420 can immediately perform the inverse matrix calculating operations on the A partial parity blocks outputted by the barrel shifter module 410 , to generate the A parity blocks and output to back-end circuit (s) in this embodiment. If the following calculating operations performed by the second inverse matrix calculating circuit 433 , the third inverse matrix calculating circuit 437 and the fourth inverse matrix calculating circuit 442 are not complicated, the encoder 400 can continuously output parity blocks to the back-end circuit (s) without delay in order to improve overall performance of the system.
  • FIG. 5 is a flowchart illustrating an encoding method according to an embodiment of the present invention, and referring to FIGS. 1-5 and the descriptions in the above embodiments, the working flow of the decoding method is as follows.
  • Step 500 the flow starts.
  • Step 502 process a plurality of data blocks to generate a plurality of partial parity blocks, where the plurality of partial parity blocks comprise a first portion, a second portion and a third portion.
  • Step 504 perform inverse matrix calculating operations on the first portion to generate a first portion of parity blocks.
  • Step 506 perform the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks, where the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks serve as a plurality of parity blocks generated by the encoder in response to the plurality of data blocks.
  • Step 508 write the plurality of data blocks and the plurality of parity blocks into a flash memory.
  • the encoder of the present invention performs operations by dividing partial parity blocks into three portions in order to reduce the hardware needed for circular convolution calculating circuits in the encoder under a condition that parity blocks can be generated.
  • problems of the related art e.g. high hardware costs

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Quality & Reliability (AREA)
  • Algebra (AREA)
  • Mathematical Physics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Error Detection And Correction (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)
  • Detection And Correction Of Errors (AREA)

Abstract

An encoder of a flash memory controller is provided, which includes a barrel shifter module, an inverse matrix calculating circuit and a calculating circuit. The barrel shifter module processes multiple data blocks to generate multiple partial parity blocks including a first portion, a second portion and a third portion. The inverse matrix calculating circuit performs inverse matrix calculating operations on the first portion to generate a first portion of parity blocks. The calculating circuit performs inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks. The first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks serve as multiple parity blocks generated in response to encoding the data blocks.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention
The present invention is related to encoders, and more particularly, to an encoder for a flash memory controller, an associated encoding method, and an associated flash memory controller.
2. Description of the Prior Art
A general encoder may have a parity-check matrix in order to check whether the parity generated by the encoder is correct. For example, after the encoder encodes data to generate parity (e.g. check code), the encoder may multiply the data and the parity by this parity-check matrix, where if the multiplication result is “0”, the encoding is determined to be correct; otherwise, the encoding is determined to be incorrect. In response to this parity-check matrix, the encoder may have a corresponding parity generator matrix in order to generate appropriate parity. The parity generator matrix is not able to be found under some conditions, however. The encoder may need to perform multiple matrix multiplying operations and/or compensation/adjustment operations in order to generate parity that is similar to the parity generated by the parity generator matrix, and therefore complexity of the encoder increases. More particularly, the aforementioned multiple matrix multiplying operations usually comprise circular convolution calculations, which may greatly increase hardware costs of the encoder.
SUMMARY OF THE INVENTION
An objective of the present invention is to provide an encoder, which is able to reduce the hardware for the circular convolution calculations within the encoder in order to prevent the condition of greatly increasing hardware costs.
In an embodiment of the present invention, an encoder configured in a flash memory controller is disclosed, wherein the encoder comprises a barrel shifter module, a first inverse matrix calculating circuit and a calculating circuit. In the operations of the encoder: the barrel shifter module is arranged to process a plurality of data blocks to generate a plurality of partial parity blocks, wherein the plurality of partial parity blocks comprise a first portion, a second portion and a third portion; the first inverse matrix calculating circuit is coupled to the barrel shifter module, and is arranged to perform inverse matrix calculating operations on the first portion to generate a first portion of parity blocks; the calculating circuit is coupled to the barrel shifter module and the first inverse matrix calculating circuit, and is arranged to perform the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks; wherein the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks serve as a plurality of parity blocks generated by the encoder in response to the plurality of data blocks, and the plurality of data blocks and the plurality of parity blocks are written into a flash memory.
In another embodiment of the present invention, a flash memory controller is disclosed, where the flash memory controller is arranged to access a flash memory module, and the flash memory controller comprises a memory, a microprocessor and an encoder, where the memory is arranged to store a program code, the microprocessor is arranged to execute the program code to control access to the flash memory module, and the encoder is arranged to encode a plurality of data blocks to obtain a plurality of parity blocks. The encoder comprises a barrel shifter module, a first inverse matrix calculating circuit and a calculating circuit. In the operations of the encoder: the barrel shifter module is arranged to process the plurality of data blocks to generate a plurality of partial parity blocks, wherein the plurality of partial parity blocks comprise a first portion, a second portion and a third portion; the first inverse matrix calculating circuit is coupled to the barrel shifter module, and is arranged to perform inverse matrix calculating operations on the first portion to generate a first portion of parity blocks; the calculating circuit is coupled to the barrel shifter module and the first inverse matrix calculating circuit, and is arranged to perform the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks; wherein the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks serve as the plurality of parity blocks generated by the encoder in response to the plurality of data blocks, and the plurality of data blocks and the plurality of parity blocks are written into a flash memory.
In another embodiment of the present invention, an encoding method for a flash memory controller is disclosed, which comprises the following steps: processing a plurality of data blocks to generate a plurality of partial parity blocks, wherein the plurality of partial parity blocks comprise a first portion, a second portion and a third portion; performing inverse matrix calculating operations on the first portion to generate a first portion of parity blocks; performing the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks, wherein the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks serve as a plurality of parity blocks generated by the encoder in response to the plurality of data blocks; and writing the plurality of data blocks and the plurality of parity blocks into a flash memory.
These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a diagram illustrating a memory device according to an embodiment of the present invention.
FIG. 2 is a diagram illustrating a parity-check matrix and a parity generator matrix.
FIG. 3 is a diagram illustrating a matrix according to an embodiment of the present invention.
FIG. 4 is a diagram illustrating an encoder according to an embodiment of the present invention.
FIG. 5 is a flowchart illustrating an encoding method according to an embodiment of the present invention.
 DETAILED DESCRIPTION
FIG. 1 is a diagram illustrating a memory device 100 according to an embodiment of the present invention. The memory device 100 comprises a flash memory module 120 and a flash memory controller 110, and the flash memory controller 110 is arranged to access the flash memory module 120. According to this embodiment, the flash memory controller 110 comprises a microprocessor 112, a read only memory (ROM) 112M, a control logic 114, a buffer memory 116 and an interface logic 118. The ROM 112M is arranged to store a program code 112C, and the microprocessor 112 is arranged to execute the program code 112C to control access to the flash memory module 120. The control logic 114 comprises an encoder 132 and a decoder 134, where the encoder 132 is arranged to encode data that is written into the flash memory module 120 to generate a corresponding check code (or error correction code (ECC)), and the decoder 134 is arranged to decode data that is read out from the flash memory module 120.
Under a typical condition, the flash memory module 120 comprises a plurality of flash memory chips, and each of the plurality of flash memory chips comprises a plurality of blocks. The controller (e.g. the flash memory controller 110 controlled by the microprocessor 112 through executing the program code 112C) performs a copying data operation, an erasing data operation or a combining data operation on the flash memory 120 in the unit of blocks. In addition, a block may record a specific number of data pages, where the controller (e.g. the flash memory controller 110 controlled by the microprocessor 112 through executing the program code 112C) performs a writing data operation on the flash memory module 120 in the unit of data pages.
In practice, the memory controller 110 controlled by the microprocessor 112 through executing the program code 112C may utilize internal components thereof to perform various control operations; for example, utilizing the control logic 114 to control access operations of the flash memory module 120 (more particularly, access operations on at least one block or at least one data page), utilizing the buffer memory 116 to perform required buffer operations, and utilizing the interface logic 118 to communicate with the host device 130.
In an embodiment, the memory device 100 may be a portable memory device (e.g. a memory card conforming to SD/MMC, CF, MS or XD specifications), and the host device 130 may be an electronic device that is connectable with a portable memory device; for example, mobile phones, laptop computers, personal computers, etc. In another embodiment, the memory device 100 may be configured in an electronic device (for example, in a mobile phone, a laptop computer or a personal computer), and the host device 130 may be a processor of this electronic device.
In this embodiment, the encoder 132 is a low-density parity check (LDPC) code encoder circuit, which is able to generate a corresponding parity (e.g. check code) according to data from the host device 130, and the parity generated by the encoder 132 conforms to a parity-check matrix. More particularly, referring to FIG. 2, assuming that the parity-check matrix is a matrix having a size of c*t (where, for example, c=5, t=48, or any other appropriate value), the parity-check matrix may be divided into a left-side matrix M (having a size of c*(t−c)) and a right-side matrix K (having a size of c*c). In order to find a parity generator matrix corresponding to the parity-check matrix, an inverse matrix K−1 of the matrix L is found, and then the inverse matrix K−1 is multiplied by the matrix M to obtain a matrix P, where a transpose matrix of the matrix P may be taken as the parity generator matrix. After finding the transpose matrix of the matrix P, the encoder 132 may multiply the data from the host device 130 by the transpose matrix of the matrix P to obtain a parity corresponding to the data, and the encoder 132 then multiplies both the data and this parity by the parity-check matrix in order to determine whether this parity is correct. For example, if the multiplication result is “0”, the encoding is determined to be correct; otherwise, the encoding is determined to be incorrect. After determining the encoding is correct, the data and the corresponding parity are written into a data page within the flash memory module 120.
It should be noted that each unit within the aforementioned parity-check matrix is a block in practice, and the block may be a square matrix (e.g. a 64*64 matrix or a 192*192 matrix). Thus, the parity-check matrix comprises c*t blocks.
Under some conditions, it might be not easy to find the inverse matrix K−1, and the encoder 132 may therefore need to perform multiple matrix multiplying operations and/or compensation/adjustment operations to obtain content that is similar to the inverse matrix K−1, in order to find the parity generator matrix and generate the parity. The present invention therefore provides a circuit structure which can finish the operations of the encoder 132, which is able to save hardware costs of the encoder as much as possible. It should be noted that the encoding process of the encoder 132 involves many complicated mathematics operations; the main point of the present invention is the design of the circuit structure, and related matrix descriptions and derivation process are omitted, for brevity.
FIG. 3 is a diagram illustrating the matrix K according to an embodiment of the present invention. Rows and columns of the matrix K are respectively divided into three segments, and these three segment respectively comprise A blocks, S blocks and B blocks, where A, S and B are positive integers. In this embodiment, the upper-right region of the matrix K shown in FIG. 3 (such as a region 302) is a blank region, where all values within all blocks within the region 302 are zero. The shading portion such as a region 304 is a non-zero region, where each of the blocks within the region 304 comprises at least one non-zero value. Additionally, other regions of the matrix K are not limited to blank regions or non-zero regions. The encoder 132 shown in the following descriptions is designed based in the matrix K shown in FIG. 3, but the present invention is not limited thereto.
FIG. 4 is a diagram illustrating an encoder 400 according to an embodiment of the present invention, where the encoder 400 may be the encoder 132 shown in FIG. 1. As shown in FIG. 4, the encoder 400 comprises a barrel shifter module 410, a first inverse matrix calculating circuit 420 and a calculating circuit 430, where the calculating 430 comprises three barrel shifter modules 431, 434 and 435, a first adjustment circuit 432, a second inverse matrix calculating circuit 433, a second adjustment circuit 436, a third inverse matrix calculating circuit 437 and a calculating circuit 440, where the calculating circuit 440 comprises a barrel shifter module 441, a fourth inverse matrix calculating circuit 442 and a third adjustment circuit 443. In this embodiment, the barrel shifter modules 410, 431, 434, 435, 441 may be implemented by multiple barrel shifters and multiple accumulator circuits, and the first inverse matrix calculating circuit 420, the second inverse matrix calculating circuit 433, the third inverse matrix calculating circuit 437 and the fourth inverse matrix calculating circuit 442 may be implemented by a circular convolution calculating circuit and a compensation circuit. In this embodiment, the encoder 400 divides a set of data from the host device 130 into a plurality of data blocks (the plurality of data blocks are N data blocks DB_1-DB_N (such as data blocks DB_1, DB2, . . . and DB_N, where N is a positive integer) in this embodiment), and encodes the data blocks DB_1-DB_N to generate a plurality of parity blocks (the plurality of parity blocks are (A+S+B) parity blocks PB_a, PB_s and PB_b). It should be noted that the size of a data block (e.g. each of the data blocks DB_1-DB_N) and that of a parity block (e.g. each of the parity blocks PB_a, PB_s and PB_b) are the same, and the size of the data block can be decided by the designer; for example, 64*64 bits or 192*192 bits.
In the operations of the encoder 400, the barrel shifter module 410 may process the data blocks DB_1-DB_N to generate a plurality of partial parity blocks. More particularly, the barrel shifter module 410 respectively shifts the data blocks DB_1-DB_N through a first barrel shifter inside, and adds up the shifted data blocks through an accumulator circuit to obtain a first partial parity block; then, the barrel shifter module 410 respectively shifts the data blocks DB_1-DB_N through a second barrel shifter inside, and adds up the shifted data blocks through the accumulator circuit to obtain a second partial parity block; and the rest may be induced by analogy, where the barrel shifter module 410 totally generates (A+S+B) partial parity blocks.
The partial parity blocks may be divided into three portions for different processing, where the first portion comprises A partial parity blocks, the second portion comprises S partial parity blocks, and the third portion comprises B partial parity blocks. In the operations of the first inverse matrix calculating circuit 420, the first inverse matrix calculating circuit 420 performs inverse matrix calculating operations (e.g. circular convolution operations and compensation operations) on the A partial parity blocks, to generate A parity blocks PB_a. The calculating circuit 430 then generate S parity blocks PB_s and B parity blocks PB_b according to the A parity blocks PB_a, the S partial parity blocks and the B partial parity blocks.
In detail, the barrel shifter module 431 may process the A parity blocks PB_a to generate B processed blocks, and the first adjustment circuit 432 may add up the B processed blocks and the B partial parity blocks to generate an adjusted third portion of data. The second inverse matrix calculating circuit 433 then performs the inverse matrix calculating operations on the adjusted third portion of data to generate a first calculation result; the barrel shifter module 435 processes the A parity blocks PB_a to generate S first processed blocks; the barrel shifter module 434 processes the first calculation result to generate S second processed blocks; and the second adjustment circuit 436 adds up the S first processed blocks, the S second processed blocks and the S partial parity blocks to generate an adjusted second portion of data. The third inverse matrix calculating circuit 437 then performs the inverse matrix calculating operations on the adjusted second portion of data to generate the S parity blocks PB_s. The barrel shifter module 441 then processes the S parity blocks PB_s to generate B processed blocks; the fourth inverse matrix calculating circuit 442 performs the inverse matrix calculating operations on the B processed blocks to generate a second calculation result; and the third adjustment circuit 443 generates the B parity blocks PB_b according to the first calculation result and the second calculation result.
After the parity blocks PB_a, PB_s and PB_b are generated, the encoder 400 may multiply the data blocks DB_1-DB_N in conjunction with the parity blocks PB_a, PB_s and PB_b by the parity-check matrix in order to determine whether the parity blocks PB_a, PB_s and PB_b are correct. If yes, the flash memory controller 110 will write the data blocks DB_1-DB_N in conjunction with the parity blocks PB_a, PB_s and PB_b into a data page of a block within the flash memory module 120.
In the circuit structure shown in FIG. 4, the barrel shifter module 410 may correspond to the matrix M shown in FIG. 2, and the first inverse matrix calculating circuit 420 and the calculating circuit 430 are arranged to generate content that is similar to the inverse matrix K−1 shown in FIG. 2 in order to generate the parity blocks PB_a, PB_s and PB_b under a condition that the inverse matrix K−1 cannot be found. Additionally, the encoder 400 can greatly reduce the number of circular convolution calculating circuits in the inverse matrix calculating circuit. For example, assuming that K is a 10*10 matrix, and A=4, S=1, B=5, one hundred circular convolution calculating circuits are needed for the encoder of the related art; in this embodiment, the first inverse matrix calculating circuit 420 needs sixteen (a=4, 4*4) circular convolution calculating circuits, the second inverse matrix calculating circuit 433 needs twenty-five (b=5, 5*5) circular convolution calculating circuits, the third inverse matrix calculating circuit 437 only needs one circular convolution calculating circuit, and the fourth inverse matrix calculating circuit 442 needs twenty-five circular convolution calculating circuits, where only sixty-seven circular convolution calculating circuits are needed in this embodiment, meaning the hardware costs of the encoder 400 can be greatly reduced.
Additionally, the first inverse matrix calculating circuit 420 can immediately perform the inverse matrix calculating operations on the A partial parity blocks outputted by the barrel shifter module 410, to generate the A parity blocks and output to back-end circuit (s) in this embodiment. If the following calculating operations performed by the second inverse matrix calculating circuit 433, the third inverse matrix calculating circuit 437 and the fourth inverse matrix calculating circuit 442 are not complicated, the encoder 400 can continuously output parity blocks to the back-end circuit (s) without delay in order to improve overall performance of the system.
Referring to FIG. 5, which is a flowchart illustrating an encoding method according to an embodiment of the present invention, and referring to FIGS. 1-5 and the descriptions in the above embodiments, the working flow of the decoding method is as follows.
Step 500: the flow starts.
Step 502: process a plurality of data blocks to generate a plurality of partial parity blocks, where the plurality of partial parity blocks comprise a first portion, a second portion and a third portion.
Step 504: perform inverse matrix calculating operations on the first portion to generate a first portion of parity blocks.
Step 506: perform the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks, where the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks serve as a plurality of parity blocks generated by the encoder in response to the plurality of data blocks.
Step 508: write the plurality of data blocks and the plurality of parity blocks into a flash memory.
Briefly summarized, the encoder of the present invention performs operations by dividing partial parity blocks into three portions in order to reduce the hardware needed for circular convolution calculating circuits in the encoder under a condition that parity blocks can be generated. Thus, problems of the related art (e.g. high hardware costs) can be avoided.
Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims.

Claims (15)

What is claimed is:
1. An encoder configured in a flash memory controller, comprising:
a barrel shifter module, arranged to process a plurality of data blocks to generate a plurality of partial parity blocks, wherein each of the partial parity blocks is generated by shifting the data blocks and adding up shifted data blocks, and the plurality of partial parity blocks collectively comprise a first portion, a second portion and a third portion;
a first inverse matrix calculating circuit, coupled to the barrel shifter module, arranged to perform inverse matrix calculating operations on the first portion of the partial parity blocks to generate a first portion of parity blocks; and
a calculating circuit, coupled to the barrel shifter module and the first inverse matrix calculating circuit, arranged to perform inverse matrix calculating operations on the second portion of the partial parity blocks and the third portion of the partial parity blocks according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks, respectively;
wherein the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks collectively serve as a plurality of parity blocks generated by the encoder in response to the plurality of data blocks, and the plurality of data blocks and the plurality of parity blocks are written into a flash memory;
wherein the calculating circuit comprises:
a first adjustment circuit, coupled to the first inverse matrix calculating circuit, arranged to adjust the third portion of the plurality of partial parity blocks according to the first portion of the parity blocks, to generate an adjusted third portion;
a second inverse matrix calculating circuit, coupled to the first adjustment circuit, arranged to perform the inverse matrix calculating operations to generate a first calculation result;
a second adjustment circuit, coupled to the barrel shifter module, the first inverse matrix calculating circuit and the second inverse matrix calculating circuit, arranged to adjust the second portion of the plurality of partial parity blocks according to the first portion of the parity blocks and the first calculation result, to generate an adjusted second portion;
a third inverse matrix calculating circuit, coupled to the second adjustment circuit, arranged to perform the inverse matrix calculating operations on the adjusted second portion to generate the second portion of the parity blocks; and
another calculating circuit, coupled to the second inverse matrix calculating circuit and the third inverse matrix calculating circuit, arranged to generate the third portion of the parity blocks according to the first calculation result and the second portion of the parity blocks.
2. The encoder of claim 1, wherein the first portion of the parity blocks comprises A blocks, the third portion of the plurality of partial parity blocks comprises B partial parity blocks, and the encoder further comprises:
another barrel shifter module, coupled to the first inverse matrix calculating circuit and the first adjustment circuit, arranged to process the first portion of the parity blocks to generate B processed blocks;
wherein the first adjustment circuit adds up the B processed blocks and the B partial parity blocks to generate the adjusted third portion, and A and B are positive integers.
3. The encoder of claim 1, wherein the first portion of the parity blocks comprises A blocks, the first calculation result comprises B blocks, the third portion of the plurality of partial parity blocks comprises S partial parity blocks, and the encoder further comprises:
another barrel shifter module, arranged to process the first portion of the parity blocks to generate S first processed blocks, and process the first calculation result to generate S second processed blocks;
wherein the second adjustment circuit adds up the S first processed blocks, the S second processed blocks and the S partial parity blocks to generate the adjusted second portion, and A, S and B are positive integers.
4. The encoder of claim 1, wherein said another calculating circuit comprises:
a fourth inverse matrix calculating circuit, coupled to the third inverse matrix calculating circuit, arranged to perform inverse matrix calculating operations according to the second portion of the parity blocks, to generate a second calculation result; and
a third adjustment circuit, coupled to the second inverse matrix calculating circuit and the fourth inverse matrix calculating circuit, arranged to generate the third portion of the parity blocks according to the first calculation result and the second calculation result.
5. The encoder of claim 4, wherein the second portion of the parity blocks comprises S blocks, the first calculation result comprises B blocks, and the encoder further comprises:
another barrel shifter module, coupled to the third inverse matrix calculating circuit, arranged to process the second portion of the parity blocks to generate B processed blocks;
wherein the third adjustment circuit adds up the B processed blocks and the B blocks to generate the third portion of the parity blocks, and S and B are positive integers.
6. The encoder of claim 1, which is a low-density parity check (LDPC) code encoder circuit.
7. A flash memory controller, arranged to access a flash memory module, comprising:
a memory, arranged to store a program code;
a microprocessor, arranged to execute the program code to control access to the flash memory module; and
an encoder, comprising:
a barrel shifter module, arranged to process a plurality of data blocks to generate a plurality of partial parity blocks, wherein each of the partial parity blocks is generated by shifting the data blocks and adding up shifted data blocks, and the plurality of partial parity blocks collectively comprise a first portion, a second portion and a third portion;
a first inverse matrix calculating circuit, coupled to the barrel shifter module, arranged to perform inverse matrix calculating operations on the first portion of the partial parity blocks to generate a first portion of parity blocks; and
a calculating circuit, coupled to the barrel shifter module and the first inverse matrix calculating circuit, arranged to perform inverse matrix calculating operations on the second portion of the partial parity blocks and the third portion of the partial parity blocks according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks;
wherein the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks collectively serve as a plurality of parity blocks generated by the encoder in response to the plurality of data blocks, and the plurality of data blocks and the plurality of parity blocks are written into the flash memory module;
wherein the calculating circuit comprises:
a first adjustment circuit, coupled to the first inverse matrix calculating circuit, arranged to adjust the third portion of the plurality of partial parity blocks according to the first portion of the parity blocks, to generate an adjusted third portion;
a second inverse matrix calculating circuit, coupled to the first adjustment circuit, arranged to perform the inverse matrix calculating operations to generate a first calculation result;
a second adjustment circuit, coupled to the barrel shifter module, the first inverse matrix calculating circuit and the second inverse matrix calculating circuit, arranged to adjust the second portion of the plurality of partial parity blocks according to the first portion of the parity blocks and the first calculation result, to generate an adjusted second portion;
a third inverse matrix calculating circuit, coupled to the second adjustment circuit, arranged to perform inverse matrix calculating operations on the adjusted second portion to generate the second portion of the parity blocks; and
another calculating circuit, coupled to the second inverse matrix calculating circuit and the third inverse matrix calculating circuit, arranged to generate the third portion of the parity blocks according to the first calculation result and the second portion of the parity blocks.
8. The flash memory controller of claim 7, wherein the first portion of the parity blocks comprises A blocks, the third portion of the plurality of partial parity blocks comprises B partial parity blocks, and the encoder further comprises:
another barrel shifter module, coupled to the first inverse matrix calculating circuit and the first adjustment circuit, arranged to process the first portion of the parity blocks to generate B processed blocks;
wherein the first adjustment circuit adds up the B processed blocks and the B partial parity blocks to generate the adjusted third portion, and A and B are positive integers.
9. The flash memory controller of claim 7, wherein the first portion of the parity blocks comprises A blocks, the first calculation result comprises B blocks, the third portion of the plurality of partial parity blocks comprises S partial parity blocks, and the encoder further comprises:
another barrel shifter module, arranged to process the first portion of the parity blocks to generate S first processed blocks, and process the first calculation result to generate S second processed blocks;
wherein the second adjustment circuit adds up the S first processed blocks, the S second processed blocks and the S partial parity blocks to generate the adjusted second portion, and A, S and B are positive integers.
10. The flash memory controller of claim 7, wherein said another calculating circuit comprises:
a fourth inverse matrix calculating circuit, coupled to the third inverse matrix calculating circuit, arranged to perform inverse matrix calculating operations according to the second portion of the parity blocks, to generate a second calculation result; and
a third adjustment circuit, coupled to the second inverse matrix calculating circuit and the fourth inverse matrix calculating circuit, arranged to generate the third portion of the parity blocks according to the first calculation result and the second calculation result.
11. The flash memory controller of claim 10, wherein the second portion of the parity blocks comprises S blocks, the first calculation result comprises B blocks, and the encoder further comprises:
another barrel shifter module, coupled to the third inverse matrix calculating circuit, arranged to process the second portion of the parity blocks to generate B processed blocks;
wherein the third adjustment circuit adds up the B processed blocks and the B blocks to generate the third portion of the parity blocks, and S and B are positive integers.
12. The flash memory controller of claim 7, wherein the encoder is a low-density parity check (LDPC) code encoder circuit.
13. An encoding method for a flash memory controller, comprising:
processing a plurality of data blocks to generate a plurality of partial parity blocks, wherein each of the partial parity blocks is generated by shifting the data blocks and adding up shifted data blocks, and the plurality of partial parity blocks collectively comprise a first portion, a second portion and a third portion;
performing inverse matrix calculating operations on the first portion of the partial parity blocks to generate a first portion of parity blocks;
performing inverse matrix calculating operations on the second portion of the partial parity blocks and the third portion of the partial parity blocks according to the first portion of the parity blocks, to generate a second portion of the parity blocks and a third portion of the parity blocks, wherein the first portion of the parity blocks, the second portion of the parity blocks, and the third portion of the parity blocks collectively serve as a plurality of parity blocks generated by the encoder in response to the plurality of data blocks; and
writing the plurality of data blocks and the plurality of parity blocks into a flash memory;
wherein the step of performing the inverse matrix calculating operations on the second portion and the third portion according to the first portion of the parity blocks to generate the second portion of the parity blocks and the third portion of the parity blocks comprises:
adjusting the third portion of the plurality of partial parity blocks according to the first portion of the parity blocks, to generate an adjusted third portion;
performing inverse matrix calculating operations to generate a first calculation result;
adjusting the second portion of the plurality of partial parity blocks according to the first portion of the parity blocks and the first calculation result, to generate an adjusted second portion;
performing inverse matrix calculating operations on the adjusted second portion to generate the second portion of the parity blocks; and
generating the third portion of the parity blocks according to the first calculation result and the second portion of the parity blocks.
14. The encoder of claim 13, wherein the step of generating the third portion of the parity blocks according to the first calculation result and the second portion of the parity blocks comprises:
performing inverse matrix calculating operations according to the second portion of the parity blocks, to generate a second calculation result; and
generating the third portion of the parity blocks according to the first calculation result and the second calculation result.
15. The encoding method of claim 13, which is executed by a low-density parity check (LDPC) code encoder circuit configured in the flash memory controller.
US16/273,093 2018-10-12 2019-02-11 Encoder, associated encoding method and flash memory controller Active 2039-03-08 US10810120B2 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
TW107136009A 2018-10-12
TW107136009 2018-10-12
TW107136009A TWI677878B (en) 2018-10-12 2018-10-12 Encoder and associated encoding method and flash memory controller

Publications (2)

Publication Number Publication Date
US20200117591A1 US20200117591A1 (en) 2020-04-16
US10810120B2 true US10810120B2 (en) 2020-10-20

Family

ID=69189015

Family Applications (1)

Application Number Title Priority Date Filing Date
US16/273,093 Active 2039-03-08 US10810120B2 (en) 2018-10-12 2019-02-11 Encoder, associated encoding method and flash memory controller

Country Status (3)

Country Link
US (1) US10810120B2 (en)
CN (1) CN111049529B (en)
TW (1) TWI677878B (en)

Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7162684B2 (en) 2003-01-27 2007-01-09 Texas Instruments Incorporated Efficient encoder for low-density-parity-check codes
US20070283218A1 (en) 2006-04-19 2007-12-06 Gopalakrishnan Subramanyam H Low density parity check code decoder
US20090259915A1 (en) * 2004-10-12 2009-10-15 Michael Livshitz Structured low-density parity-check (ldpc) code
US20100100788A1 (en) * 2008-10-17 2010-04-22 Shaohua Yang Programmable quasi-cyclic low-density parity check (QC LDPC) encoder for read channel
US20100251059A1 (en) 2007-07-04 2010-09-30 Nxp B.V. Shuffled ldpc decoding
US20110191650A1 (en) * 2008-10-08 2011-08-04 Takashi Yokokawa Cyclic Shift Device, Cyclic Shift Method, LDPC Decoding Device, Television Receiver, and Reception System
CN102340318A (en) 2011-10-08 2012-02-01 中国科学院上海微系统与信息技术研究所 Method for encoding quasi-cycle LDPC (Low Density Parity Check) codes
US8151160B1 (en) 2008-05-09 2012-04-03 Lsi Corporation Configurable low-density parity-check decoder for LDPC codes of arbitrary block size and method of configuring the same
US20130275827A1 (en) * 2012-04-12 2013-10-17 Lsi Corporation Multi-Section Non-Binary LDPC Decoder
US20150026536A1 (en) * 2013-07-19 2015-01-22 Lsi Corporation Data Decoder With Trapping Set Flip Bit Mapper
US20150229331A1 (en) * 2014-02-10 2015-08-13 Lsi Corporation Systems and Methods for Area Efficient Data Encoding
US20170063400A1 (en) * 2015-08-31 2017-03-02 Sandisk Technologies Inc. On-the-fly syndrome and syndrome weight computation architecture for ldpc decoding
US20170149445A1 (en) 2015-11-23 2017-05-25 Avago Technologies General Ip (Singapore) Pte. Ltd Irregular Low Density Parity Check Processing System With Non-Uniform Scaling
US20180034484A1 (en) * 2016-07-29 2018-02-01 Western Digital Technologies, Inc. Non-binary decoding using tensor product transforms
WO2018041843A1 (en) 2016-08-29 2018-03-08 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Encoder for Encoding, and Decoder for Decoding, a Digital Image Representation into a Data Stream using Indicating a Number of Leading Zero Bit Planes
US20180246783A1 (en) 2016-03-04 2018-08-30 Sandisk Technologies Llc Storage System and Method for Handling a Burst of Errors

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5203717B2 (en) * 2007-12-19 2013-06-05 パナソニック株式会社 Encoder, decoder, encoding method, and decoding method
CN101621299B (en) * 2008-07-04 2013-01-30 华为技术有限公司 Burst correcting method, equipment and device
CN101489135B (en) * 2009-01-22 2011-04-27 航天恒星科技有限公司 Encoder convenient for LDPC long code implementation on FPGA and encoding method
TWI456579B (en) * 2010-03-26 2014-10-11 Silicon Motion Inc Method for enhancing error correction capability, and associated memory device and controller thereof
US8739001B2 (en) * 2011-04-23 2014-05-27 Analogies Sa LDPC encoding and decoding techniques
TWI520501B (en) * 2012-06-07 2016-02-01 威盛電子股份有限公司 Memory controller
CN103036577B (en) * 2012-12-28 2015-09-30 东南大学 A kind of low-density checksum LDPC code coding circuit structure of low complex degree
US10110255B2 (en) * 2016-04-27 2018-10-23 Silicon Motion Inc. Method for accessing flash memory module and associated flash memory controller and memory device
US10289487B2 (en) * 2016-04-27 2019-05-14 Silicon Motion Inc. Method for accessing flash memory module and associated flash memory controller and memory device

Patent Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7162684B2 (en) 2003-01-27 2007-01-09 Texas Instruments Incorporated Efficient encoder for low-density-parity-check codes
US20090259915A1 (en) * 2004-10-12 2009-10-15 Michael Livshitz Structured low-density parity-check (ldpc) code
US20070283218A1 (en) 2006-04-19 2007-12-06 Gopalakrishnan Subramanyam H Low density parity check code decoder
US20100251059A1 (en) 2007-07-04 2010-09-30 Nxp B.V. Shuffled ldpc decoding
US8151160B1 (en) 2008-05-09 2012-04-03 Lsi Corporation Configurable low-density parity-check decoder for LDPC codes of arbitrary block size and method of configuring the same
US20110191650A1 (en) * 2008-10-08 2011-08-04 Takashi Yokokawa Cyclic Shift Device, Cyclic Shift Method, LDPC Decoding Device, Television Receiver, and Reception System
US8281214B2 (en) 2008-10-17 2012-10-02 Lsi Corporation Programmable quasi-cyclic low-density parity check (QC LDPC) encoder for read channel
US20100100788A1 (en) * 2008-10-17 2010-04-22 Shaohua Yang Programmable quasi-cyclic low-density parity check (QC LDPC) encoder for read channel
CN102340318A (en) 2011-10-08 2012-02-01 中国科学院上海微系统与信息技术研究所 Method for encoding quasi-cycle LDPC (Low Density Parity Check) codes
US20130275827A1 (en) * 2012-04-12 2013-10-17 Lsi Corporation Multi-Section Non-Binary LDPC Decoder
US20150026536A1 (en) * 2013-07-19 2015-01-22 Lsi Corporation Data Decoder With Trapping Set Flip Bit Mapper
US20150229331A1 (en) * 2014-02-10 2015-08-13 Lsi Corporation Systems and Methods for Area Efficient Data Encoding
US20170063400A1 (en) * 2015-08-31 2017-03-02 Sandisk Technologies Inc. On-the-fly syndrome and syndrome weight computation architecture for ldpc decoding
US20170149445A1 (en) 2015-11-23 2017-05-25 Avago Technologies General Ip (Singapore) Pte. Ltd Irregular Low Density Parity Check Processing System With Non-Uniform Scaling
US20180246783A1 (en) 2016-03-04 2018-08-30 Sandisk Technologies Llc Storage System and Method for Handling a Burst of Errors
US20180034484A1 (en) * 2016-07-29 2018-02-01 Western Digital Technologies, Inc. Non-binary decoding using tensor product transforms
WO2018041843A1 (en) 2016-08-29 2018-03-08 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Encoder for Encoding, and Decoder for Decoding, a Digital Image Representation into a Data Stream using Indicating a Number of Leading Zero Bit Planes

Also Published As

Publication number Publication date
US20200117591A1 (en) 2020-04-16
CN111049529A (en) 2020-04-21
TWI677878B (en) 2019-11-21
CN111049529B (en) 2023-03-28
TW202015063A (en) 2020-04-16

Similar Documents

Publication Publication Date Title
US10892776B1 (en) Memory controller and method of accessing flash memory
US10958292B2 (en) Encoder, associated encoding method and flash memory controller utilizing divided partial parity blocks for circulant convolution calculations
US11115064B2 (en) Error correction decoder and memory system having the same
US10938417B2 (en) Flash memory controller and encoding circuit and decoding circuit within flash memory controller
US20200119754A1 (en) Error correction circuit, and memory controller having the error correction circuit and memory system having the memory controller
US20160266971A1 (en) Memory system, memory controller and memory control method
US9304851B2 (en) Decoding with log likelihood ratios stored in a controller
US9236886B1 (en) Universal and reconfigurable QC-LDPC encoder
KR20180010447A (en) Controller, semiconductor memory system and operating method thereof
US20210036719A1 (en) Error correction circuit, memory controller having error correction circuit, and memory system having memory controller
TWI665678B (en) Encoder and associated encoding method and flash memory controller
US20190324851A1 (en) Decoding method and associated flash memory controller and electronic device
US10810120B2 (en) Encoder, associated encoding method and flash memory controller
US10700707B2 (en) Circuit for transforming parity-check matrix of QC-LDPC code, error correction circuit having the same, and method of operating the same
CN108665940B (en) ECC encoding circuit, decoding circuit and memory controller
US11929764B2 (en) Encoder and flash memory controller
TWI711279B (en) Encoder and associated encoding method and flash memory controller
US20210141730A1 (en) Command Interface and Pre-Fetch Architecture
TWI759672B (en) Decoding method and associated flash memory controller and electronic device
CN113590377A (en) Decoding device, decoding method, storage medium and computer equipment
TW202118237A (en) Flash memory controller and encoding circuit within flash memory controller

Legal Events

Date Code Title Description
AS Assignment

Owner name: SILICON MOTION INC., TAIWAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KUO, SHIUAN-HAO;REEL/FRAME:048299/0649

Effective date: 20190131

FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STCF Information on status: patent grant

Free format text: PATENTED CASE

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 4