US 11,784,749 B2
Polar coding Reed-Muller node optimization using Fast Hadamard Transform
Erman Koken, La Jolla, CA (US); Gabi Sarkis, San Diego, CA (US); Hobin Kim, San Diego, CA (US); Hari Sankar, San Diego, CA (US); Omar Mehanna, San Diego, CA (US); Shravan Kumar Reddy Garlapati, San Diego, CA (US); Alessandro Risso, San Diego, CA (US); and Afshin Haftbaradaran, San Diego, CA (US)
Assigned to QUALCOMM Incorporated, San Diego, CA (US)
Filed by QUALCOMM Incorporated, San Diego, CA (US)
Filed on Feb. 14, 2022, as Appl. No. 17/651,058.
Prior Publication US 2023/0261785 A1, Aug. 17, 2023
Int. Cl. H04L 1/00 (2006.01); H03M 13/13 (2006.01); H03M 13/00 (2006.01); H04B 1/7093 (2011.01)
CPC H04L 1/0057 (2013.01) [H03M 13/13 (2013.01); H04B 1/7093 (2013.01); H04L 1/0041 (2013.01); H04B 2001/70935 (2013.01)] 30 Claims
OG exemplary drawing
 
1. A first wireless device for wireless communication, comprising:
a memory; and
at least one processor coupled to the memory, wherein the processor is configured to:
receive a polar-encoded transmission comprising at least one intermediate node associated with a first configuration of frozen leaf nodes and information leaf nodes;
apply a Fast Hadamard Transform (FHT) to a first set of values associated with a first intermediate node of the at least one intermediate node to generate a second set of values associated with the first intermediate node;
select, based on the second set of values, one or more paths associated with the first intermediate node for a simplified successive cancellation list (SSCL) decoding;
calculate a path metric for each of the selected one or more paths associated with the first intermediate node; and
identify a path in the one or more paths based on the calculated path metric for each of the selected one or more paths associated with the first intermediate node, wherein the path is indicative of decoded data corresponding to the polar-encoded transmission.