Results 201 to 210 of about 8,087 (250)
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 decoder architectures
IEEE Communications Magazine, 2003Implementation constraints on iterative decoders applying message-passing algorithms are investigated. Serial implementations similar to traditional microprocessor datapaths are compared against architectures with multiple processing elements that exploit the inherent parallelism in the decoding algorithm. Turbo codes and low-density parity check codes,
null Engling Yeo +2 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
On allocation of turbo decoder iterations
14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003., 2004The computational requirements of turbo decoders are heavy and depend on the number of decoding iterations. However, only a few iterations are often enough for obtaining an error free outcome. Instead of idling during the unused iterations, the released time slots can be used for enabling extra iterations required by the decoding, when the errors are ...
Perttu Salmela +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 K. Moon +3 more
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
On iterative equalization, estimation, and decoding
IEEE International Conference on Communications, 2003. ICC '03., 2004We consider the problem of coded data transmission over an inter-symbol interference (ISI) channel with unknown and possibly time-varying parameters. We propose a low-complexity algorithm for joint equalization, estimation, and decoding using an estimator, which is separate from the equalizer.
Roald Otnes, Michael Tüchler
openaire +1 more source
Deriving the PCC iterative decoder from the SCC iterative decoder
2010 6th International Symposium on Turbo Codes & Iterative Information Processing, 2010In this paper, we show that the iterative decoder for parallel concatenated codes can be derived from the iterative decoder for serially concatenated codes. In order to show this, we use the observation that any parallel concatenated code (PCC) may be regarded as a serially concatenated code (SCC) with certain code constraints satisfied.
Anders Nilsson, Tor M. Aulin
openaire +1 more source
Iterative decoding in analog CMOS
Proceedings of the 13th ACM Great Lakes symposium on VLSI, 2003In this paper, a novel current-mode approach is proposed for implementing basic building blocks of an analog iterative decoder. The decoder is based on the so-called min-sum algorithm (also referred to as max-sum or max-product) and can be used to decode powerful coding schemes such as low-density parity-check (LDPC) codes and turbo codes. The proposed
Saied Hemati, Amir H. Banihashemi
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.
Michael Moher, T. Aaron Gulliver
openaire +2 more sources