Results 31 to 40 of about 71,496 (178)

Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding [PDF]

open access: yes, 2019
We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric.
Amat, Alexandre Graell i   +2 more
core   +3 more sources

From maximum likelihood to iterative decoding [PDF]

open access: yes2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011
Iterative decoding is considered in this paper from an optimization point of view. Starting from the optimal maximum likelihood decoding, a (tractable) approximate criterion is derived. The global maximum of the approximate criterion is analyzed: the maximum likelihood solution can be retrieved from the approximate criterion in some particular cases ...
Alberge, Florence   +2 more
openaire   +2 more sources

ITERATIVE DECODING OF GEOMETRIC PRODUCT CODES

open access: yesElectrica, 2005
We present iterative decoding process of Geometric Product codes that is a newly proposed linear block code construction technique. We also report the bit error performances for one of the constructed code of the technique utilising our iterative ...
Gokmen ALTAY, Osman N. UCAN
doaj   +2 more sources

Hadamard–Viterbi Joint Soft Decoding for MFSK Underwater Acoustic Communications

open access: yesRemote Sensing, 2022
Multiple Frequency-Shift Keying (MFSK) has been used widely for underwater acoustic communications due to its low complexity and channel robustness.
Fei-Yun Wu   +3 more
doaj   +1 more source

Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression [PDF]

open access: yes, 2006
This paper discusses the Slepian–Wolf problem of distributed near-lossless compression of correlated sources. We introduce practical new tools for communicating at all rates in the achievable region.
Anna H. Lee   +6 more
core   +3 more sources

Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes

open access: yes, 2008
We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel.
Hehn, Thorsten   +3 more
core   +1 more source

Low-Complexity CRC Aided Joint Iterative Detection and SCL Decoding Receiver of Polar Coded SCMA System

open access: yesIEEE Access, 2020
As the fifth-generation (5G) wireless networks' key technology, the joint design of SCMA and polar code is concerned by the future communication system. In this paper, a CRC aided joint iterative detection and successive cancellation list (SCL) decoding (
Xi Wu, Yafeng Wang, Chuanfeng Li
doaj   +1 more source

Joint Source and Channel Decoding for Variable Length Encoded Turbo Codes

open access: yesEURASIP Journal on Advances in Signal Processing, 2007
Joint source and channel decoding (JSCD) has been proved to be an effective technique which can improve decoding performance by exploiting residual source redundancy.
Yang Yang   +3 more
doaj   +1 more source

Joint Decoding of LDPC Codes and Finite-State Channels via Linear-Programming

open access: yes, 2011
This paper considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to JD of binary-input FSCs.
Kim, Byung-Hak, Pfister, Henry D.
core   +1 more source

Wave-like Decoding of Tail-biting Spatially Coupled LDPC Codes Through Iterative Demapping

open access: yes, 2017
For finite coupling lengths, terminated spatially coupled low-density parity-check (SC-LDPC) codes show a non-negligible rate-loss. In this paper, we investigate if this rate loss can be mitigated by tail-biting SC-LDPC codes in conjunction with ...
Brown, André EX   +11 more
core   +3 more sources

Home - About - Disclaimer - Privacy