480 research outputs found
On the Concatenations of Polar Codes and Non-binary LDPC Codes
An interleaved concatenation scheme of polar codes with non-binary low-density parity check (NBLDPC) codes is proposed in this paper to improve the error-correcting performance of polar codes with finite code length. The information blocks of inner polar codes are split into several information sub-blocks, and several segment successive cancellation list (SSCL) decoders are carried out in parallel for all inner polar codes. Moreover, for a better error-correcting performance, an improved SCL decoder with a selective extension is proposed for the concatenated polar codes, which will be referred to selective extended segment SCL (SES-SCL) decoder. The SESSCL decoder uses soft information of some unreliable information sub-blocks for the decoding of subsequent sub-blocks so as to mitigate the error propagation of premature hard decision of S-SCL decoder. Simulation results show that NBLDPC-polar codes can outperform Reed Solomon (RS)-polar codes. NBLDPCpolar codes with the proposed SES-SCL algorithm can also be comparable to pure polar codes with cyclic redundancy check aided successive cancellation list (CA-SCL) decoding with list size L = 4 in the high SNR, but require lower decoding storage. Therefore, NBLDPC-polar codes may strike a better balance between memory space and performance compared to the state-of-art schemes in the finite length regime
Successive Cancellation Decoding of Single Parity-Check Product Codes
We introduce successive cancellation (SC) decoding of product codes (PCs)
with single parity-check (SPC) component codes. Recursive formulas are derived,
which resemble the SC decoding algorithm of polar codes. We analyze the error
probability of SPC-PCs over the binary erasure channel under SC decoding. A
bridge with the analysis of PCs introduced by Elias in 1954 is also
established. Furthermore, bounds on the block error probability under SC
decoding are provided, and compared to the bounds under the original decoding
algorithm proposed by Elias. It is shown that SC decoding of SPC-PCs achieves a
lower block error probability than Elias' decoding
Fast-SSC-Flip Decoding of Polar Codes
Polar codes are widely considered as one of the most exciting recent
discoveries in channel coding. For short to moderate block lengths, their
error-correction performance under list decoding can outperform that of other
modern error-correcting codes. However, high-speed list-based decoders with
moderate complexity are challenging to implement. Successive-cancellation
(SC)-flip decoding was shown to be capable of a competitive error-correction
performance compared to that of list decoding with a small list size, at a
fraction of the complexity, but suffers from a variable execution time and a
higher worst-case latency. In this work, we show how to modify the
state-of-the-art high-speed SC decoding algorithm to incorporate the SC-flip
ideas. The algorithmic improvements are presented as well as average
execution-time results tailored to a hardware implementation. The results show
that the proposed fast-SSC-flip algorithm has a decoding speed close to an
order of magnitude better than the previous works while retaining a comparable
error-correction performance.Comment: 5 pages, 3 figures, appeared at IEEE Wireless Commun. and Netw. Conf.
(WCNC) 201
- …