US 12,273,194 B2
Iterative guessing random additive noise decoding (GRAND) in the presence of bursty channels
Hugo Tullberg, Nyköping (SE); and Guido Carlo Ferrante, Stockholm (SE)
Assigned to Telefonaktiebolaget LM Ericsson (publ), Stockholm (SE)
Appl. No. 18/563,102
Filed by Telefonaktiebolaget LM Ericsson (publ), Stockholm (SE)
PCT Filed Oct. 20, 2021, PCT No. PCT/SE2021/051043
§ 371(c)(1), (2) Date Nov. 21, 2023,
PCT Pub. No. WO2023/068973, PCT Pub. Date Apr. 27, 2023.
Prior Publication US 2024/0223306 A1, Jul. 4, 2024
Int. Cl. H03M 13/00 (2006.01); H03M 13/27 (2006.01); H03M 13/37 (2006.01); H04L 1/00 (2006.01)
CPC H04L 1/0045 (2013.01) [H03M 13/27 (2013.01); H03M 13/37 (2013.01); H04L 1/0071 (2013.01)] 15 Claims
OG exemplary drawing
 
1. A method performed by a first network node in a wireless communications network, the method comprising:
receiving a first stream of bits;
generating a first stream of candidate codewords by deinterleaving the first stream of bits;
determining a validity of a first bit of a first candidate codeword in the first stream of candidate codewords using guessing random additive noise decoding, GRAND;
subsequent to determining the validity of the first bit of the first candidate codeword, generating a second stream of bits by re-interleaving the first stream of candidate codewords;
determining whether a second bit in the second stream of bits is a potential error bit based on a location of the second bit relative to a location of the first bit in the second stream of bits and the validity of the first bit;
subsequent to determining whether the second bit is a potential error bit, generating a second stream of candidate codewords by deinterleaving the second stream of bits;
changing a value of a third bit of the second stream of candidate codewords based on whether the second bit is a potential error bit; and
subsequent to changing the value of the third bit, determining whether a second candidate codeword of the second stream of candidate codewords is within a threshold number of error bits from correct using GRAND, the second candidate codeword comprising the third bit.