Results 41 to 50 of about 5,289 (159)

Enabling Fast Polar SC Decoding With IR-HARQ

open access: yesIEEE Communications Letters
To extend the applications of polar codes within next-generation wireless communication systems, it is essential to incorporate support for Incremental Redundancy (IR) Hybrid Automatic Repeat Request (HARQ) schemes. For very high-throughput applications, Successive Cancellation (SC) decoding is particularly appealing for polar codes owing to its high ...
Marwan Jalaleddine   +3 more
openaire   +2 more sources

Sequential Polar Decoding with Cost Metric Threshold

open access: yesApplied Sciences
Polar codes have established themselves as a cornerstone in modern error correction coding due to their capacity-achieving properties and practical implementation advantages. However, decoding polar codes remains a computationally intensive task. In this
Ilya Timokhin, Fedor Ivanov
doaj   +1 more source

A Low-Complexity Ordered Statistics Decoding Algorithm for Short Polar Codes

open access: yesApplied Sciences, 2019
In this paper, we propose a low-complexity ordered statistics decoding (OSD) algorithm called threshold-based OSD (TH-OSD) that uses a threshold on the discrepancy of the candidate codewords to speed up the decoding of short polar codes. To determine the
Yusheng Xing, Guofang Tu
doaj   +1 more source

Belief Propagation With Permutated Graphs of Polar Codes

open access: yesIEEE Access, 2020
The belief propagation (BP) decoding of polar codes provides better bit error rate (BER) and packet error rate (PER) performance than the successive cancelation (SC) decoding.
Liping Li, Liangliang Liu
doaj   +1 more source

A Decision-Aided Parallel SC-List Decoder for Polar Codes

open access: yesCoRR, 2015
In this paper, we propose a decision-aided scheme for parallel SC-List decoding of polar codes. At the parallel SC-List decoder, each survival path is extended based on multiple information bits, therefore the number of split paths becomes very large and the sorting to find the top L paths becomes very complex.
Bin Li 0013   +2 more
openaire   +2 more sources

Simplified Successive Cancellation Decoding of Polar Codes With Medium-Dimensional Binary Kernels

open access: yesIEEE Access, 2018
A method is proposed, called l-formula, to design efficient successive cancellation (SC) decoding of polar codes with medium-dimensional binary kernels (dimensions up to 16).
Zhiliang Huang   +5 more
doaj   +1 more source

A New Metric Function for SC-Based Polar Decoders: Polarization, Pruning, and Fast Decoders

open access: yesIEEE Transactions on Communications
Accepted for publication in IEEE Transactions on ...
Mohsen Moradi, Hessam Mahdavifar
openaire   +2 more sources

An FPGA-based accelerator for rapid simulation of SC decoding of polar codes

open access: yes2015 IEEE International Conference on Electronics, Circuits, and Systems (ICECS), 2015
In this paper we present an FPGA-based system for rapid frame error rate simulations of successive cancellation decoding of polar codes. Our system is implemented on a Xilinx Virtex-7 XC7VX485T FPGA and it supports polar codes of any rate and of blocklength up to N = 1024 bits on that device.
Johannes Wüthrich   +2 more
openaire   +1 more source

Improvement of Fast Simplified Successive-Cancellation Decoder for Polar Codes

open access: yesInformation, 2018
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.
Chao Xing, Zhiliang Huang, Shengmei Zhao
doaj   +1 more source

Design and Analysis of Punctured Terminated Spatially Coupled Protograph LDPC Codes With Small Coupling Lengths

open access: yesIEEE Access, 2018
Spatially coupled protograph (SC-P) low-density parity-check codes can achieve excellent performance and simple implementation when the coupling length is sufficiently large. However, in the case of small coupling lengths, terminated SC-P (TE-SC-P) codes
Zhaojie Yang   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy