US 12,463,747 B2
Polar decoder and associated method
Huayi Zhou, Montreal (CA); Ryan Meng Yong Seah, Montreal (CA); Marwan Jalaleddine, Montreal (CA); and Warren Jeffrey Gross, Montreal (CA)
Assigned to THE ROYAL INSTITUTION FOR THE ADVANCEMENT OF LEARNING/MCGILL UNIVERSITY, Montreal (CA)
Filed by The Royal Institution for the Advancement of Learning / McGill University, Montreal (CA)
Filed on Jun. 5, 2024, as Appl. No. 18/734,486.
Claims priority of provisional application 63/506,252, filed on Jun. 5, 2023.
Prior Publication US 2024/0405915 A1, Dec. 5, 2024
Int. Cl. H03M 13/00 (2006.01); H03M 13/29 (2006.01); H04L 1/00 (2006.01)
CPC H04L 1/0057 (2013.01) [H03M 13/2927 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method for decoding a noisy codeword, the noisy codeword comprising a plurality of codeword symbols corresponding to a plurality of input symbols encoded via an encoder and transmitted via a noisy channel, the method comprising:
generating an optimization problem comprising an objective function, the objective function being evaluated according to variables of candidate solutions, said variables comprising:
a plurality of main variables, each corresponding to one of a plurality of nodes in an encoding graph implemented by the encoder, said main variables comprising input variables at output nodes of the encoding graph and output variables at input nodes of the encoding graph, and
a plurality of ancillary variables, each corresponding to an additional output of one of a plurality of logical operations in the encoding graph,
wherein the objective function comprises an aggregation of constraints, the constraints comprising:
node constraints configured to generate a first cost penalty when the main and ancillary variables of a candidate solution disagree with conditions of the encoding graph implemented by the encoder, and
receiver constraints configured to generate a second cost penalty corresponding to a cross-entropy between each codeword symbol and a corresponding one of the input variables; and
solving the optimization problem to obtain a candidate solution, wherein the output variables in the candidate solution correspond to decoded symbols.