Results 211 to 220 of about 8,087 (250)
Some of the next articles are maybe not open access.
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
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
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
CONVERGENCE IMPROVEMENT OF ITERATIVE DECODERS
2006Iterative decoding techniques shaked the waters of the error correction and communications field in general. Their amazing compromise between complexity and performance offered much more freedom in code design and made highly complex codes, that were being considered undecodable until recently, part of almost any communication system.
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.
Gianmarco Romano +2 more
openaire +1 more source
Algebraic coding for iterative decoding
2003Series in Signal and Information Processing ...
openaire +2 more sources
On iterative soft-decision decoding of linear binary block codes and product codes
IEEE Journal on Selected Areas in Communications, 1998M Bossert
exaly
Near-Capacity H.264 Multimedia Communications Using Iterative Joint Source-Channel Decoding
IEEE Communications Surveys and Tutorials, 2012Lajos Hanzo
exaly