This paper presents a new latency reduction method for successive-cancellation (SC) decoding of polar codes that performs a frozen-bit checking on the rate-other (R-other) nodes of the Fast Simplified SC (Fast-SSC) pruning tree. The proposed method integrates the Fast-SSC algorithm and the Improved SSC method (frozen-bit checking of the R-other nodes). We apply a recognition-based method to search for as many constituent codes as possible in the decoding tree offline. During decoding, the current node can be decoded directly, if it is a special constituent code; otherwise, the frozen-bit check is executed. If the frozen-bit check condition is satisfied, the operation of the R-other node is the same as that of the rate-one node. In this paper, we prove that the frame error rate (FER) performance of the proposed algorithm is consistent with that of the original SC algorithm. Simulation results show that the proportion of R-other nodes that satisfy the frozen-bit check condition increases with the signal-to-noise-ratio (SNR). Importantly, our proposed method yields a significant reduction in latency compared to those given by existing latency reduction methods. The proposed method solves the problem of high latency for the Improved-SSC method at a high code rate and low SNR, simultaneously.
This paper proposes a modified polar coding-based selected mapping (PC-SLM) scheme to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency-division multiplexing (OFDM) systems. In the proposed transmitter, modulated signal vector for a subset of frozen bits, termed PAPR bits, are precomputed, enabling a single polar encoder and modulator to generate multiple modulation symbols, thereby significantly reducing the hardware complexity compared to existing PC-SLM schemes. To achieve side information (SI)-free transmission, a novel belief propagation (BP)-based receiver is introduced, incorporating a G-matrix-based early termination criterion and a frozen bit check (BP-GF) for joint detection and decoding. Simulation results show that the proposed scheme significantly reduces PAPR across various code lengths, with greater gains as the number of PAPR bits increases. Furthermore, for PC-SLM schemes employing the partially frozen bit method, the BP-GF-based receiver achieves a PAPR reduction and error correction performance comparable to that of the successive cancellation (SC)-based receiver. Additionally, the BP-GF-based receiver exhibits lower decoding latency than the successive cancellation list (SCL)-based receiver.