Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Variable-Complexity Trellis Decoding Of Binary Convolutional Codes, David W. Matolak, S. G. Wilson
Variable-Complexity Trellis Decoding Of Binary Convolutional Codes, David W. Matolak, S. G. Wilson
Faculty Publications
Considers trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance "near" that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best according to the criteria are tabulated, Several codes with effective free distance better than the best code of comparable complexity were found. Asymptotic (high SNR) performance analysis and error propagation are discussed. Simulation results are also provided.
Coded Modulation For Satellite Broadcasting, Robert H. Morelos-Zaragoza, Oscar Y. Takeshita, Hideki Imai, Marc P. C. Fossorier, Shu Lin
Coded Modulation For Satellite Broadcasting, Robert H. Morelos-Zaragoza, Oscar Y. Takeshita, Hideki Imai, Marc P. C. Fossorier, Shu Lin
Faculty Publications
In this paper, three-level block coded 8-PSK modulations, suitable for satellite broadcasting of digital TV signals, are presented. A design principle to achieve unequal error protection is introduced. The coding scheme is designed in such a way that the information bits carrying the basic definition TV signal have a lower error rate than the high definition information bits. The large error coefficients, formally associated with standard mapping by set partitioning, are reduced by considering a nonstandard partition of an 8-PSK signal set. The bits-to-signal mapping induced by this partition allows the use of suboptimal low-complexity soft-decision decoding of binary block …