Results 31 to 40 of about 613,611 (237)
Iterative source and channel decoding relying on correlation modelling for wireless video transmission [PDF]
, 2013 Since joint source-channel decoding (JSCD) is capable of exploiting the residual redundancy in the source signals for improving the attainable error resilience, it has attracted substantial attention.
Wang, Tao +3 more
core +1 more source
Erasure codes with a banded structure for hybrid iterative-ML decoding [PDF]
, 2009 This paper presents new FEC codes for the erasure channel, LDPC-Band, that have been designed so as to optimize a hybrid iterative-Maximum Likelihood (ML) decoding.
Soro, Alexandre +7 more
core +1 more source
Maximum-likelihood trellis decoding technique for balanced codes. [PDF]
, 1995 A low-complexity encoding and maximum-likelihood trellis decoding (MLTD) technique for nonlinear balanced codes is presented.
Markarian, G. S., Honary, B., Blaum, M.
core +4 more sources
A fully-parallel turbo decoding algorithm [PDF]
, 2015 This paper proposes a novel alternative to the Log-BCJR algorithm for turbo decoding, yielding significantly improved processing throughput and latency.
Maunder, R.G.
core +1 more source
Iterative channel equalization, channel decoding and source decoding
, 2005 The performance of soft source decoding is evaluated over dispersive AWGN channels. By employing source codes having error-correcting capabilities, such as Reversible Variable-Length Codes (RVLCs) and Variable-Length Error-Correcting (VLEC) codes, the ...
Wang, J., Yang, L-L., Hanzo, L.
core +1 more source
Belief Propagation Bit-Flip Decoder for Polar Codes
IEEE Access, 2019 The bit-flip method has been successfully applied to the successive cancellation (SC) decoder to improve the block error rate (BLER) performance for polar codes in the finite code length region.
Yongrun Yu +3 more
doaj +1 more source
Beyond 100 Gbit/s Pipeline Decoders for Spatially Coupled LDPC Codes
EURASIP Journal on Wireless Communications and Networking, 2022 Low-density parity-check (LDPC) codes are a well-established class of forward error correction codes that provide excellent error correction performance for large code block sizes.
Matthias Herrmann, Norbert Wehn
doaj +1 more source
Low-complexity trellis decoding of linear block codes. [PDF]
, 1995 The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed ...
Markarian, G. S. +2 more
core +4 more sources
IEEE Access, 2018 In this paper, we address a number of weaknesses of the windowed decoding of spatially coupled low-density parity-check (SC LDPC) codes and propose three modifications that simultaneously improve its performance, complexity, and latency.
Inayat Ali +4 more
doaj +1 more source
A Decoding Algorithm for LDPC Codes Over Erasure Channels with Sporadic Errors [PDF]
, 2010 An efficient decoding algorithm for low-density parity-check (LDPC) codes on erasure channels with sporadic errors (i.e., binary error-and-erasure channels with error probability much smaller than the erasure probability) is proposed and its performance ...
Paolini, Enrico +9 more
core +1 more source