Results 71 to 80 of about 1,102,641 (266)
Iterative min-sum decoding of tail-biting codes [PDF]
, 1998 By invoking a form of the Perron-Frobenius theorem for the “min-sum” semi-ring, we obtain a union bound on the performance of iterative decoding of tail-biting codes.
Aji, Srinivas +3 more
core +2 more sources
Iterative Syndrome-Based Deep Neural Network Decoding
IEEE Open Journal of the Communications SocietyWhile the application of deep neural networks (DNNs) for channel decoding is a well-researched topic, most studies focus on hard output decoding, potentially restricting the practical application of such decoders in real communication systems.
Dmitry Artemasov +3 more
doaj +1 more source
Partial IDS decoding based on the base graph of protograph LDPC codes
IET Communications, 2023 The residual belief propagation (RBP) algorithm, which is the most classic informed dynamic scheduling strategy, achieves outstanding performance in error correction and can drastically accelerate convergence speed.
Shuo Liang, Xingcheng Liu, Suipeng Xie
doaj +1 more source
Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes
IEEE Access, 2022 In this paper, novel hard-decision iterative decoding algorithms for binary Reed-Muller (RM) codes are presented. First, two algorithms are devised based on the majority-logic decoding algorithm with reliability measures of the received sequence. The bit-
Yong-Ting Ni +4 more
doaj +1 more source
Finite alphabet iterative decoding (FAID) of the (155,64,20) Tanner code
International Symposium on Turbo Codes and Iterative Information Processing, 2010 It is now well established that iterative decoding approaches the performance of Maximum Likelihood Decoding of sparse graph codes, asymptotically in the block length.
D. Declercq +4 more
semanticscholar +1 more source
THE EFFECT OF TRELLIS TERMINATION ON THE PERFORMANCE OF TURBO CODE
Journal of Engineering, 2003 This paper introduces a new class of convolutional codes, which is called Turbo Code. Turbo Code was shown to achieve performance in terms of Bit-Error-Rate (BER), which is near Shannon limit.
H.H. Abbas, W. A. Mahmoud, S.K. Omran
doaj +1 more source
Soft-In Soft-Out Polar Decoding Aided Three-Stage Concatenated Iterative MIMO-Turbo Transceivers
IEEE Open Journal of Vehicular Technology, 2023 A novel Soft-Input Soft-Output (SISO) polar decoding algorithm is proposed, which is capable of iterating between an inner and outer decoder in a three-stage serial concatenated iterative receiver. The proposed polar decoding algorithm leverages a hybrid
Zeynep B. Kaykac Egilmez +3 more
doaj +1 more source
Semi-iterative analog turbo decoding [PDF]
2006 IEEE International Symposium on Circuits and Systems, 2006 This paper presents a novel analog turbo decoding architecture allowing analog decoders for long frame lengths to be implemented on a single chip. This is made possible by suitably using slicing techniques which allow hardware reuse and reconfigurability. The architecture is applied to a DVB-RCS-like code.
Arzel, Matthieu +3 more
openaire +3 more sources
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes [PDF]
arXiv, 2005 The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received ...
arxiv
Turbo codes and turbo algorithms
Journal of Communications Software and Systems, 2006 In the first part of this paper, several basic ideas that prompted the coming of turbo codes are commented on. We then present some personal points of view on the main advances obtained in past years on turbo coding and decoding such as the circular ...
Claude Berrou, Charlotte Langlais, Yi Yu
doaj