TWI363500B - Decoding method and system for low-density parity check code - Google Patents

Description

1363500 31 (43-12) and 18 (61-43). A6|[k-1], A12[k-l]&A is read. Asi[k-ll, A12[k-1] and A in phase 0, required for linear block code (:<0) decoding «[k-ι] from FIFO-O, FIFO-1 and FIFO respectively -2 Take it in the middle. λ61Μ'λ12Μ and λα]] are also stored in stage (i) in milk (f) (9) and U0 of REG1, respectively. In the order heat, i ^ ^ ^ ____"

Since all lengths of FIFO-1 and FIFO-2 are greater than 5' in the memory block Mb°a HFO-O, these FIFQs* are empty during the five-level read decoding process. Therefore, in the memory area, there is no memory access barrier in MB:. Now consider the memory block (4), which is dangerous when storing secrets. At first, in the memory block mb?FiFi〇_〇, FIF (M and FffO-2 are 42, 52 and 2. The length of nF〇2 is less than 5, which means that the FIFO-2 word is in the absence. In addition, in the five decoding stages, we must update the bit node and the probability of the bit node twice. For this problem, we will discuss the solution below. Figure 9A reveals the structure of the memory block. In addition to the following differences, the structure of the memory block (4) is the same as that of the memory block. In the memory block MB: and ΜΒ;., FIF (10) and FIF (the round of M is derived from the output of Qing and REG1 respectively) However, in order to avoid the valueless phenomenon of f-positive 2 in the pipeline decoding, in the memory block MB1, the input of nFQ_2 is obtained from the view (10) instead of the output of the job 2. In the memory block mb And mb?, REG0, REG1 and REG2 are divided into FIFai, FIFa2 and FIF(10) Na. Fine, in the memory block, there is an input pipeline that provides information to U3 of REG1. With this, we can UQ, m and U2 of 拙(1) are treated as extension buffers for FIFO 2 during five-stage decoding. The structure disclosed in Figure 9 is decoded in Figure 15

Claims (1)

1363500 101 years Z 〖fg correction replacement page VII, the scope of application for patents: 1. A decoding method for low-density parity check code, comprising: obtaining a series of parity check matrix of a series of block codes; Checking the matrix to obtain an identity parity check matrix; dividing the identity parity check matrix into an odd parity check matrix and an even parity check matrix, wherein the odd parity check matrix is composed of the identity parity check matrix An odd-numbered column consisting of the even-numbered columns of the identical parity check matrix; and decoding the series of block codes according to the odd-numbered parity check matrix and the even-numbered parity check matrix. A 2 application full-time enclosure f 1 excerpt decoding green, the towel according to the odd number 惶 special parity check _ and _ number financial check matrix to solve the series of block code steps include: according to the even parity parity check matrix Decoding the block codes to obtain an additional value for providing the first series to enable decoding of the block codes using the first series of parity check matrices according to the odd 3 block codes to obtain a number Constant odd furnace check _ decoding yarn outside the value according to the additional value of the even. - The block code enables (4) the second series. 3. The parity check as described in item 2 of the patent application scope and the parity parity m' are based on the even-numbered constant block code. Decoding the system 4 in a ~~ matrix, as in the method of claiming a plurality of bit nodes of the de-checking node described in the third item of claim 3, the step-by-step will include - the second indicator sub-set, thereby The second indicator 2 - the first indicator set and the person set include corresponding to the identity parity 21 1363500 .... 101 years of the month if the correction of the replacement page row has the weight 2 of the bit nodes - only The display-person set includes another part of the bit nodes. μ The method of solving the mother described in item 4, wherein the plurality of coding bits of the series of block codes are the parity check heads of the second index = Shen et al = transport and odd odds: according to the - The decoding method described in item 1 of the inspection section further includes, in addition to - the second indicator sub-set, from the set of parity indicators such as the "dip-person set check", including the bit nodes (four) points And the decoding method according to the sixth aspect, wherein the decoding method according to the sixth aspect, the step of detecting the parity check matrix block code according to the odd matrix and the even value includes: decoding a parity check matrix such as ψ '71 The value of the first series of block codes is obtained by the first-(four)=value parity: and the matrix is decoded to decode the block codes, so that the block codes are decoded according to the odd parity check matrix to obtain a block code. The additional value of the second series is provided to make the extra value of the (10) according to the even number of gambling. '申=\ circumference 7th shape, the odd parity parity check matrix and the (four) material parity check = a value of the second (four) extra value transcode the bit nodes on the block code It is executed in part, which is indicated by the second indicator set. 22 1363500 101 i month < day correction replacement page wherein the decoding method described in the third paragraph of the patent application is pipelined for decoding. H), in the low density parity check code m system, which is suitable for decoding and having a parity check code of a parity check matrix, the odd Newcha matrix can be divided into a plurality of block block rows, and from the parity check matrix The Dependent-Valued Check Matrix 'is capable of being divided into odd-odd-transitive odd-check matrices and even-numbered 惶 parity check scales, where the odd-phase check matrix is composed of odd-numbered columns of parity check matrices such as values, and The even parity check matrix is composed of even columns of the odd parity check matrix, and the decoding system includes: a first memory group storing corresponding probability values; and a plurality of after-the-first memories in the block rows The volume group 'stores a plurality of check nodes from the plurality of check nodes to the plurality of bit nodes to the bit node information; and a processing device electrically coupled to the first memory group and the second memory group And decoding a plurality of block codes of the low density parity check code according to the odd parity check matrix and the even parity check matrix. The decoding system of claim 10, wherein the processing device comprises: a row-to-column module electrically coupled to the first memory bank to read from the first memory group Taking at least one of the after-effect values and configuring the read probability, the value is configured into a basic form; a check node to the bit node information reading module, and electrically connecting to the third-order memory The group is configured to read the check nodes to the bit node information; ^ a check node to a bit node information update module, which includes a plurality of check nodes to the bit node information update unit, and is electrically coupled to the row to The column module and the check node to the bit node information reading module to accept the column basic form 23 1363500 _ 101 years > month fr day correction replacement area rate health read to find some check ^ secret The check points to the bit nodes f update unit use the first = one of the bit nodes to the plurality of matrices 'H' of the check nodes and the bit nodes correspond to the even parity check Moment ί - 仃, another part of the inspection The node-to-bit node information update i to the parity check of the record node: and the other bit node corresponds to the odd difference calculation module, and the electrical light contact update module, the difference calculation mode The group includes to the === point-to-bit node information update mode_output to calculate a new one, that is, the point-to-point 4 point information and the new column basis form after-effect probability value; Up to the difference calculation mode, the first-memory group is configured to configure the new column basis form after-effect rate value; a new after-effect probability value stored in the first memory group; and - checking the node recording element section The suffocating writes the contiguous group computing module and the second memory group to accept the new check == node information and the new check node to the bit node information; 乂 = memory group. 12. The depletion system as described in claim U, wherein the memory group includes: ^ 〇 & a plurality of first memory blocks, each of the first memory blocks corresponding to one of the block rows And the plurality of register slots, each of the register slots includes at least one register and is configured to store the after-effect values of the (four) silk-to-four (four) block read. 13. If the scope of the patent application is mentioned in the scope of the patent, the first record 24 The memory group includes: a plurality of first memory blocks, each of the ones of the block lines of the probability value of the pulp storage corresponding to the plurality of register files, each of which is temporarily used for storing The first block reads m to ^ register 14, the solution as described in claim 13 of the patent scope. The first memory block corresponds to one of the registers; the system 'one of the The event probability values read by the memory blocks are stored on the first temporary register file. The sub-master corresponds to one of the groups of memory groups as described in claim 1G of the patent application, which is configured to be suitable for pipeline solution; the 'nth: record is divided into the stage of the number of silents. 'And this pipeline block, as described in claim 15 of the scope of the memory group includes: 焉 system, wherein the first plurality of first-story blocks, each of the first - note - these The block probability value of the event line; and 1, in a plurality of temporary storage n files, each of the registers of the scratchpad and the secret storage from the first (匕 (four) pre-number of values. The money block reads the after-sales machine H material _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ The area=the machine: when the number of turns is less than the predetermined number, the resistance is read from one of the previous storage areas of the storage area=the machine is stored in the previous storage area: near the end storage area The stored probability values of the after-sales are stored by the U.S. - In the previous register file; and ·. _ The temporary output of the 11 files depends on the temporary storage of the t-soft-point temporary piracy The device, wherein the end point of the plurality of register memory afterwards two probability values read from the end of the storage region. β and storage 18, as claimed in the patent scope of the 1G item of the decoding system, a f body group configuration (4) problem solving _ code refueling parity parity: check code, the silky phase of the code with a shirt _ Rate and code length. =1: The decoding system described in claim 18, wherein the first-spot-r memory block stores each of the first memory blocks corresponding to the probability value of ί $ "τ r and Each of the first memory blocks is divided into a predetermined number of one of the maximum weights of each of the low-density parity check codes; and a flat = one register is used for each of the temporary storage blocks The program file includes at least one temporary write and is used for storing the configuration from the first-story block: the solution of the body circumference, the solution of the second item, the first-time ===-type block code, and the tube The decoding system of claim 20, wherein the first-complex number of first memory blocks, each of the ▲-only the block lines of the after-effects=remember block storage corresponding to the block is Divided into the predetermined number of storage areas: Zhongyi District Replica I: Corresponding to the parity check matrix of the same line - 26 9 13635 〇〇. . ------- 101 February K"曰Revision replacement page " a plurality of scratchpad files, each of the scratchpad files including at least the pre-register and for storing from the first § memory blocks Some of the post-machine values. 22. The decoding system of claim 21, wherein each of the first memory blocks is divided into a plurality of storage areas, one of the storage areas being a second end storage area, and when stored in the cake, When the number of the after-storage areas of the storage area is less than the predetermined number, the "copy rate value" stored in the storage area of the storage area is stored in the previous storage area. The after-the-fact probability values are stored in the storage area, and one of the factory-capture files is stored in the temporary register; and the output of the first (1) temporary storage file is stored in the The temporary show is at tb, and the deposit of the II lion - (4) is the probability value of the after-storage read from the end point storage area of the δH. Although it is stored 27 1363500 = . 101 years z month (Γ曰Revised replacement page / · - C , designated representative figure " (1) The representative representative picture of this case is: (3) picture. (2) The symbol of the representative figure is simple: 30: Decoder 300: After-effect probability memory module 310: R memory module 320: row-to-column module 322: check node to bit node information reading module 324:, CVMU even layer 326: CVMU odd layer 328: Difference calculation module 330: column-to-row module 332: check node to bit node information writing module 5. If there is a chemical formula in this case, please disclose the chemical formula that best shows the characteristics of the invention: