Ordered statistics-based list decoding techniques for linear binary block codes
1 Electrical Engineering Department, Mu’tah University, Mu’tah, P.O. BOX (7), Postal Code 61710, Jordan
2 College of Engineering, Swansea University, Singleton Park, Swansea SA2 8PP, UK
EURASIP Journal on Wireless Communications and Networking 2012, 2012:314 doi:10.1186/1687-1499-2012-314Published: 16 October 2012
The ordered statistics-based list decoding techniques for linear binary block codes of small to medium block length are investigated. The construction of a list of the test error patterns is considered. The original ordered-statistics decoding (OSD) is generalized by assuming segmentation of the most reliable independent positions (MRIPs) of the received bits. The segmentation is shown to overcome several drawbacks of the original OSD. The complexity of the ordered statistics-based decoding is further reduced by assuming a partial ordering of the received bits in order to avoid the complex Gauss elimination. The probability of the test error patterns in the decoding list is derived. The bit error rate performance and the decoding complexity trade-off of the proposed decoding algorithms is studied by computer simulations. Numerical examples show that, in some cases, the proposed decoding schemes are superior to the original OSD in terms of both the bit error rate performance as well as the decoding complexity.