Results 11 to 20 of about 613,611 (237)

SC-Fano Decoding of Polar Codes

open access: yesIEEE Access, 2019
For finite-length polar codes, the standard successive cancellation (SC) decoding has been improved, such as SC-List (SCL), SC-Stack (SCS), and SC-Flip (SCF) decodings.
Minoh Jeong, Songnam Hong
exaly   +3 more sources

Quasi-Optimal Path Convergence-Aided Automorphism Ensemble Decoding of Reed–Muller Codes [PDF]

open access: yesEntropy
By exploiting the rich automorphisms of Reed–Muller (RM) codes, the recently developed automorphism ensemble (AE) successive cancellation (SC) decoder achieves a near-maximum-likelihood (ML) performance for short block lengths.
Kairui Tian   +3 more
doaj   +2 more sources

Threshold Successive Cancellation Flip Decoding Algorithm for Polar Codes: Design and Performance [PDF]

open access: yesEntropy
In this paper, we propose the threshold successive cancellation flip (Th-SCF) decoding algorithm for polar codes, which enhances the performance of the SC decoder while maintaining low complexity.
Zhicheng Liu   +5 more
doaj   +2 more sources

Effective bi-directional overlapped sliding window decoding of SC-LDPC codes

open access: yesICT Express
In this paper, a bi-directional sliding window decoder is proposed for spatially coupled low-density parity-check (SC-LDPC) codes, which improves the decoding complexity and performance compared to the conventional sliding window decoding (SWD) by ...
Jiho Kim, Hyeong-Gun Joo, Dong-Joon Shin
doaj   +2 more sources

Low-Complexity Automorphism Ensemble Decoding of Reed-Muller Codes Using Path Pruning [PDF]

open access: yesEntropy
The newly developed automorphism ensemble decoder (AED) leverages the rich automorphisms of Reed–Muller (RM) codes to achieve near maximum likelihood (ML) performance at short code lengths.
Kairui Tian, Rongke Liu, Zheng Lu
doaj   +2 more sources

Adaptive nested trellis decoding for block codes. [PDF]

open access: yes, 1994
A new adaptive trellis decoding technique for block codes is proposed. The technique is based on an encoding technique which allows the design of almost all known linear codes together with their minimal trellises.
Markarian, G. S.   +5 more
core   +5 more sources

Decoupling Fabrication From Encoding: DNA-Addressable Template Microparticles for Large, User-Defined Optical Barcode Libraries. [PDF]

open access: yesAdv Sci (Weinh)
A universal hydrogel microparticle template with five DNA‐addressable domains decouples particle fabrication from barcode writing. Contact‐free multilaminar flow lithography produces >106 templates/h, and post‐fabrication domain‐selective hybridization converts one batch into large, user‐defined optical barcode libraries with robust decoding and re ...
Eguchi A   +5 more
europepmc   +2 more sources

SCF Decoding Algorithm Based on Log Likelihood Ratio and Channel Polarization Reliability [PDF]

open access: yesJisuanji gongcheng, 2022
The traditional Successive Cancellation bit-Flipping(SCF) decoding algorithm only uses the absolute value of Log Like Ratio(LLR) to measure the reliability of information bit decoding results, which leads to a high Block Error Rate(BLER) and more ...
HUANG Sheng, ZHENG Xiufeng, CAO Zhixiong
doaj   +1 more source

Reinforcement Learning for Bit-Flipping Decoding of Polar Codes

open access: yesEntropy, 2021
A traditional successive cancellation (SC) decoding algorithm produces error propagation in the decoding process. In order to improve the SC decoding performance, it is important to solve the error propagation.
Xiumin Wang   +3 more
doaj   +1 more source

Single and joint iterative decoding for higher order modulation schemes [PDF]

open access: yes, 2008
The research project described in this thesis concentrates on the study, and application of specific channel coding techniques, in particular, low-density parity-check (LDPC) codes, iterative decoding on Tanner graphs, and their application on joint ...
Vital, Juan Carlos Serrato
core   +7 more sources

Home - About - Disclaimer - Privacy