Results 261 to 270 of about 13,641 (300)
Some of the next articles are maybe not open access.
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
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
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
Iterative Decoding for GERAN MBMS
2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications, 2006Various advanced methods have been proposed to achieve sufficiently high throughput as well as reliability for multimedia broadcast multicast services (MBMS) within 3GPP RAN and GERAN. One of the methods which yield promising results with only marginal system modifications is based on outer Reed-Solomon (RS) coding on the radio link control (RLC) layer.
Wen Xu 0001 +4 more
openaire +1 more source
Iterative decoding of multiple descriptions
Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), 1999This paper considers the transmission of multiple descriptions over noisy channels rather than the on-off channels that are traditionally considered. We introduce the use of iterative decoding techniques similar to those used in "turbo" decoding to decode multiple correlated descriptions transmitted over a noisy channel.
openaire +1 more source
Iterative decoding beyond belief propagation
2010 Information Theory and Applications Workshop (ITA), 2010At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by belief propagation (BP). The BP is an inference algorithm which operates on a graphical model of a code, and lends itself to low-complexity and high-speed implementations, making it the algorithm of choice in many applications. It
Shiva Kumar Planjery +4 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
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.
Gianmarco Romano +2 more
openaire +1 more source
On the Robustness of Iterative Decoders
23rd Biennial Symposium on Communications, 2006, 2006Robustness of iterative decoders, i.e., their ability to successfully decode the received signal in spite of unknown changes in the channel parameter, is investigated. More specifically, using low-density parity-check codes and iterative message-passing decoders for error correction, we consider reliable communication over a binary-input power-limited ...
P. Zarrinkhat, M. Ardakani
openaire +1 more source
Algebraic coding for iterative decoding
2003Series in Signal and Information Processing ...
openaire +2 more sources