no. 16 · Tuesday 17 November 2026
Speculative Successive Cancellation Decoding of Polar Codes
Abstract
Polar codes achieve channel capacity as block length increases, but this asymptotic advantage comes at the cost of decoding speed: the conventional \ac{SC} algorithm is inherently sequential, which limits its practicality for high-throughput applications. This work addresses that limitation by introducing the \emph{\ac{Spec-SC}} framework, which incorporates speculative execution into the \ac{SC} decoding process. While \ac{sp-node}-based decoders enable partial parallelism for specific, predefined structures, \ac{Spec-SC} extends this capability by permitting parallel execution in general nodes that do not match any \acs{sp-node} pattern. A built-in verification mechanism ensures that this speculation does not compromise decoding correctness. Simulation results show that \ac{Spec-SC} achieves the same \acs{BER} and \acs{FER} performance as conventional \ac{SC} decoding, while reducing the average number of sequentially traversed nodes by up to $69\%$ for a polar code of length $N=4096$. A cycle-level analysis further shows that, for $\Pc(4096,3584)$ at $5\,\mathrm{dB}$, a heterogeneous four-core configuration achieves a $1.57\times$ decoding speedup using a total of $2944$ processing lanes, representing a $43.75\%$ increase over the $N_{\mathrm{lane}}=2048$ one-core \ac{SC} baseline. The speedup increases to $2.5\times$ at $7\,\mathrm{dB}$, demonstrating the increasing effectiveness of speculation at higher $\EbNo$. These results demonstrate that \ac{Spec-SC} enables additional algorithm-level parallelism beyond conventional \ac{sp-node}-based decoding, motivating its further investigation for high-throughput and high-reliability communication systems. achieve, paving the way for speculative hardware decoder implementations.
- comments
- 12 pages, 10 figures, submitted to IEEE for possible publication
- fields
- Information Theory