Results 31 to 40 of about 1,096,634 (365)
A Low Complexity Iterative Channel Estimation and Decoding Receiver Based on Reed-Solomon PTA
IEEE Access, 2016 A low-complexity iterative channel estimation and Reed-Solomon (RS) decoding receiver is developed. The joint channel estimation and decoding receiver is based on the linear minimum mean square error (LMMSE) channel estimation technique and the recently ...
Olayinka O. Ogundile +1 more
doaj +1 more source
Decoding Schemes for FBMC with Single-Delay STTC
EURASIP Journal on Advances in Signal Processing, 2010 Orthogonally multiplexed Quadrature Amplitude Modulation (OQAM) with Filter-Bank-based MultiCarrier modulation (FBMC) is a multicarrier modulation scheme that can be considered an alternative to the conventional orthogonal frequency division multiplexing
Chrislin Lélé +1 more
doaj +2 more sources
Symbol-level iterative information set decoding of RS codes
Alexandria Engineering Journal, 2023 This paper presents the implementation of a low-complex iterative symbol-level decoding scheme for Reed-Solomon codes. Most soft-decision iterative decoders for Reed-Solomon codes work on a bit level due to the efficient passing of soft information due ...
Yuval Genga +2 more
doaj
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.
Hanzo, Lajos +3 more
core +1 more source
Finite alphabet iterative decoders for LDPC codes surpassing floating-point iterative decoders [PDF]
Electronics Letters, 2011 Introduced is a new type of message-passing (MP) decoders for lowdensity parity-check (LDPC) codes over the binary symmetric channel. Unlike traditional belief propagation (BP) based MP algorithms which propagate probabilities or log-likelihoods, the new MP decoders propagate messages requiring only a finite number of bits for their representation in ...
Planjery, Shiva, +3 more
openaire +5 more sources
On the iterative decoding of sparse quantum codes [PDF]
Quantum Information and Computation, 2008 We address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however.
Poulin, David, Chung, Yeojin
openaire +4 more sources
Decoding and reprogramming fungal iterative nonribosomal peptide synthetases
Nature Communications, 2017 Nonribosomal peptide synthetases (NRPSs) assemble a large group of structurally and functionally diverse natural products. While the iterative catalytic mechanism of bacterial NRPSs is known, it remains unclear how fungal NRPSs create products of desired
Dayu Yu +3 more
semanticscholar +1 more source
Iterative decoding for MIMO channels via modified sphere decoding [PDF]
, 2004 In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multiantenna systems employing space-time codes, however, it is not clear what is the best way to ...
Hassibi, B., Kailath, T., Vikalo, H.
core +2 more sources
Applied Sciences, 2023 In this article we present an iterative system of equalization and decoding to manage the intersymbol interference over an additive white Gaussian noise (AWGN) channel.
Adriana-Maria Cuc +3 more
doaj +1 more source
On the Minimum Distance of Generalized Spatially Coupled LDPC Codes [PDF]
, 2013 Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes.
Costello Jr, Daniel J. +2 more
core +2 more sources