Error performance analysis for reliability-based decoding algorithms
IEEE Transactions on Information Theory
Box and match techniques applied to soft-decision decoding
IEEE Transactions on Information Theory
Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix
IEEE Transactions on Information Theory
Soft-decision decoding of linear block codes based on ordered statistics
IEEE Transactions on Information Theory
Ordered statistics decoding of linear block codes on frequency nonselective multipath channels
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.07 |
In this paper, we present a generalization of the ordered statistics decoding (OSD) techniques for the class of intersymbol interference (ISI) channels, and show decoding results for the extended Bose-Chaudhuri-Hocquenghem (eBCH) code and the [255, 239, 17] Reed-Solomon (RS) binary image, over the PR2 partial response channel. Using the generalized OSD technique, we go on to generalize the Box-and-Match Algorithm (BMA) to the class of ISI channels. The BMA is an enhancement of OSD, and prior work has shown it to provide significant performance gain over OSD for memoryless additive white Gaussian noise (AWGN) channels. We present decoding results of the BMA for ISI channels, for the same eBCH and RS (binary image) codes, and PR2 channel. Our results show that the BMA (generalized for ISI channels) is superior to the OSD in terms of its performance/complexity trade-off. More specifically, the BMA may be tuned such that both algorithms have similar complexity, whereby the BMA still outperforms the OSD by a significant margin.