Journal ArticleDOI
A new multilevel coding method using error-correcting codes
Hideki Imai,S. Hirakawa +1 more
Reads0
Chats0
TLDR
A new multilevel coding method that uses several error-correcting codes that makes effective use of soft-decisions to improve the performance of decoding and is superior to other multileVEL coding systems.Abstract:
A new multilevel coding method that uses several error-correcting codes is proposed. The transmission symbols are constructed by combining symbols of codewords of these codes. Usually, these codes are binary error-correcting codes and have different error-correcting capabilities. For various channels, efficient systems can be obtained by choosing these codes appropriately. Encoding and decoding procedures for this method are relatively simple compared with those of other multilevel coding methods. In addition, this method makes effective use of soft-decisions to improve the performance of decoding. The decoding error probability is analyzed for multiphase modulation, and numerical comparisons to other multilevel coding systems are made. When equally complex systems are compared, the new system is superior to other multilevel coding systems.read more
Citations
More filters
Proceedings ArticleDOI
Multi-level block coded modulations for the Rayleigh fading channel
N. Seshadri,C.-E.W. Sundberg +1 more
TL;DR: The proposed schemes provide 10-14 dB channel SNR (signal-to-noise ratio) gain over uncoded 4-DPSK modulations at a bit error rate of 10/sup -3/.
Patent
Adaptive receiver loops with weighted decision-directed error
TL;DR: In this paper, a method for communication using a modulation scheme defined in a signal space including determining demodulation confidence levels at a plurality of points distributed over the signal space is presented.
Journal ArticleDOI
Graph-based iterative decoding algorithms for parity-concatenated trellis codes
TL;DR: P parity-concatenated trellis codes are constructed and it is shown that asymptotically maximum-likelihood (ML) decoding and a posteriori probability (APP) decoding can be achieved using iterative decoders with only two iterations.
Journal ArticleDOI
Performance-Complexity Tradeoffs of Concatenated FEC for Higher-Order Modulation
TL;DR: Computer simulations of the resulting codes reveal that MLC not only provides significant advantages compared with BicM, but also outperforms several existing MLC and BICM proposals.
Journal ArticleDOI
Iterative Viterbi decoding, trellis shaping, and multilevel structure for high-rate parity-concatenated TCM
TL;DR: This work defines and applies a new algorithm called the iterative Viterbi decoding algorithm (IVA) to decode a high-rate parity-concatenated TCM system in which a trellis code is used as the inner code and a simple parity-check code is use as the outer code.
References
More filters
Journal ArticleDOI
Convolutional Codes and Their Performance in Communication Systems
TL;DR: This tutorial paper begins with an elementary presentation of the fundamental properties and structure of convolutional codes and proceeds with the development of the maximum likelihood decoder, which yields for arbitrary codes both the distance properties and upper bounds on the bit error probability.
Journal ArticleDOI
Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)
TL;DR: In this paper, the authors gave a tabulation of binary convolutional codes with maximum free distance for rates of 1/2, 1/3, and 1/4 for all constraint lengths up to and including nu = 14.
Journal ArticleDOI
Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)
TL;DR: In this paper, a search procedure was developed to find good short binary (N,N - 1) convolutional codes using simple rules to discard from the complete ensemble of codes a large fraction whose free distance d{free} either cannot achieve the maximum value or is equal to d_{free} of some code in the remaining set.
Journal ArticleDOI
Correction of errors in multilevel Gray coded data
TL;DR: Certain classes of low-rate binary codes that have simple decoding algorithms can be used as underlying codes in the construction of high-rate easily decodable i -compressed codes, which have higher rates than binary codes of comparable length and number of correctable errors.