Results 21 to 30 of about 864 (198)

Neural-Network-Assisted Polar Code Decoding Schemes

open access: yesApplied Sciences, 2022
The traditional fast successive-cancellation (SC) decoding algorithm can effectively reduce the decoding steps, but the decoding adopts a sub-optimal algorithm, so it cannot improve the bit error performance. In order to improve the bit error performance
Hengyan Liu   +3 more
doaj   +1 more source

Folded successive cancelation decoding of polar codes [PDF]

open access: yes2014 Australian Communications Theory Workshop (AusCTW), 2014
Polar codes are the first explicit class of codes that are provably capacity-achieving under the successive cancelation (SC) decoding. As a suboptimal decoder, SC has quasi-linear complexity N(1 + log N) in the code length N. In this paper, we propose a new non-binary SC decoder with reduced complexity N/2(1 + log N/2) based on the folding operation ...
Sinan Kahraman   +2 more
openaire   +2 more sources

Molecular Polar Belief Propagation Decoder and Successive Cancellation Decoder [PDF]

open access: yes2019 IEEE International Workshop on Signal Processing Systems (SiPS), 2019
By constructing chemical reaction networks (CRNs), this paper proposes a method of synthesizing polar decoder using belief propagation (BP) algorithm and successive cancellation (SC) algorithm, respectively. Theoretical analysis and simulation results have validated the feasibility of the method. Reactions in the proposed design could be experimentally
Zhiwei Zhong   +4 more
openaire   +3 more sources

Partitioned successive-cancellation list decoding of polar codes [PDF]

open access: yes2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016
Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results. In this paper, a partitioned SCL algorithm is proposed to reduce the large memory requirements of the conventional
Seyyed Ali Hashemi   +4 more
openaire   +3 more sources

Joint power control and user grouping mechanism for efficient uplink non‐orthogonal multiple access‐based 5G communication: Utilising the Lèvy‐flight firefly algorithm

open access: yesIET Networks, EarlyView., 2023
We utilise a metaheuristic optimisation method, inspired by nature, called the Lévy‐flight firefly algorithm (LFA), to tackle the power regulation and user grouping in the NOMA systems. Abstract The non‐orthogonal multiple access strategies have shown promise to boost fifth generation and sixth generation wireless networks' spectral efficiency and ...
Zaid Albataineh   +4 more
wiley   +1 more source

Hardware architectures for successive cancellation decoding of polar codes [PDF]

open access: yes2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011
Submitted to ICASSP ...
Camille Leroux   +3 more
openaire   +3 more sources

Soft-Output Successive Cancellation Stack Polar Decoder [PDF]

open access: yesIEEE Transactions on Vehicular Technology, 2021
Polar coding has been ratified for employment in the 3GPP New Radio standard and several soft-decision decoders achieved comparable performance to that of the state-of-the-art successive cancellation list decoder. Aiming for further improving the performance of the soft-decision polar decoders, we propose a soft-output successive cancellation stack ...
Luping Xiang   +4 more
openaire   +2 more sources

Hardware Implementation of Successive-Cancellation Decoders for Polar Codes [PDF]

open access: yesJournal of Signal Processing Systems, 2012
The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low complexity successive cancellation (SC) decoding algorithm. Motivated by recent developments in polar coding theory, we propose a family of efficient hardware implementations
Camille Leroux   +5 more
openaire   +3 more sources

A Complexity Reduction Method for Successive Cancellation List Decoding [PDF]

open access: yesIEEE Transactions on Circuits and Systems II: Express Briefs, 2020
This brief introduces a hardware complexity reduction method for successive cancellation list (SCL) decoders. Specifically, we propose to use a sorting scheme so that L paths with smallest path metrics are also sorted according to their path indexes for path pruning.
openaire   +5 more sources

LLR-Based Successive Cancellation List Decoding of Polar Codes [PDF]

open access: yesIEEE Transactions on Signal Processing, 2014
We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties which simplify the sorting step involved in successive cancellation list decoding.
Alexios Balatsoukas-Stimming   +2 more
openaire   +6 more sources

Home - About - Disclaimer - Privacy