Proceedings ArticleDOI
Probabilistic Sufficient Conditions on Optimality for Reliability Based Decoding of Linear Block Codes
Wenyi Jin,M.P.C. Fossorier +1 more
- pp 2235-2239
TLDR
An efficient approach is introduced for reliability-based list decoding of a linear block code if a local optimal candidate satisfies a probabilistic sufficient condition and the average computation complexity is greatly reduced.Abstract:
In this work, an efficient approach is introduced for reliability-based list decoding of a linear block code. This method terminates the decoding if a local optimal candidate satisfies a probabilistic sufficient condition. The average computation complexity is greatly reduced with this method. The false alarm probability associated with the use of the probabilistic sufficient condition is also derived. Simulation results confirm the analysis with no performance degradation and important computation savings on average for soft decision decoding of the (255,239) RS code (reduction by a factor between 2 and 20).read more
Citations
More filters
Proceedings ArticleDOI
Performance comparison of short-length error-correcting codes
TL;DR: A universal decoder that can decode any linear binary block code is used: Gaussian-elimination based Maximum-Likelihood decoder on the erasure channel and probabilistic Ordered Statistics Decoder on the Gaussian channel.
Journal ArticleDOI
On short-length error-correcting codes for 5G-NR
TL;DR: Optimizations of the Ordered Statistics Decoder are discussed and revealed to bring near-ML performance with a notable complexity reduction, making the decoding complexity at very short length affordable.
Journal ArticleDOI
A Revisit to Ordered Statistics Decoding: Distance Distribution and Decoding Rules
TL;DR: Simulation results for decoding various eBCH codes demonstrate that the proposed techniques can significantly reduce the decoding complexity with a negligible loss in the decoding error performance.
Journal ArticleDOI
Probability-Based Ordered-Statistics Decoding for Short Block Codes
TL;DR: This letter proposes an efficient probability-based ordered-statistics decoding (PB-OSD) algorithm for short block-length codes that significantly reduces the decoding complexity under the same error performance, compared to the original OSD algorithm.
Journal ArticleDOI
Fast and Scalable Soft Decision Decoding of Linear Block Codes
Changryoul Choi,Jechang Jeong +1 more
TL;DR: This letter proposes a fast and scalable OSD by considering the OSD as a fast searching problem, and shows speed-up gains of a factor of approximately 2,740 for (127,64) BCH codes, with an indistinguishable decoding performance.
References
More filters
Journal ArticleDOI
Soft decision decoding of linear block codes based on ordered statistics
M.P.C. Fossorier,Shu Lin +1 more
TL;DR: A novel approach to soft decision decoding for binary linear block codes that achieves a desired error performance progressively in a number of stages and is terminated at the stage where either near-optimum error performance or a desired level of error performance is achieved.
Journal ArticleDOI
An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
TL;DR: Computer simulation results indicate, for some signal-to-noise ratios (SNR), that the proposed soft decoding algorithm requires less average complexity than those of the other two algorithms, but the performance of the algorithm is always superior to those ofthe other two.
Journal ArticleDOI
Box and match techniques applied to soft-decision decoding
TL;DR: The ordered statistics decoding algorithm is improved by using matching techniques to reduce the worst case complexity of decoding or to improve the error performance, to achieve practically optimal decoding of rate-1/2 codes of lengths up to 128.
Journal ArticleDOI
An improvement to generalized-minimum-distance decoding
D.J. Taipale,Michael B. Pursley +1 more
TL;DR: The performance of generalized minimum distance (GMD) decoding is better if the new criterion is used, and the weights used in GMD decoding are generalized to permit each of the possible M symbol values to have a different weight.
Journal ArticleDOI
Reliability-based code-search algorithms for maximum-likelihood decoding of block codes
D. Gazelle,J. Snyders +1 more
TL;DR: Efficient code-search maximum-likelihood decoding algorithms, based on reliability information, are presented for binary Linear block codes, applicable to codes of relatively large size.