CA-Polar Grand Decoder

Consider an original information block u

∈ GFn2 , which is first fed into a CRC
encoder Γ : GFn 2 → GF2 to yield a block v ∈ GF2 . Then, a polar encoder is
m m

employed to form the mapping Φ : GFm2 → GF2 , which gives the codeword c ∈
k

GFk2 .
A possible novel CA-Polar GRAND decoding algorithm has two steps:

Step 1: Reconstruct v from c through any type of polar decoder; this step yields v
^.
We need soft information about v^ for error pattern ordering;
Step 2: Use SGRAND to reconstruct u from v
^.
This algorithm is different from current CA-Polar Grand, I persume. The major
difference is that conventional GRAND was applied on c and this requires many
times of polar decoding despite they can be hard decoding. For the proposed
algorithm here, we do polar decoding only once.

Untitled 1