Journal ArticleDOI
Class of algorithms for decoding block codes with channel measurement information
Reads0
Chats0
TLDR
It is shown that as the signal-to-noise ratio (SNR) increases, the asymptotic behavior of these decoding algorithms cannot be improved, and computer simulations indicate that even for SNR the performance of a correlation decoder can be approached by relatively simple decoding procedures.Abstract:
A class of decoding algorithms that utilizes channel measurement information, in addition to the conventional use of the algebraic properties of the code, is presented. The maximum number of errors that can, with high probability, be corrected is equal to one less than d , the minimum Hamming distance of the code. This two-fold increase over the error-correcting capability of a conventional binary decoder is achieved by using channel measurement (soft-decision) information to provide a measure of the relative reliability of each of the received binary digits. An upper bound on these decoding algorithms is derived, which is proportional to the probability of an error for d th order diversity, an expression that has been evaluated for a wide range of communication channels and modulation techniques. With the aid of a lower bound on these algorithms, which is also a lower bound on a correlation (maximum-likelihood) decoder, we show for both the Gaussian and Rayleigh fading channels, that as the signal-to-noise ratio (SNR) increases, the asymptotic behavior of these decoding algorithms cannot be improved. Computer simulations indicate that even for !ow SNR the performance of a correlation decoder can be approached by relatively simple decoding procedures. In addition, we study the effect on the performance of these decoding algorithms when a threshold is used to simplify the decoding process.read more
Citations
More filters
Journal ArticleDOI
Near-optimum decoding of product codes: block turbo codes
TL;DR: An iterative decoding algorithm for any product code built using linear block codes based on soft-input/soft-output decoders for decoding the component codes so that near-optimum performance is obtained at each iteration.
Book
Multi-Carrier and Spread Spectrum Systems
Khaled Fazel,Stefan Kaiser +1 more
TL;DR: In this paper, the authors provide an in-depth insight into hybrid multiple access techniques based on multi-carrier (MC) transmission, and present numerous hybrid access and air interface architectures including OFDM/CDMA, MC-CDMA and MT-CDMAC over new techniques such as space-time coding and software radio.
Book
OFDM and MC-CDMA for Broadband Multi-User Communications, WLANs and Broadcasting
TL;DR: In this article, the benefits of channel coding and space time coding in the context of various application examples and features numerous complete system design examples are discussed. But the authors do not discuss the trade-off between channel quality fluctuations and frequency domain spreading codes.
Journal ArticleDOI
Modulation and coding for linear Gaussian channels
G.D. Forney,G. Ungerboeck +1 more
TL;DR: This paper surveys how the capacity of the linear Gaussian channel has been met during the past half century, and new capacity-approaching techniques include turbo coding and decoding, multilevel coding, and combined coding/precoding for intersymbol-interference channels.
References
More filters
Journal ArticleDOI
A mathematical theory of communication
TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Book
Algebraic Coding Theory
TL;DR: This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field.