Results 211 to 220 of about 7,364 (234)
Some of the next articles are maybe not open access.
Iterative Decoding With Replicas
IEEE Transactions on Information Theory, 2007Replica shuffled versions of iterative decoders for low-density parity-check (LDPC) codes and turbo codes are presented. The proposed schemes can converge faster than standard and plain shuffled approaches. Two methods, density evolution and extrinsic information transfer (EXIT) charts, are used to analyze the performance of the proposed algorithms ...
Juntan Zhang +3 more
openaire +1 more source
Iterative Decoding using Eigenmessages
IEEE Transactions on Communications, 2009The eigenmessage approach to iterative decoding introduces a degree of nonlocality into a belief propagation decoder by representing an entire set of messages around a cycle of the Tanner graph as a linear operator. The eigenvector for the operator represents a fixed point of the belief propagation algorithm around a cycle, with incident messages fixed.
Todd Moon +3 more
openaire +1 more source
IEEE Transactions on Information Theory, 1969
It is shown that use of a two-stage decoding procedure consisting simply of an inner stage of block decoding and an outer stage employing a single sequential decoder does not result in an improvement in the computational overflow problem for the sequential decoder.
openaire +2 more sources
It is shown that use of a two-stage decoding procedure consisting simply of an inner stage of block decoding and an outer stage employing a single sequential decoder does not result in an improvement in the computational overflow problem for the sequential decoder.
openaire +2 more sources
Soft Iterative Decoding for Overloaded CDMA
Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., 2006The probabilistic association algorithm (PDA) is proposed as a quasi-optimal solution for synchronous overloaded CDMA detection. Overloaded CDMA is useful in applications in which the band is a limited resource and more users are to be conveyed on the same channel.
ROMANO, Gianmarco +2 more
openaire +1 more source
1997
Though coding theory suggests long error correcting codes chosen at random perform close to the optimum, the problem of designing good codes has traditionally been attacked by developing codes with a lot of structure, which lends itself to feasible decoders.
openaire +1 more source
Though coding theory suggests long error correcting codes chosen at random perform close to the optimum, the problem of designing good codes has traditionally been attacked by developing codes with a lot of structure, which lends itself to feasible decoders.
openaire +1 more source
IEEE Transactions on Information Theory, 1970
Algorithms to decode iterated codes when at least one of the "component codes" is majority decodable are given. The decoding algorithms allow the use of the decoders of the component codes and still make it possible to correct all error patterns guaranteed to be correctable by the minimum distance of the iterated code.
openaire +2 more sources
Algorithms to decode iterated codes when at least one of the "component codes" is majority decodable are given. The decoding algorithms allow the use of the decoders of the component codes and still make it possible to correct all error patterns guaranteed to be correctable by the minimum distance of the iterated code.
openaire +2 more sources
Decoder diversity architectures for finite alphabet iterative decoders
2014 48th Asilomar Conference on Signals, Systems and Computers, 2014We present a finite alphabet iterative decoders (FAIDs), a new type of decoders for low-density parity check (LDPC) codes, which outperform much more complex belief-propagation-based counterparts in the error floor region. The FAID variable node update is a simple Boolean map, and we show that by varying this map one can achieve a class of decoders ...
Vasic, Bane +2 more
openaire +1 more source
1997
In this tutorial paper we present iterative algorithms which can be used for decoding of concatenated codes. The decoding operation is based on either a maximum a posteriori (MAP) algorithm or a Viterbi algorithm generating a weighted soft estimate of the input sequence.
openaire +1 more source
In this tutorial paper we present iterative algorithms which can be used for decoding of concatenated codes. The decoding operation is based on either a maximum a posteriori (MAP) algorithm or a Viterbi algorithm generating a weighted soft estimate of the input sequence.
openaire +1 more source
Iterative decoding algorithm of lattices
Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513), 2004The so-called min-sum algorithm for iterative decoding of low-density parity-check (LDPC) codes is generalized to decode lattices. An upper bound on the decoding complexity per iteration is derived, and for LDPC lattices constructed by Construction D' and using a nested sequence of LDPC codes, exact values for computational complexity are also given ...
M.R. Sadeghi +2 more
openaire +1 more source
Cross-entropy and iterative decoding
IEEE Transactions on Information Theory, 1998Summary: In this correspondence, the relationship between iterative decoding and techniques for minimizing cross-entropy is explained. It is shown that minimum cross-entropy (MCE) decoding is an optimal lossless decoding algorithm but its complexity limits its practical implementation.
Moher, Michael, Gulliver, T. Aaron
openaire +2 more sources