# US 2021/0175908 A1 · Method and device for decoding staircase code, and storage medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0175908 A1
- Document ID: US20210175908A1
- Status: Published application
- Kind: A1
- Application number: 16/764,597
- Filed: 2018-11-15
- Published: 2021-06-10
- Earliest claimed: 2017-11-15
- Assignees: Zte Corporation
- Applicants: Zte Corporation
- Inventors: Weiming WANG
- Web page: https://patentgrep.com/patent/US20210175908A1

## CPC

- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/458: {by updating bit probabilities or hard decisions in an iterative fashion for convergence to a final decoding result}
- H03M 13/2909: {Product codes}
- H03M 13/2927: {Decoding strategies}
- H03M 13/658: {Scaling by multiplication or division}
- H04L 1/00: Arrangements for detecting or preventing errors in the information received {(correcting synchronisation H04L7/00)}
- H04L 1/0042: {Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape (H04L1/0067 takes precedence)}
- H04L 1/0047: {Decoding adapted to other signal detection operation (in conjunction with sequence estimation or equalization H04L25/03286)}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H03M 13/1108: {Hard decision decoding, e.g. bit flipping, modified or weighted bit flipping}
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Provided is a method for decoding a staircase code. The method includes following steps: soft information updating is performed on S initial encoding blocks in a staircase code to obtain a first information block, and last S−T encoding blocks in the first information block and T newly-added encoding blocks are updated to obtain a second information block; decoding is performed on first T encoding blocks in the first information block and first S−T encoding blocks in the second information block to obtain a third information block; and following operations are repeatedly performed: S−T information blocks are selected, the soft information updating is performed to obtain S updated information blocks, and the S updated information blocks are used as a new second information block; and decoding is performed to obtain a new third information block, and information of first T blocks is outputted as the output of the decoder.

## Claims

### Claim 1

A method for decoding a staircase code, comprising:
performing soft information updating on S initial encoding blocks in a staircase code to obtain a first information block, and updating last S−T encoding blocks in the first information block and T newly-added encoding blocks to obtain a second information block, wherein S and T are both integers greater than 0;
performing decoding on first T encoding blocks in the first information block and first S−T encoding blocks in the second information block to obtain a third information block, and outputting information of first T blocks in the third information blocks as output of a decoder; and
performing repeatedly following operations of: selecting S−T information blocks from the second information block or the third information block, performing the soft information updating on the selected S−T information blocks and the T newly-added encoding blocks to obtain S updated information blocks, and using the S updated information blocks as a new second information block; and performing decoding on information of (T+1)-th to 2T-th blocks in the third information block and information of first S−T blocks in the new second information block to obtain a new third information block, and outputting information of first T blocks in the new third information blocks as output of the decoder.

### Claim 2 (depends on 1)

The method of claim 1, wherein performing the soft information updating on the S initial encoding blocks in the staircase code to obtain the first information block comprises:
performing the soft information updating on the S initial encoding blocks Bi through N1_itr iterations to obtain the first information block, wherein 1≤i≤S, and N1_itr is an integer greater than 0.

### Claim 3 (depends on 2)

The method of claim 2, wherein performing the soft information updating on the S initial encoding blocks B, through the N1_itr iterations comprises:
a first updating processing, which is to perform the soft information updating on a code block [Bi−1T Bi], i=1, by a following formula:
[Ri−1n, Rin]=[Ri−10, Ri0]+[Ai−1n, Ain]×Win, n=1, where Ri0 is original input data of the decoder corresponding to Bi, Rin is soft information of n iterations corresponding to Bi, Win is external information calculated by the code block [Bi−1T Bi], Ain is a reliability factor of the external information, a value range of Ain is (0, 1], a value of Ai−1n is 1, and a value of Ain is n/N1_itr; and
a second updating processing, which is to perform the soft information updating on a code block [Ri−1T Bi], i=2, . . . S−1, by the following formula:
[Ri−1n, Rin]=[Ri−10, Ri0]+[Ai−1n, Ain]×Win, n=1, where Ai−1n is greater than or equal to Ain; performing repeatedly the first updating process and the second updating process for a code block [Ri−1T Ri], i=1, . . . S−1, where during performing repeatedly, n=2, . . . N1_itr, Ain is greater than or equal to Ain−1, and N1_itr is configurable by a register.

### Claim 4 (depends on 1)

The method of claim 1, wherein updating the last S−T encoding blocks in the first information block and the T newly-added encoding blocks to obtain the second information block comprises:
a third updating processing, which is to perform the soft information updating on a code block [Ri−1T Ri], i=1, . . . S−T−1, by a following formula:
[Ri−1n, Rin]=[Ri−10, Ri0]+[Ai−1n, Ain]×Win, n=1, where Ri0 is original input data of the decoder corresponding to an encoding block Bi, Rin is soft information of n iterations corresponding to Bi, Win is external information calculated by a code block [Bi−1T Bi], Ain is a reliability factor of the external information, a value range of Ain is (0, 1], a value of Ai−1n is 1, and a value of Ain is n/N1_itr;
a fourth updating processing, which is to perform the soft information updating on a code block [Ri−1T Bi], i=S−T, by a following formula;
[RS−T−1n, RS−Tn]=[RS−T−10, RS−T0]+[AS−T−1n, AS−Tn]×Win−1, n=1;
a fifth updating processing, which is to perform the soft information updating on a code block [Bi−1T Bi], i=S−T+1, . . . S−T−1, by the following formula:
[Ri−1n, Rin]=[Ri−10, Ri0]+[Ai−1n, Ain]×Win, n=1; and
performing repeatedly the third updating processing, the fourth updating processing and the fifth updating processing to obtain the second information block, where Ain is greater than or equal to Ain−1, and during performing repeatedly, n=2, . . . N1_itr.

### Claim 5 (depends on 1)

The method of claim 1, wherein performing the decoding on the first T encoding blocks in the first information block and the first S−T encoding blocks in the second information block to obtain the third information block comprises one of:
performing hard decoding on the first T encoding blocks in the first information block and the first S−T encoding blocks in the second information block to obtain the third information block; or
performing soft decoding on the first T encoding blocks in the first information block and the first S−T encoding blocks in the second information block to obtain the third information block.

### Claim 6 (depends on 5)

The method of claim 5, wherein performing the hard decoding on the first T encoding blocks in the first information block and the first S−T encoding blocks in the second information block to obtain the third information block comprises:
obtaining soft information of the first information block and soft information of the second information block through a following formula:
[Ri−1n, Rin]=[Ri−1n−1, Rin−1]+Win, n=N1_itr, where Rin is soft information of n iterations corresponding to an encoding block Bi, and Win is external information calculated by a code block [Bi−1T Bi];
performing a hard decision on the obtained soft information through a manner of: deciding a symbol bit to be 0 bit or 1 bit by corresponding a symbol bit of an element in the obtained soft information to an encoding rule;
performing a decoding processing through a manner of: successively performing (2 m, 2 m-r) block code decoding on hard decision results corresponding to [Bi−1T Bi] with a number of S−1, where i=2, . . . S; and
performing repeatedly a decoding processing N2_itr times, determining decoded S block data as the third information block, and using first T block data as output of the decoder.

### Claim 7 (depends on 6)

The method of claim 6, wherein in a case where the decoding processing is repeatedly performed N2_itr times, and the block code is provided with an extended parity bit, in previous N3_itr iterations, a result of (2 m, 2 m-r) block code decoding not satisfying the parity bit is iterated, to restore to current input data of the block code decoding, a subsequent iteration does not be performed a parity bit detection, and a decoding result is performed exclusive-OR (XOR) to modulo 2 to obtain the parity bit, wherein a value range of N3_itr is [1, N2_itr], and N2_itr is an integer greater than 0.

### Claim 8 (depends on 6)

The method of claim 6, wherein during performing repeatedly the decoding processing N2_itr times, and in a case where a block code decoder processing the decoding processing feeds back an error-corrected, a current codeword sequence is restored to original input data.

### Claim 9 (depends on 5)

The method of claim 5, wherein performing the soft decoding on the first T encoding blocks in the first information block and the first S−T encoding blocks in the second information block to obtain the third information block comprises:
performing a normalization processing on the first information block and the second information block, and obtaining soft information of the first information block and soft information of the second information block through a following formula:
[Ri−1n, Rin]=[Ri−10, Ri0]+[Ai−1n, Ain]×Win, n=N1_itr, where Ri0 is original input data of the decoder corresponding to an encoding block Bi, Rin is soft information of n iterations corresponding to Bi, Win is external information calculated by a code block [Bi−1T Bi], Ain is a reliability factor of the external information, a value range of Ain is (0, 1], a value of Ai−1n is 1, and a value of Ain is (n−1)/N1_itr;
performing repeatedly an output processing, where during performing repeatedly, n=2, . . . N2_itr, and N2_itr is an integer greater than 0;
in a case where the last iteration is performed, performing a following output processing: outputting soft information of the decoder obtained according to a following formula:
[Ri−1n, Rin]=[Ri−1n−1, Rin−1]+Win, n=N2_itr;
performing a hard decision on the soft information obtained by the output processing through a manner of: deciding a symbol bit to be 0 bit or 1 bit by corresponding a symbol bit of an element in the obtained soft information to an encoding rule; and
determining first T block data obtained through the hard decision as the third information block, and using the first T block data as output of the decoder.

### Claim 10 (depends on 1)

The method of claim 1, wherein selecting the S−T information blocks from the second information block or the third information block comprises:
in a case where hard decoding is performed on the first T encoding blocks in the first information block and the first S−T encoding blocks in the second information block to obtain the third information block, selecting S−T information blocks through a manner of: discarding first T block data in the second information block to obtain the S−T information blocks; or, selecting (2T+1)-th block and N_bh blocks following the (2T+1)-th block from the third information block, and splicing original input data corresponding to soft information of blocks from (T+N_bh+2)-th to S-th in the second information block onto the selected blocks from the third information block to act as the S−T information blocks, where a value range of N_bh is [0, S−T−1]; or
in a case where soft decoding is performed on the first T encoding blocks in the first information block and the first S−T encoding blocks in the second information block to obtain the third information block, selecting S−T information blocks through a manner of: selecting data of (2T+1)-th to (S+T)-th blocks from the third information block as the S−T information blocks, wherein a generation method is as follows:
[Ri−1n, Rin]=[Ri−10, Ri0]+[Ai−1n, Ain]×Win, n=N2_itr, where Rin is soft information output of n iterations corresponding to Bi, and Win is external information calculated by a code block [Bi−1T Bi].

### Claim 11

An apparatus for decoding a staircase code, comprising:
an updating module, which is configured to perform soft information updating on S initial encoding blocks in a staircase code to obtain a first information block, and update last S−T encoding blocks in the first information block and T newly-added encoding blocks to obtain a second information block, wherein S and T are both integers greater than 0;
a decoding module, which is configured to perform decoding on first T encoding blocks in the first information block and first S−T encoding blocks in the second information block to obtain a third information block, and output information of first T blocks in the third information blocks as output of a decoder; and
a processing module, which is configured to perform repeatedly following operations of: selecting S−T information blocks from the second information block or the third information block, performing the soft information updating on the selected S−T information blocks and the T newly-added encoding blocks to obtain S updated information blocks, and using the S updated information blocks as a new second information block; and performing decoding on information of (T+1)-th to 2T-th blocks in the third information block and information of first S−T blocks in the new second information block to obtain a new third information block, and outputting information of first T blocks in the new third information blocks as output of the decoder.

### Claim 12 (depends on 11)

The apparatus of claim 11, wherein in a case where the soft information updating is performed on the S initial encoding blocks in the staircase code to obtain the first information block, the updating module comprises:
an updating unit, which is configured to perform the soft information updating on the S initial encoding blocks Bi through N1_itr iterations to obtain the first information block, wherein 1≤i≤S, and N1_itr is an integer greater than 0.

### Claim 13 (depends on 1)

A storage medium, comprising stored programs, wherein the programs, when executed, perform the method of claim 1.

### Claim 14 (depends on 1)

A processor, which is configured to execute programs, wherein the programs, when executed, perform the method of claim 1.

### Claim 15 (depends on 2)

A storage medium, comprising stored programs, wherein the programs, when executed, perform the method of claim 2.

### Claim 16 (depends on 3)

A storage medium, comprising stored programs, wherein the programs, when executed, perform the method of claim 3.

### Claim 17 (depends on 4)

A storage medium, comprising stored programs, wherein the programs, when executed, perform the method of claim 4.

### Claim 18 (depends on 2)

A processor, which is configured to execute programs, wherein the programs, when executed, perform the method of claim 2.

### Claim 19 (depends on 3)

A processor, which is configured to execute programs, wherein the programs, when executed, perform the method of claim 3.

### Claim 20 (depends on 4)

A processor, which is configured to execute programs, wherein the programs, when executed, perform the method of claim 4.
