REDUCING THE SEARCH SPACE OF MAXIMUM-LIKELIHOOD DECODING FOR POLAR CODES

摘要

Certain aspects of the present disclosure generally relate to techniques for encoding, generally including obtaining a payload, determining a set of internal nodes to distribute one or more non-payload bits to based, at least in part, on a target maximum likelihood (ML) search space size for internal nodes in a polar decoding tree, a search space size of each of the internal nodes, and an available number of the non-payload bits left to distribute, forming an information stream by interleaving the non-payload bits with bits of the payload by, for each internal node in the set of internal nodes, assigning one or more non-payload bits to one or more leaf nodes in a subtree rooted at that internal node in the set of internal nodes, and generating a codeword by encoding the information stream using a Polar code.