Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes

@article{Sarkis2015FlexibleAL,
title={Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes},
author={Gabi Sarkis and Ido Tal and Pascal Giard and Alexander Vardy and Claude Thibeault and Warren J. Gross},
journal={IEEE Transactions on Communications},
year={2015},
volume={64},
pages={2732-2745}
}
• Published 13 July 2015
• Computer Science
• IEEE Transactions on Communications
In this paper, we present hardware and software implementations of flexible polar systematic encoders and decoders. The proposed implementations operate on polar codes of any length less than a maximum and of any rate. We describe the low-complexity, highly parallel, and flexible systematic-encoding algorithm that we use and prove its correctness. Our hardware implementation results show that the overhead of adding code rate and length flexibility is little, and the impact on operation latency…
• Computer Science
ArXiv
• 2017
8-bit and 16-bit parallel decoders that can be used to reduce the decoding latency of the successive-cancellation decoder are proposed and detail.
• Computer Science
2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)
• 2017
This work addresses the low-complexity construction of shortened and punctured polar codes from a unified view and significantly reduces the construction complexity as compared to state-of-the-art solutions while providing a block error rate performance comparable to constructions that are highly optimized for specific lengths and rates.
• Computer Science
IEEE Communications Letters
• 2016
This letter proposes three efficient encoders along with their full pseudocode implementations, all with θ(N log N) complexity, and shows that the best encoder requires exactly the same number of XORs as that of NSPE.
• Computer Science
IEEE Communications Letters
• 2016
An efficient encoding algorithm requiring only N bits of memory and having (N/2)log2N XOR operations is proposed, which can be directly used for NSPC with the same complexity.
• Computer Science
IEEE Transactions on Communications
• 2019
This paper presents fast implementations of the successive-cancellation list and SCF decoders for five newly identified types of nodes in the decoding tree of a polar code, which significantly improves the decoding latency.
• Computer Science
IEEE Communications Letters
• 2017
Five fast parallel decoders corresponding to different frozen-bit sequences to improve the decoding speed of polar codes are presented and achieves significant latency reduction without tangibly altering the bit-error-rate performance of the code.
• Computer Science
IEEE Journal on Selected Areas in Communications
• 2016
This paper presents a new algorithm based on unrolling the decoding tree of the code that improves the speed of list decoding by an order of magnitude when implemented in software and shows that for software-defined radio applications, the proposed algorithm is faster than the fastest software implementations of LDPC decoders in the literature.
• Computer Science
2018 IEEE Symposium on Computers and Communications (ISCC)
• 2018
A parallel polar encoding method for 5G communication is proposed and its performance with extended digital signal processor (DSP) instructions is evaluated, improving the performance by \$300 \times with negligible area and power overhead.
• Computer Science
EURASIP J. Wirel. Commun. Netw.
• 2019
An optimized encoding algorithm (OEA) of SPC is proposed that can reduce the number of XOR computing units compared with existing non-recursive algorithms and it is proved that this property of the generator matrix could extend to different code lengths and rates of the polar codes.
• Computer Science
Ann. des Télécommunications
• 2018
This paper presents the first optimized software implementation of a SCAN decoder for Polar codes, and demonstrates that the proposed software polar decoder can exceed 600 Mb/s on a single core and reaches multi-Gb/s when using four cores simultaneously.

References

SHOWING 1-10 OF 29 REFERENCES

• Computer Science
IEEE Transactions on Circuits and Systems II: Express Briefs
• 2015
This work analyzes the encoding process in the viewpoint of very-large-scale integration implementation and proposes a new efficient encoder architecture that is adequate for long polar codes and effective in alleviating the hardware complexity.
• Computer Science
IEEE Journal on Selected Areas in Communications
• 2014
This work aims to increase the throughput of polar decoding hardware by an order of magnitude relative to successive-cancellation decoders and is more than 8 times faster than the current fastest polar decoder.
• Computer Science
J. Signal Process. Syst.
• 2018
It is shown how adapting the algorithm at various levels can lead to significant improvements in latency and throughput, yielding polar decoders that are suitable for high-performance software-defined radio applications on modern desktop processors and embedded-platform processors.
• Computer Science
2015 28th IEEE International System-on-Chip Conference (SOCC)
• 2015
This paper proposes an encoding process which has the same complexity as non-systematic polar codes in the presence of an additional memory array without the additional memory elements and provides an analysis to quantify this additional increase of the complexity.
• Computer Science
2013 Information Theory and Applications Workshop (ITA)
• 2013
This work takes advantage of the recursive structure of polar codes to construct a unified scheme with a single encoder and decoder that can be used over the multi-channels and proves that the scheme achieves the capacity over this multi-channel.
• Computer Science
IEEE Communications Letters
• 2011
A modification is introduced of the successive-cancellation decoder for polar codes, in which local decoders for rate-one constituent codes are simplified. This modification reduces the decoding
• E. Arıkan
• Computer Science
IEEE Communications Letters
• 2011
This paper gives encoding and decoding methods for systematic polar coding that preserve the low-complexity nature of non-systematic polar coding while guaranteeing the same frame error rate.