EP3972134B1 - Iterative decoder with adaptive decoding parameters for spatially coupled ldpc codes - Google Patents
Iterative decoder with adaptive decoding parameters for spatially coupled ldpc codes Download PDFInfo
- Publication number
- EP3972134B1 EP3972134B1 EP19932351.0A EP19932351A EP3972134B1 EP 3972134 B1 EP3972134 B1 EP 3972134B1 EP 19932351 A EP19932351 A EP 19932351A EP 3972134 B1 EP3972134 B1 EP 3972134B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- decoding
- error correction
- decoder
- ldpc code
- spatially coupled
- 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
Links
- 230000003044 adaptive effect Effects 0.000 title 1
- 238000010586 diagram Methods 0.000 description 24
- 238000000034 method Methods 0.000 description 14
- 239000011159 matrix material Substances 0.000 description 13
- 238000013500 data storage Methods 0.000 description 11
- 230000005540 biological transmission Effects 0.000 description 7
- 238000004891 communication Methods 0.000 description 7
- 230000009467 reduction Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 125000004122 cyclic group Chemical class 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- 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
- H03M13/1105—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/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
- H03M13/1148—Structural properties of the code parity-check or generator matrix
- H03M13/1154—Low-density parity-check convolutional codes [LDPC-CC]
-
- 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
- H03M13/1105—Decoding
- H03M13/1128—Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations
-
- 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
- H03M13/1148—Structural properties of the code parity-check or generator matrix
-
- 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/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
- H03M13/353—Adaptation to the channel
-
- 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/3723—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using means or methods for the initialisation of the decoder
-
- 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/3746—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with iterative 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/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/612—Aspects specific to channel or signal-to-noise ratio estimation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/20—Arrangements for detecting or preventing errors in the information received using signal quality detector
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Description
- The present invention relates to a decoding apparatus that performs error correction decoding, to a control ciruit, and to a storage medium.
- Error-correcting codes are techniques used in wired communication systems, wireless communication systems, storage devices, etc. Specifically, error-correcting codes are techniques to add redundant bits to digital data to be sent out at the transmission end so that if an error (bit error) occurs in the data received, the error can be detected and corrected. Various error-correcting codes such as Hamming codes, Bose-Chaudhuri-Hocquenghem (BCH) codes, and Reed-Solomon (RS) codes and their decoding schemes have been proposed. By the application of error-correcting codes, the reliability of communication systems can be improved. On the other hand, the number of correctable bits is limited, and error correction performance, that is, the number of correctable bits varies depending on error-correcting codes and decoding schemes.
- Here, a spatially coupled low-density parity-check (LDPC) code has been proposed as one of the codes having strong error correction performance (e.g., Non Patent Literature 1). This code is a type of convolutional code using LDPC codes, which are also called low-density parity-check codes, and has attracted a lot of attention in recent years as a code that can achieve error correction performance close to the Shannon limit. As one of its efficient decoding methods, window decoding is known (e.g., Patent Literature 1).
- In window decoding performed by a decoding apparatus described in
Patent Literature 1, decoding processing is started with a window size based on the results of estimation of channel conditions (channel information), and it is determined whether there is a residual error by a parity check of the decoding result. When the result of the determination shows that an error remains, control is performed to increase the window size. This avoids decoding processing under excessive conditions of error correction performance, reducing power consumption. -
WO 2019/102621 A1 discloses an optical transmission/reception device provided with: an error correction decoding device for window decoding of an LDPC convolutional code, where the window size and the decoding iteration count are configured to be variable depending on an error rate of each bit of a symbol forming the received sequence, and on the throughput input to the error correction decoding device. -
US 7793201 B1 discloses that an iterative decoder includes at respective variable nodes, that is, at nodes that correspond to the bits of the code word, bit error detectors that after convergence determine if the respective hard decision bit values have changed from the bit values provided by the channel. - Patent Literature 1:
Japanese Patent Application Laid-open No. 2013-198017 - Non Patent Literature 1: S. Kudekar, T. J. Richardson, and R. L. Urbanke, "Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC", IEEE Trans. Theory, vol. 57, No. 2, pp. 803-834, Feb. 2011.
- When increasing the window size, following error occurrence in the decoding processing, the decoding apparatus described in
Patent Literature 1 increases the window size by a predetermined increase without considering error occurrence conditions etc. Consequently, the iteration of processing can occur in which the window size is increased and decoding is performed again until errors disappear, increasing processing delay and power consumption. - The present invention has been made in view of the above, and an object thereof is to provide a decoding apparatus capable of reducing processing delay and power consumption when decoding a spatially coupled low-density parity-check code.
- The present invention is set out in the appended set of claims. In order to solve the above problem and achieve the object, a decoding apparatus according to the present invention includes the features as specified in
claim 1. - The decoding apparatus according to the present invention has the effect of being able to reduce processing delay and power consumption when decoding a spatially coupled low-density parity-check code.
-
-
FIG. 1 is a diagram illustrating an example configuration of a decoding apparatus according to a first embodiment of the present invention. -
FIG. 2 is a diagram illustrating an example configuration of an error-correction decoder according to the first embodiment. -
FIG. 3 is a diagram illustrating an example configuration of a parity check matrix used in error correction decoding processing by a window decoder according to the first embodiment. -
FIG. 4 is a diagram illustrating a part of the parity check matrix illustrated inFIG. 3 . -
FIG. 5 is a diagram for explaining the processing by the window decoder according to the first embodiment. -
FIG. 6 is a diagram illustrating an example of the relationship between decoding parameters and error correction performance of window decoding. -
FIG. 7 is a diagram for explaining an initial step of error correction decoding processing performed by a decoder according to the first embodiment. -
FIG. 8 is a diagram for explaining a second step of the error correction decoding processing performed by the decoder according to the first embodiment. -
FIG. 9 is a flowchart illustrating an example of the error correction decoding processing performed by the decoder according to the first embodiment. -
FIG. 10 is a diagram for explaining a second step of error correction decoding processing performed by a decoder according to a first example not forming part of the claimed invention. -
FIG. 11 is a diagram for explaining error correction decoding processing performed by a decoder according to a second example not forming part of the claimed invention -
FIG. 12 is a diagram for explaining error correction decoding processing performed by a decoder according to a second embodiment. -
FIG. 13 is a diagram for explaining another error correction decoding processing performed by the decoder according to a third example not forming part of the claimed invention. -
FIG. 14 is a diagram illustrating an example of hardware that implements the decoder according to the first embodiment and the examples not forming part of the claimed invention. - Hereinafter, a decoding apparatus, a control circuit, and a storage medium according to embodiments of the present invention will be described in detail with reference to the drawings. Note that these embodiments are not intended to limit this invention.
-
FIG. 1 is a diagram illustrating an example configuration of a decoding apparatus according to a first embodiment of the present invention. Adecoder 1, which is the decoding apparatus according to the first embodiment, includes alikelihood generation unit 11, an error-correction decoder 12, an errorrate estimation unit 13, and a decodingparameter control unit 14. Thedecoder 1 constitutes, for example, a receiving apparatus included in a communication apparatus. Thedecoder 1 performs error correction decoding on received data converted into a spatially coupled low-density parity-check code, by the components illustrated inFIG. 1 performing processing to be described later. Received data is input to thelikelihood generation unit 11. In the following description, a spatially coupled low-density parity-check code is referred to as a spatially coupled LDPC code. - The
likelihood generation unit 11 calculates a likelihood from the input received data for soft-decision error correction decoding processing. Thedecoder 1 according to the present embodiment performs soft-decision error correction decoding. In soft decision, when data is expressed by, for example, binary data of "0" or "1", received data is not identified as "0" or "1" but is decided by a likelihood of "0" or "1" with a plurality of thresholds. As an index representing a likelihood, a log-likelihood ratio (LLR) is typically used for the error correction decoding processing in a subsequent stage. Alternatively, a likelihood ratio or a probability can be used without problems. In the above description and the following description, data handled by thedecoder 1 is described as binary data. If symbol data consisting of a plurality of pieces of binary data is handled, processing is similar. - The error-
correction decoder 12 performs error correction decoding processing using an LLR input.FIG. 2 is a diagram illustrating an example configuration of the error-correction decoder 12 according to the first embodiment. As illustrated inFIG. 2 , the error-correction decoder 12 includes awindow decoder 21 and adata storage unit 22. In the error-correction decoder 12, thedata storage unit 22 holds input data. Thewindow decoder 21 performs a decoding operation on data held in thedata storage unit 22. A method of dispersing errors by inserting interleaving and deinterleaving or the like in a preceding stage of the error correction decoding processing is often used. Although not illustrated in the figure because it is not an essential part of the present invention, the data transmission end may interleave data that has undergone error correction coding, and thedecoder 1 may deinterleave an LLR output from thelikelihood generation unit 11 and input it to the error-correction decoder 12. - The error
rate estimation unit 13 estimates the bit error rate of a received signal (hereinafter, simply referred to as the "error rate of a received signal") on the basis of the result of decoding processing by the error-correction decoder 12. The decodingparameter control unit 14 controls decoding parameters to be applied to the error correction decoding processing in the error-correction decoder 12, on the basis of the error rate of a signal estimated by the errorrate estimation unit 13. - Next, the operation of the
decoder 1 to decode received data will be described. A signal received by the receiving apparatus including thedecoder 1 is input to thedecoder 1 after having undergone reception processing such as compensation processing and demodulation processing suitable for the transmission line. - When the signal is input to the
decoder 1, first, thelikelihood generation unit 11 converts the input signal into an LLR and outputs the LLR. The LLR output from thelikelihood generation unit 11 is input to the error-correction decoder 12. In the error-correction decoder 12, thedata storage unit 22 receives and holds the LLR. Thewindow decoder 21 repeats a series of processing steps of reading the LLR from thedata storage unit 22, performing decoding processing using decoding parameters determined by the decodingparameter control unit 14, and storing a decoding result obtained in thedata storage unit 22. In addition, thewindow decoder 21 outputs a decoding result to the errorrate estimation unit 13 in accordance with the timing when the decodingparameter control unit 14 determines decoding parameters. Alternatively, thewindow decoder 21 may output every decoding result obtained to the errorrate estimation unit 13. - The
window decoder 21 decodes the received data to which the spatially coupled LDPC code is applied, using a parity check matrix H as illustrated inFIG. 3. FIG. 3 is a diagram illustrating an example configuration of the parity check matrix used in the error correction decoding processing by thewindow decoder 21 according to the first embodiment. The parity check matrix H illustrated inFIG. 3 includes a band matrix with smaller parity check submatrices (described as "submatrices" inFIG. 3 ) connected diagonally. In the following description, a "parity check submatrix" is referred to as a "submatrix". Components of the submatrices are combined with components of other adjacent submatrices so that a parity check matrix of a plurality of relatively short LDPC codes can be constructed. That is, combining a plurality of adjacent submatrices results in a structure in which a plurality of LDPC codes are convolved and connected in one long code. For the submatrices, for example, the quasi-cyclic (QC) structure of a cyclic permutation matrix may be used to use a convolutional code of QC-LDPC codes. The application of the QC structure facilitates the configuration of a check matrix and circuit implementation. - In the error correction decoding processing performed by the
window decoder 21, the decoding processing is performed by window size extending across a plurality of submatrices. This decoding processing is called window decoding.FIG. 4 illustrates an example of window decoding. InFIG. 4 , a part of the parity check matrix H illustrated inFIG. 3 is extracted and shown. InFIG. 4 , solid rectangles indicate submatrices, and a broken rectangle indicates a window.FIG. 4 illustrates an example of a case where decoding is performed with a window size extending across five submatrices. In window decoding, iterative decoding processing is typically performed in which decoding is performed from the top of a window in each column direction, the processing proceeds sequentially toward a lower row, and when the processing reaches the bottom of the window, the processing is performed from the top of the window again. To the decoding processing, a technique commonly known as an LDPC code decoding algorithm such as a sum-product decoding method or a min-sum decoding method can be applied. In the present invention, a decoding algorithm to be used is not specified. When the decoding processing on a certain window has been completed, as illustrated inFIG. 5 , thewindow decoder 21 outputs the result of decoding of the input signal for which the processing on the head of the window has been completed. In addition, thewindow decoder 21 shifts the window in a lower right direction by one submatrix and inputs new received data. Here, input means reading received data from thedata storage unit 22. Thewindow decoder 21 sequentially performs decoding processing on a new window area after the shift by a similar procedure to that of the decoding processing on a window area before the shift. - In window decoding, it is known that its error correction performance varies according to the window size and the number of decoding iterations indicated by decoding parameters. This will be described with reference to
FIG. 6. FIG. 6 is a diagram illustrating an example of the relationship between decoding parameters and error correction performance of window decoding. InFIG. 6 , the horizontal axis represents window size. The vertical axis represents coding gain penalty in a case where the decoding parameters are changed with reference to coding gain when the decoding parameters are (the window size, the number of decoding iterations)=(12, 3). As illustrated inFIG. 6 , even with the same window size, the larger the number of decoding iterations, the smaller the penalty, that is, the higher the error correction performance. Further, even with the same number of iterations, the larger the window size, the higher the error correction performance. However, there is a trade-off relationship between error correction performance and power consumption. To achieve high error correction performance for a desired throughput, it is necessary to increase one or both of the circuit size and the operating frequency to increase the amount of decoding processing per unit time, and it is necessary to increase the power consumption of the decoder. Paradoxically, if decoding parameters can be selected properly according to a communication channel for the decoder having sufficient error correction performance for the communication channel, lower power consumption can be achieved by a reduction in the operating frequency of the decoder and the intermittent operation or the stopping of operation of an arithmetic unit. - Thus, the
decoder 1 according to the present embodiment selects proper decoding parameters on the basis of received data to prevent power consumption from increasing. The following describes operation to determine decoding parameters on the basis of received data in thedecoder 1. -
FIG. 7 is a diagram for explaining an initial step of the error correction decoding processing performed by thedecoder 1 according to the first embodiment. In thedecoder 1 according to the present embodiment, the error-correction decoder 12 sets values that allow maximum error correction performance among decoding parameters (the window size, the number of decoding iterations) that can satisfy a target throughput, for the head of a spatially coupled LDPC code input, specifically, the head of an LLR data string input from thelikelihood generation unit 11, and performs decoding processing in the initial step. A decoding result obtained in this initial step is output as a decoding result and is also sent to the errorrate estimation unit 13. - The error
rate estimation unit 13 estimates the error rate of the received signal using the decoding result in the initial step input from the error-correction decoder 12. The error rate of the received signal can be obtained, for example, from the result of detection of error-corrected bits that are detected by comparing the result of hard decision on the LLR data before error correction with the hard-decision result of the decoding result in the initial step. Specifically, the errorrate estimation unit 13 assumes that the number of error-corrected bits (hereinafter, referred to as the number of corrected bits) is the number of bits in which errors have occurred, and divides the number of corrected bits by the number of decoded bits, thereby estimating the error rate of the received signal. The estimated error rate is sent to the decodingparameter control unit 14. The output result of the decoding processing is a fixed value in units of the number of columns of the submatrix. Thus, the errorrate estimation unit 13 may output the number of error bits instead of the error rate to the decodingparameter control unit 14. - The decoding
parameter control unit 14 determines the window size and the number of decoding iterations, which are decoding parameters, on the basis of the error rate of the received signal input from the errorrate estimation unit 13. As described above, by the control of the decoding parameters, the error correction performance is changed, leading to the control of power at the same time. Therefore, the decodingparameter control unit 14 determines decoding parameters that allow necessary and sufficient error correction performance on the basis of the error rate of the received signal. In the determination of decoding parameters, for example, a list of decoding parameters that allow sufficient error correction performance for received signal error rates is held. When the error rate of the received signal is input, the decodingparameter control unit 14 selects decoding parameters associated with the input error rate from the list and sets the decoding parameters as decoding parameters to be used. This facilitates the determination of decoding parameters. The decodingparameter control unit 14 notifies the error-correction decoder 12 of the determined decoding parameters. -
FIG. 8 illustrates processing in a step next to the initial step illustrated inFIG. 7. FIG. 8 is a diagram for explaining a second step of the error correction decoding processing performed by thedecoder 1 according to the first embodiment. - As illustrated in
FIG. 8 , in the second step that is a step next to the initial step, the error-correction decoder 12 of thedecoder 1 receives a notification of the decoding parameters determined by the decodingparameter control unit 14, changes the settings of the window size and the number of decoding iterations to the window size and the number of decoding iterations indicated by the decoding parameters, and performs decoding processing. If the decoding parameters in the notification from the decodingparameter control unit 14 are the same as the decoding parameters used in the initial step, the error-correction decoder 12 performs the decoding processing without changing the settings of the window size and the number of decoding iterations. In decoding processing in steps subsequent to the second step, the error-correction decoder 12 uses the same decoding parameters as those in the second step. - The above error correction decoding processing performed by the
decoder 1 according to the first embodiment is shown in a flowchart inFIG. 9. FIG. 9 is a flowchart illustrating an example of the error correction decoding processing performed by the decoder according to the first embodiment. - As illustrated in
FIG. 9 , in the error correction decoding processing performed by thedecoder 1, first, the error-correction decoder 12 sets a variable i indicating the step number of the decoding processing to "i=1" (step S11). Next, the error-correction decoder 12 sets the decoding parameters to initial values. Specifically, the error-correction decoder 12 sets the respective values of the window size and the number of decoding iterations to the maxima (step S12). Next, the error-correction decoder 12 inputs data as large as the window size to the window decoder 21 (step S13). That is, data as large as the window size is input from thedata storage unit 22 to thewindow decoder 21. Next, the error-correction decoder 12 performs Step. i decoding (decoding processing in the ith step) (step S14). - Next, the error-
correction decoder 12 determines whether "i=1" holds (step S15). If "i=1" holds (step S15: Yes), the errorrate estimation unit 13 estimates the bit error rate (BER) indicating the error rate of the received signal (step S16). That is, if "i=1", the error-correction decoder 12 outputs a decoding result in step S14 to the errorrate estimation unit 13, and the errorrate estimation unit 13 estimates the BER on the basis of the input decoding result. - When the error
rate estimation unit 13 obtains the estimated value of the BER by executing step S16, next, the decodingparameter control unit 14 determines decoding parameters on the basis of the estimated value of the BER, and the error-correction decoder 12 updates the window size and the number of decoding iterations according to the results of the determination (step S17). Depending on the estimated value of the BER obtained in step S16, only one of the window size and the number of decoding iterations may be updated in step S17, or neither the window size nor the number of decoding iterations may be updated. - If it is determined in step S15 described above that "i=1" does not hold (step S15: No), or if the decoding parameters are updated by executing step S17, the error-
correction decoder 12 determines whether "i=N" holds (step S18). The value of N is set on the basis of the configuration of the parity check matrix H illustrated inFIG. 3 and the size of the window. Specifically, the number of shifts performed until the position of the window reaches the lower right end of the parity check matrix H illustrated inFIG. 3 is set as the value of N. The number of shifts can be obtained from the size of the window and the size of the parity check matrix H when the size of the window is determined. - If "i=N" holds (step S18: Yes), the error correction decoding processing performed by the error-
correction decoder 12 of thedecoder 1 is finished. On the other hand, if "i=N" does not hold (step S18: No), the error-correction decoder 12 increments i (step S19), returns to step S13, and repeats the processing in steps S13 to S18. Although not illustrated inFIG. 9 , after incrementing i in step S19, the error-correction decoder 12 shifts the window in the lower right direction by one submatrix as described with reference toFIGS. 4 and5 . - As described above, in the window decoding of performing iterative decoding while changing the window position, the
decoder 1 according to the present embodiment uses decoding parameters that maximize the error correction performance until a first decoding result is obtained by executing the initial step. When the first decoding result is obtained, thedecoder 1 determines decoding parameters to be used in subsequent decoding processing on the basis of the decoding result. This allows error correction decoding on a received signal with a necessary and sufficient amount of processing, and thus allows a reduction in the power of thedecoder 1. Further, since sufficiently strong decoding parameters are used in decoding in the initial step, and based on the result, decoding parameters in subsequent steps are uniquely determined, the repetition of adjustment of decoding parameters, which occurs in the method described inPatent Literature 1, can be prevented from occurring, and processing delay can be prevented from increasing. - In the present embodiment, as a basic configuration, only a decoding result in the initial step is used to estimate the error rate of a received signal, but decoding results in a plurality of steps may be used to estimate the error rate. Using a plurality of steps increases the possibility that the error correction decoding processing is performed with excessive error correction performance for received signal quality. That is, there is a high possibility that decoding parameters that cause excessive error correction performance are used in the plurality of steps until the estimation of the error rate of the received signal is completed. However, the number of samples for error rate estimation increases, so that the accuracy of decoding parameter determination can be improved by the improved reliability of an estimation result.
- In the present embodiment, an error rate estimated in the initial step and decoding parameters determined on the basis of the error rate are applied from decoding processing in the next step, but, for example, may be applied from the middle of the next step or may be applied from decoding processing after the next step. This increases the possibility that decoding processing is performed with excessive error correction performance for received signal quality. However, decoding processing in the next step and a process related to the determination of decoding parameters can be provided in parallel, leading to an increase in processing speed and an improvement in circuit implementability. These modified configurations, that is, configurations obtained by partially modifying the basic configuration may be used in combination by taking into account variations in signal quality and the implementability of the
decoder 1. - In the
decoder 1 according to the present embodiment, the errorrate estimation unit 13 estimates the bit error rate of a received signal on the basis of one or more decoding results obtained by decoding processing iteratively executed by the error-correction decoder 12, and the decodingparameter control unit 14 determines decoding parameters on the basis of the bit error rate estimation result. However, the bit error rate of a received signal is an example of information indicating the quality of the received signal. The determination of decoding parameters using the bit error rate is not a limitation. Decoding parameters may be determined using other information indicating the quality of a received signal instead of the bit error rate. That is, the errorrate estimation unit 13 is an example of a signal quality estimation unit that estimates the quality of a received signal on the basis of one or more decoding results obtained by decoding processing iteratively executed by the error-correction decoder 12. - In the first embodiment above, to determine decoding parameters for a spatially coupled LDPC code, an error rate is estimated using the result of decoding in an initial step of a code sequence received. However, since the decoding parameters based on the result of decoding in the initial step are applied to the entire code sequence, it is required that the transmission line be relatively static, and performance variation be small from the start to the end of the code. Therefore, the present example not forming part of the claimed invention describes a decoder applied in a case where transmission line characteristics vary with time, and performance varies between the start and the end of the code.
- The configuration of the decoder according to the present example not forming part of the claimed invention is that illustrated in
FIGS. 1 and 2 like the decoder according to the first embodiment. As in the first embodiment, window decoding is applied to a decoding scheme. In the present example not forming part of the claimed invention described below, differences from the first embodiment will be described. For explanatory convenience, the decoder according to the present example not forming part of the claimed invention is referred to as a decoder 1a. - In an initial step of window decoding performed by the decoder 1a, the same processing as in the initial step of the window decoding performed by the
decoder 1 according to the first embodiment is performed. That is, in the initial step of the window decoding, as illustrated inFIG. 7 , the decoder 1a sets values that allow maximum error correction performance among decoding parameters (the window size, the number of decoding iterations) that can satisfy a target throughput, and performs decoding processing on the head of an LLR data string. - In a step next to the initial step, the decoder 1a performs processing illustrated in
FIG. 10. FIG. 10 is a diagram for explaining a second step of error correction decoding processing performed by the decoder 1a . As illustrated inFIG. 10 , the error-correction decoder 12 of the decoder 1a performs decoding processing using the decoding parameters determined on the basis of the decoding result in the initial step as in the first embodiment. On the other hand, in the present example not forming part of the claimed invention, by outputting a decoding result in a current step to the errorrate estimation unit 13, the update of the decoding parameters in the next step is further performed. That is, the decoder 1a sequentially updates the decoding parameters on the basis of a decoding result obtained in each step of the error correction decoding processing. This allows the following of optimum decoding parameters for decoding processing even if reception quality changes during the middle of a spatially coupled LDPC code due to the time variation of the transmission line, allowing a more stable reduction in the power of the decoder 1a. - In the present example not forming part of the claimed invention, as a basic configuration, only a decoding result in one step is used to estimate the error rate of a received signal, but decoding results in a plurality of steps may be used to estimate the error rate as in the first embodiment. Further, decoding parameters in a current step are determined on the basis of an error rate estimated in the previous step, but may be determined on the basis of an error rate estimated in a step before the previous step.
- In the present example not forming part of the claimed invention, the error rate of a received signal is estimated using only a decoding result in the previous step when decoding parameters are determined. Alternatively, decoding results in a plurality of steps including a step(s) before the previous step may be used. By utilizing decoding results in a plurality of steps, for example, a weighted average can be taken to improve the accuracy of estimation of current communication quality. Further, the application of the Kalman filter or the like allows the estimation of an error rate in a next step. For these modified configurations, some modified configurations may be used in combination by taking into account variations in signal quality and the implementability of the decoder 1a.
- In the above description, error rate estimation and decoding parameter update are performed in all decoding processing steps, but may be intermittently performed.
- Second Example (not forming part of the claimed invention). In the first embodiment and the first example not forming part of the claimed invention above, the decoding parameters are optimized within one spatially coupled LDPC code received. Thus, when a new spatially coupled LDPC code sequence is input, the decoding parameters are initialized to values that allow maximum error correction performance, to advance the error correction decoding processing. However, it is unlikely that reception quality significantly varies in a temporally continuous received signal. Therefore, a decoder according to the present embodiment obtains an estimated value of the bit error rate using the result of decoding of a certain spatially coupled LDPC code, and determines, based on the estimated value, the initial values of the decoding parameters for the error correction decoding of a next spatially coupled LDPC code.
- The configuration of the decoder according to the present embodiment is that illustrated in
FIGS. 1 and 2 like thedecoders 1 and 1a. Further, as in the first embodiment and the first example not forming part of the claimed invention, window decoding is applied to a decoding scheme. In the present example not forming part of the claimed invention described below, differences from the first and second embodiments will be described. For explanatory convenience, the decoder according to the present example not forming part of the claimed invention is referred to as a decoder 1b. -
FIG. 11 is a diagram for explaining error correction decoding processing performed by the decoder 1b For the sake of explanation, a code currently subjected to the error correction decoding processing is referred to as an nth spatially coupled LDPC code. In a case where the error correction decoding processing is serially performed, when the nth spatially coupled LDPC code is decoded, the decoding of the (n-1)th spatially coupled LDPC code has been completed. The decoder 1b estimates the error rate of a received signal on the basis of the result of decoding of the (n-1)th spatially coupled LDPC code, and determines decoding parameters on the basis of the estimated error rate. That is, as illustrated inFIG. 11 , the result of decoding of the (n-1)th spatially coupled LDPC code is input to the errorrate estimation unit 13, and the errorrate estimation unit 13 estimates the error rate of the received signal. Next, the decodingparameter control unit 14 determines decoding parameters on the basis of an estimated value of the error rate obtained by the errorrate estimation unit 13. Then, using the decoding parameters determined by the decodingparameter control unit 14, the error-correction decoder 12 of the decoder 1b starts the error correction decoding processing on the nth spatially coupled LDPC code. That is, the decoder 1b applies the decoding parameters determined using the result of decoding of the (n-1)th spatially coupled LDPC code to the initial step of the error correction decoding processing on the nth spatially coupled LDPC code. Like thedecoder 1 according to the first embodiment, upon obtaining a decoding result in the initial step, the decoder 1b determines decoding parameters to be applied to decoding processing in the next and subsequent steps on the basis of the obtained decoding result. In the error correction decoding processing on the following (n+1)th spatially coupled LDPC code, the decoder 1b applies decoding parameters determined using the result of decoding of the nth spatially coupled LDPC code to decoding processing in the initial step. Thereafter, the decoder 1b likewise determines initial values of the decoding parameters to be used in the error correction decoding processing on a spatially coupled LDPC code, that is, decoding parameters to be applied to decoding processing in the initial step, using the result of decoding of the previous spatially coupled LDPC code. - This allows decoding with parameters suitable for received signal quality from the initial step of the error correction decoding processing, allowing an efficient reduction in power. When starting the decoding of a spatially coupled LDPC code string, that is, when there is no spatially coupled LDPC code corresponding to the (n-1)th spatially coupled LDPC code, the decoder 1b starts the error correction decoding processing using decoding parameters that maximize error correction performance as in the first and second embodiments.
- The present example not forming part of the claimed invention has been described on the assumption that the error correction decoding processing on the (n-1)th spatially coupled LDPC code and the error correction decoding processing on the nth spatially coupled LDPC code are sequentially performed. However, in actuality, there may be a case where in a decoder that achieves a desired throughput, the
window decoder 21 and thedata storage unit 22 are parallelized, and the nth and (n-1)th spatially coupled LDPC codes are decoded at the same timing. Thus, decoding parameters determined on the basis of the result of decoding of the (n-1)th spatially coupled LDPC code may be applied from the error correction decoding processing on the (n+i)th (i≥0) or a subsequent spatially coupled LDPC code. - Second Embodiment. In the second example not forming part of the claimed invention, initial values of the decoding parameters to be applied to the error correction decoding processing on a current spatially coupled LDPC code are determined by utilizing the result of decoding of the previous spatially coupled LDPC code. To implement the configuration described in the second example not forming part of the claimed invention, the error
rate estimation unit 13 that estimates the error rate of a received signal necessary to determine decoding parameters in the decoder 1b requires the addition of a function to calculate the error rate of the entire spatially coupled LDPC code to the errorrate estimation unit 13 applied to the first embodiment and the first example not forming part of the claimed invention. Therefore, the present embodiment describes the form of a decoder that does not require the addition of a function to calculate the error rate of the entire spatially coupled LDPC code. - The configuration of the decoder according to the present embodiment is that illustrated in
FIGS. 1 and 2 like the decoders according to the first embodiment. As in the first embodiment, window decoding is applied to a decoding scheme. For explanatory convenience, the decoder according to the present embodiment is referred to as a decoder 1c. -
FIG. 12 is a diagram for explaining error correction decoding processing performed by the decoder 1c according to a second embodiment.FIG. 12 illustrates a case where the decoder 1c determines decoding parameters by utilizing the result of decoding of the previous spatially coupled LDPC code while performing a similar error correction decoding processing to the error correction decoding processing described in the first embodiment. - As described above, the
decoder 1 according to the first embodiment determines decoding parameters on the basis of the result of decoding in the initial step, and applies the same parameters to all decoding processing steps after the initial step on a spatially coupled LDPC code received. As illustrated inFIG. 12 , in the decoder 1c that decodes a spatially coupled LDPC code by a similar procedure to that in the first embodiment, the errorrate estimation unit 13 estimates a bit error rate on the basis of the result of decoding obtained in the initial step of the error correction decoding processing on the (n-1)th spatially coupled LDPC code, and the decodingparameter control unit 14 determines decoding parameters on the basis of an estimated value of the bit error rate. Then, the decoding parameters are applied to the initial step of the error correction decoding processing on the nth spatially coupled LDPC code. - Thus, when decoding a spatially coupled LDPC code by a similar procedure to that in the first embodiment, the decoder 1c applies decoding parameters determined on the basis of a decoding result obtained in the initial step of the error correction decoding processing on the (n-1)th spatially coupled LDPC code, not only to the error correction decoding processing on the (n-1)th spatially coupled LDPC code but also to the initial step of the error correction decoding processing on the nth spatially coupled LDPC code. The decoder 1c applies decoding parameters determined on the basis of a decoding result in the initial step to each step after the initial step on the nth spatially coupled LDPC code. The decoder 1c also determines decoding parameters to be used in the error correction decoding processing on the (n+1)th and subsequent spatially coupled LDPC codes in a similar manner.
-
FIG. 13 is a diagram for explaining another error correction decoding processing performed by the decoder 1c according to a third example not forming part of the claimed invention.FIG. 13 illustrates a case where the decoder 1c determines decoding parameters by utilizing the result of decoding of the previous spatially coupled LDPC code while performing a similar error correction decoding processing to the error correction decoding processing described in the first example not forming part of the claimed invention. - As described above, the decoder 1a according to the first example not forming part of the claimed invention determines, on the basis of a decoding result obtained in each step of the error correction decoding processing on a spatially coupled LDPC code, decoding parameters to be used in a subsequent step. That is, the decoder 1a updates the decoding parameters on the basis of a decoding result in each step of the error correction decoding processing on a spatially coupled LDPC code. As illustrated in
FIG. 13 , in the decoder 1c that decodes a spatially coupled LDPC code by a similar procedure to that in the first example not forming part of the claimed invention, the errorrate estimation unit 13 estimates a bit error rate on the basis of a decoding result in a final step of the error correction decoding processing on the (n-1)th spatially coupled LDPC code, and the decodingparameter control unit 14 determines decoding parameters on the basis of an estimated value of the bit error rate. Then, the decoding parameters are applied to the initial step of the error correction decoding processing on the nth spatially coupled LDPC code. - Thus, when decoding a spatially coupled LDPC code by a similar procedure to that in the first example not forming part of the claimed invention, the decoder 1c estimates the bit error rate and updates the decoding parameters on the basis of a decoding result in the final step of the error correction decoding processing on the (n-1)th spatially coupled LDPC code, and applies the updated decoding parameters to the initial step of the error correction decoding processing on the nth spatially coupled LDPC code. The decoder 1c also determines decoding parameters to be used in the error correction decoding processing on the (n+1)th and subsequent spatially coupled LDPC codes in a similar manner.
- The above configuration allows decoding with decoding parameters suitable for received signal quality from the initial step of the error correction decoding processing on each spatially coupled LDPC code without adding a function to calculate the error rate of the entire spatially coupled LDPC code to the first and second embodiments. As a result, an efficient reduction in power can be achieved.
- The error correction decoding processing described in the present embodiment is described on the basis of the basic configurations of the first embodiment, but may be implemented on the basis of the modified configurations described in the first embodiment.
- Further, as in the second example not forming part of the claimed invention, by taking into account constraints such as throughput and implementation conditions, etc., decoding parameters determined on the basis of the (n-1)th decoding result may be applied from the error correction decoding processing on the (n+i)th (i≥0) or a subsequent spatially coupled LDPC code. Furthermore, a limit may be set on the number of repetitions of processing to determine initial values of the decoding parameters by utilizing the result of decoding of the previous spatially coupled LDPC code as above. That is, each time the number of repetitions of this processing reaches a predetermined number, the decoding parameters may be returned to settings that allow maximum error correction performance, and the processing may be started again. Instead of setting a limit on the number of repetitions of the processing, a limit may be set on the time of repeating the processing, and each time a predetermined time has elapsed, the decoding parameters may be returned to settings that allow maximum error correction performance.
- Next, a hardware configuration of the decoder described in the first to fourth embodiments will be described. The decoder described in the first to fourth embodiments can be implemented by dedicated processing circuitry. The dedicated processing circuitry is, for example, a single circuit, a combined circuit, a programmed processor, a parallel-programmed processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a circuit that combines them.
- Alternatively, the decoder described in the first to second embodiments may be implemented by a control circuit including a
processor 101 and amemory 102 illustrated inFIG. 14. FIG. 14 is a diagram illustrating an example of hardware that implements the decoder according to the first to second embodiments. Theprocessor 101 is a central processing unit (CPU, also called a central processor, a processing unit, an arithmetic unit, a microprocessor, a microcomputer, a processor, or a digital signal processor (DSP)). Thememory 102 is, for example, a nonvolatile or volatile semiconductor memory such as a random-access memory (RAM), a read-only memory (ROM), a flash memory, an erasable programmable read-only memory (EPROM), or an electrically erasable programmable read-only memory (EEPROM). - When the decoder described in the first to second embodiments is implemented by the control circuit illustrated in
FIG. 14 , a program for operating as thelikelihood generation unit 11, the error-correction decoder 12, the errorrate estimation unit 13, and the decodingparameter control unit 14 of the decoder is stored in thememory 102 in advance. Theprocessor 101 reads and executes the program stored in thememory 102 to operate as thelikelihood generation unit 11, the error-correction decoder 12, the errorrate estimation unit 13, and the decodingparameter control unit 14 of the decoder. Thedata storage unit 22 constituting the error-correction decoder 12 is implemented by thememory 102. - Part of the
likelihood generation unit 11, the error-correction decoder 12, the errorrate estimation unit 13, and the decodingparameter control unit 14 may be implemented by dedicated processing circuitry, and the rest may be implemented by theprocessor 101 and thememory 102 illustrated inFIG. 14 . - The configurations illustrated in the above embodiments illustrate an example of the subject matter of the present claimed invention, and can be combined with another known art, and can be partly omitted or changed without departing from the scope of the present claimed invention.
- 1 decoder; 11 likelihood generation unit; 12 error-correction decoder; 13 error rate estimation unit; 14 decoding parameter control unit; 21 window decoder; 22 data storage unit.
Claims (3)
- A decoding apparatus (1) for decoding spatially coupled LDPC code sequences comprising:an error-correction decoder (12) configured to execute error correction decoding processing in a series of sequential steps i, i=1, ..., N, on received data corresponding to a spatially coupled LDPC code sequence by iterative decoding processing with a window size and a number of decoding iterations indicated by decoding parameters to obtain a decoding result in each step,wherein the error correction decoding processing for a first spatially coupled LDPC code sequence is started, in an initial step i=1, with initial values of the decoding parameters that maximize error correction performance among settable values; anda decoding parameter control unit (14) configured to update the decoding parameters using the decoding result obtained by the error correction decoding processing in the initial step of the error correction decoding for the first spatially coupled LDPC code sequence,wherein the error-correction decoder (12) is further configured to apply the updated decoding parameters in subsequent steps, i>1, of the error correction decoding processing for the first spatially coupled LDPC code sequence.
- A control circuit to control the decoding apparatus (1) for decoding spatially coupled LDPC code sequences according to claim 1, the control circuit causing the decoding apparatus to execute error correction decoding processing (S14) in a series of sequential steps i, i=1, ... , N, on received data corresponding to a spatially coupled LDPC code sequence by iterative decoding processing with a window size and a number of decoding iterations indicated by decoding parameters to obtain a decoding result in each step,
wherein the error correction decoding processing for a first spatially coupled LDPC code sequence is started, in an initial step i=1 (S11) with initial values of the decoding parameters that maximize error correction performance among settable values (S12), and further includes updating (S17) the decoding parameters using the decoding result obtained by the error correction decoding processing in the initial step of the error correction decoding for the first spatially coupled LDPC code sequence, wherein the updated decoding parameters are applied in subsequent steps, i>1, of the error correction decoding processing for the first spatially coupled LDPC code sequence. - A storage medium storing a program to control the decoding apparatus (1) for decoding spatially coupled LDPC code sequences according to claim 1, the program causing the decoding apparatus to execute error correction decoding processing (S14) in a series of sequential steps i, i=1, ..., N, on received data corresponding to a spatially coupled LDPC code sequence by iterative decoding processing with a window size and a number of decoding iterations indicated by decoding parameters to obtain a decoding result in each step,
wherein the error correction decoding processing for a first spatially coupled LDPC code sequence is started, in an initial step i=1 (s11), with initial values of the decoding parameters that maximize error correction performance among settable values (S12), and further includes updating (S17) the decoding parameters using the decoding result obtained by the error correction decoding processing in the initial step of the error correction decoding for the first spatially coupled LDPC code sequence, wherein the updated decoding parameters are applied in subsequent steps, i>1, of the error correction decoding processing for the first spatially coupled LDPC code sequence.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2019/023537 WO2020250390A1 (en) | 2019-06-13 | 2019-06-13 | Decoding device |
Publications (3)
Publication Number | Publication Date |
---|---|
EP3972134A1 EP3972134A1 (en) | 2022-03-23 |
EP3972134A4 EP3972134A4 (en) | 2022-05-04 |
EP3972134B1 true EP3972134B1 (en) | 2023-11-15 |
Family
ID=73781382
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP19932351.0A Active EP3972134B1 (en) | 2019-06-13 | 2019-06-13 | Iterative decoder with adaptive decoding parameters for spatially coupled ldpc codes |
Country Status (5)
Country | Link |
---|---|
US (1) | US11750216B2 (en) |
EP (1) | EP3972134B1 (en) |
JP (1) | JP7038910B2 (en) |
CN (1) | CN113940007A (en) |
WO (1) | WO2020250390A1 (en) |
Family Cites Families (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004080508A (en) * | 2002-08-20 | 2004-03-11 | Nec Electronics Corp | Decoding method for error correction code, its program, and its device |
AU2003263497A1 (en) * | 2002-10-23 | 2004-05-13 | Koninklijke Philips Electronics N.V. | Sliding-window decoder with prolog-windows having flexibel sizes |
US7793201B1 (en) * | 2006-05-11 | 2010-09-07 | Seagate Technology Llc | Bit error detector for iterative ECC decoder |
JP5881930B2 (en) * | 2009-05-13 | 2016-03-09 | 三菱電機株式会社 | Error correction coding apparatus and error correction decoding apparatus |
US8495479B1 (en) * | 2010-11-22 | 2013-07-23 | Marvell International Ltd. | Defect detection and correction via monitoring of syndromes and bit flips in decoder |
JP2012151801A (en) * | 2011-01-21 | 2012-08-09 | Renesas Electronics Corp | Error correction device, error correction method and decoding device |
JP2013198017A (en) | 2012-03-21 | 2013-09-30 | Toshiba Corp | Decoding device and communication device |
US9712187B2 (en) | 2014-12-05 | 2017-07-18 | Samsung Electronics Co., Ltd. | SC-LDPC codes for wireless communication systems: framework and zigzag-window decoder |
US9866241B2 (en) * | 2015-09-25 | 2018-01-09 | SK Hynix Inc. | Techniques for adaptive LDPC decoding |
US10367528B2 (en) * | 2016-03-04 | 2019-07-30 | Sandisk Technologies Llc | Convolutional low-density parity-check coding |
US10326479B2 (en) * | 2016-07-11 | 2019-06-18 | Micron Technology, Inc. | Apparatuses and methods for layer-by-layer error correction |
WO2018042597A1 (en) | 2016-09-01 | 2018-03-08 | 三菱電機株式会社 | Error correction decoding device, and optical transmission/reception device |
US10382067B2 (en) * | 2017-06-08 | 2019-08-13 | Western Digital Technologies, Inc. | Parameterized iterative message passing decoder |
EP3526899B1 (en) * | 2017-08-30 | 2021-08-18 | Huawei Technologies Co., Ltd. | Decoding of low-density parity-check convolutional turbo codes |
US11133824B2 (en) | 2017-11-27 | 2021-09-28 | Mitsubishi Electric Corporation | Error correction device and optical transmission/reception device |
KR102415974B1 (en) * | 2017-12-14 | 2022-07-04 | 삼성전자주식회사 | Error correction device, operating method of error correction device, and controller including error correction device |
-
2019
- 2019-06-13 JP JP2021525515A patent/JP7038910B2/en active Active
- 2019-06-13 CN CN201980097206.1A patent/CN113940007A/en active Pending
- 2019-06-13 WO PCT/JP2019/023537 patent/WO2020250390A1/en unknown
- 2019-06-13 EP EP19932351.0A patent/EP3972134B1/en active Active
-
2021
- 2021-12-07 US US17/544,090 patent/US11750216B2/en active Active
Also Published As
Publication number | Publication date |
---|---|
US11750216B2 (en) | 2023-09-05 |
JP7038910B2 (en) | 2022-03-18 |
CN113940007A (en) | 2022-01-14 |
EP3972134A1 (en) | 2022-03-23 |
EP3972134A4 (en) | 2022-05-04 |
WO2020250390A1 (en) | 2020-12-17 |
JPWO2020250390A1 (en) | 2021-10-14 |
US20220094371A1 (en) | 2022-03-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8607118B2 (en) | Iterative decoding method and apparatus | |
KR101021465B1 (en) | Apparatus and method for receiving signal in a communication system using a low density parity check code | |
JP5506828B2 (en) | Improved turbo equalization method for iterative decoder | |
EP2169836B1 (en) | Low-density parity check convolution code (ldpc-cc) encoder and ldpc-cc decoder | |
JP5464990B2 (en) | Multistage decoder and method for decoding a block of symbols | |
Zimmermann et al. | Reduced complexity LDPC decoding using forced convergence | |
EP2892157A1 (en) | Offset Min-Sum decoding of LDPC codes | |
US9473173B2 (en) | Method for early terminating decoding processes of serial concatenated coding and decoder using the same | |
US9602133B1 (en) | System and method for boost floor mitigation | |
JP2009225164A (en) | Decoding device and television receiver having decoding device | |
Liu et al. | Hard-decision bit-flipping decoder based on adaptive bit-local threshold for LDPC codes | |
US11522562B2 (en) | Error correcting decoding device and error correcting decoding method | |
Freudenberger et al. | Concatenated code constructions for error correction in non-volatile memories | |
EP3972134B1 (en) | Iterative decoder with adaptive decoding parameters for spatially coupled ldpc codes | |
JP5674015B2 (en) | Decoding apparatus and method, and program | |
Lee et al. | An iterative soft-decision decoding algorithm for Reed-Solomon codes | |
Jerji et al. | Gradient bit-flipping ldpc decoder for atsc 3.0 | |
US11218166B1 (en) | Early convergence for decoding of LDPC codes | |
Lentmaier et al. | Exact erasure channel density evolution for protograph-based generalized LDPC codes | |
EP3301814A1 (en) | Message passing decoder for decoding ldpc codes jointly with convolutional or turbo codes | |
JP6789446B2 (en) | Transmitter, receiver, communication system, code rate change method, control circuit and program | |
Alabady | Binary and non-binary low density parity check codes: A survey | |
Nam-Il et al. | Early termination scheme for 5G NR LDPC code | |
Varnica | LDPC Decoding: VLSI Architectures and Implementations | |
Chandrasetty et al. | A reduced complexity message passing algorithm with improved performance for LDPC decoding |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20211124 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
A4 | Supplementary search report drawn up and despatched |
Effective date: 20220407 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04L 1/20 20060101ALN20220401BHEP Ipc: H03M 13/37 20060101ALI20220401BHEP Ipc: H03M 13/11 20060101ALI20220401BHEP Ipc: H04L 1/00 20060101ALI20220401BHEP Ipc: H03M 13/35 20060101ALI20220401BHEP Ipc: H03M 13/19 20060101AFI20220401BHEP |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20230102 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04L 1/20 20060101ALN20230511BHEP Ipc: H03M 13/37 20060101ALI20230511BHEP Ipc: H03M 13/11 20060101ALI20230511BHEP Ipc: H04L 1/00 20060101ALI20230511BHEP Ipc: H03M 13/35 20060101ALI20230511BHEP Ipc: H03M 13/19 20060101AFI20230511BHEP |
|
INTG | Intention to grant announced |
Effective date: 20230531 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP Ref country code: GB Ref legal event code: FG4D |
|
P01 | Opt-out of the competence of the unified patent court (upc) registered |
Effective date: 20231018 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602019041727 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG9D |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20231115 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20240216 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20240315 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20231115 |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1632696 Country of ref document: AT Kind code of ref document: T Effective date: 20231115 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20231115 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20231115 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20231115 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20231115 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20231115 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20240315 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20240216 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20231115 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20240215 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20231115 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20240315 |