Search Results for author:
Found 2 papers, 0 papers with code
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes
In particular, when the number of processing elements $P$ that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is $O\left(N^{1-1/\mu}+\frac{N}{P}\log_2\log_2\frac{N}{P}\right)$, where $N$ is the block length of the code and $\mu$ is the scaling exponent of the channel.
Information Theory Information Theory
Construction of Polar Codes with Reinforcement Learning
This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement learning techniques.
