A Fully-Parallel Turbo Decoding Algorithm [PDF]
This paper proposes a novel alternative to the Logarithmic Bahl-Cocke-Jelinek-Raviv (Log-BCJR) algorithm for turbo decoding, yielding significantly improved processing throughput and latency. While the Log-BCJR processes turbo-encoded bits in a serial forwards-backwards manner, the proposed algorithm operates in a fully-parallel manner, processing all ...
Maunder, R.G.
openaire +6 more sources
Single and joint iterative decoding for higher order modulation schemes [PDF]
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
Detection and Coding Techniques for Fourth Generation Air-Interfaces based on Multicarrier Modulation [PDF]
This thesis investigates a number of multiple-access, multiuser detection (MUD) and channel coding methods for the downlink of 4G wireless systems based on multicarrier modulation.
Awad, Akram
core +6 more sources
Harmony search aided iterative channel estimation, multiuser detection and channel decoding for DS-CDMA [PDF]
A novel Multiuser Detection (MUD) scheme is proposed for DS-CDMA systems employing the so-called Harmony Search (HS) algorithm, which is a novel meta-heuristic optimisation method.
Zhang, Rong, Hanzo, Lajos
core +2 more sources
Low latency low power bit flipping algorithms for LDPC decoding [PDF]
Low Density Parity Check (LDPC) codes have been adopted in a number of wired and wireless communication standards due to their improved error correcting ability and relatively simple decoder structure.
Koçak, T +11 more
core +1 more source
An Improved SC Flip Decoding Algorithm of Polar Codes Based on Genetic Algorithm
Polar codes have been applied for physical downlink control channel in the 5th generation wireless communication system. Although successive cancellation flip (SCF) decoding algorithm can improve decoding performance of polar codes, it has also led to ...
Xiumin Wang +4 more
doaj +1 more source
Throughput improvement on bidirectional Fano algorithm [PDF]
Recently, we introduced a bidirectional Fano algorithm (BFA) [10] which can achieve much higher decoding throughput compared to the regular unidirectional Fano algorithm (UFA), especially at low signal-to-noise-ratio (SNR).
Koçak, T +7 more
core +1 more source
On the Power of Relaxed Local Decoding Algorithms [PDF]
A locally decodable code (LDC) C : \{ 0, 1\} k \rightarrow \{ 0, 1\} n is an error correcting code wherein individual bits of the message can be recovered by only querying a few bits of a noisy codeword. LDCs found a myriad of applications both in theory and in practice, ranging from probabilistically checkable proofs to distributed storage.
Tom Gur, Oded Lachish
openaire +5 more sources
On optimal and near-optimal turbo decoding using generalized max operator [PDF]
Motivated by a recently published robust geometric programming approximation, a generalized approach for approximating efficiently the max* operator is presented.
PAPAHARALABOS S +5 more
core +1 more source
A latency‐reduced SC flip decoding algorithm for polar codes
The successive cancellation flip (SC Flip) decoding algorithm was recently suggested for decoding polar codes, which could improve the performance of the frame error rate (FER).
Dong Yang, Yinyou Mao, Xingcheng Liu
doaj +1 more source

