Results 31 to 40 of about 411,323 (275)

Polar Codes With Repeating Bits and the Construction by Cluster Pairwise Error Probability

open access: yesIEEE Access, 2019
A polar code with repeating bits (RB polar code), where a part of frozen bits only repeat their preceding information bits, is proposed. In the code construction, we propose cluster pairwise error probability (CPEP) to measure the competitiveness of the ...
Tao Wang, Daiming Qu, Tao Jiang
doaj   +1 more source

Multi-CRC Polar Codes and M-SCFlip-Based Decoding

open access: yesIEEE Access, 2019
A multi-cyclic redundancy check (Multi-CRC) polar code construction algorithm is proposed in this paper to solve the error propagation problem of successive cancellation decoding for polar codes.
Rui Guo, Kangni Chen, Huaping Liu
doaj   +1 more source

Low Power, Area Efficient Architecture for Successive Cancellation Decoder

open access: yesEmitter: International Journal of Engineering Technology, 2022
Polar codes have recently emerged as an error-correcting code and have become popular owing to their capacity-achieving nature. Polar code based communication system primarily consists of two parts, including Polar Encoder and Decoder.
Sujanth Roy J, G Lakshminarayanan
doaj   +1 more source

Performance comparison of systematic polar code and non-systematic polar code

open access: yesTongxin xuebao, 2019
Polar code in channel coding schemes is a research hotspot in 5G communication field.Polar code is susceptible to error propagation under successive cancellation decoding,and the performance of the code at short and medium block lengths is not ideal.For ...
Hui LI   +4 more
doaj   +2 more sources

Generalized Partially Information Coupled Polar Codes With Arbitrary Coupling Depth and Their Decoding Algorithms

open access: yesIEEE Access, 2021
We propose generalized partially information coupled (PIC) polar codes and their construction method. In the proposed codes, each code block (CB) shares systematic information bits partially with J adjacent CBs on each side, where J is referred to as the
Hyoungbae Ahn   +2 more
doaj   +1 more source

Concatenated LDPC-Polar Codes Decoding Through Belief Propagation

open access: yes, 2017
Owing to their capacity-achieving performance and low encoding and decoding complexity, polar codes have drawn much research interests recently. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two common approaches for ...
Abbas, Syed Mohsin   +3 more
core   +2 more sources

Polar Codes with exponentially small error at finite block length [PDF]

open access: yes, 2018
We show that the entire class of polar codes (up to a natural necessary condition) converge to capacity at block lengths polynomial in the gap to capacity, while simultaneously achieving failure probabilities that are exponentially small in the block ...
Błasiok, Jarosław   +2 more
core   +2 more sources

Design of concatenated Hash-Polar code based on segmented CRC code

open access: yesDianxin kexue, 2022
As a linear block code, the polarization code has a lower coding complexity and a definite structure, but when it has a short or medium code length, the performance will be reduced.A design method of concatenated HashPolar codes based on segmented cyclic
Zhengjie LI, Shunlan LIU, Xu ZHANG
doaj   +2 more sources

A RM-Polar Codes

open access: yesCoRR, 2014
In this letter we propose a new hybrid code called "RM-Polar" codes. This new codes are constructed by combining the construction of Reed-Muller (RM) code and Polar code. It has much larger minimum Hamming distance than Polar codes, therefore it has much better error performance than Polar codes.
Bin Li 0013, Hui Shen 0006, David Tse
openaire   +2 more sources

Belief Propagation Decoding of Polar Codes on Permuted Factor Graphs

open access: yes, 2018
We show that the performance of iterative belief propagation (BP) decoding of polar codes can be enhanced by decoding over different carefully chosen factor graph realizations.
Brink, Stephan ten   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy