2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | C.5.3 | ||
| Paper Title | Fast Soft Decision Decoding of Linear Block Codes Using Partial Syndrome Search | ||
| Authors | Changryoul Choi, Jechang Jeong, Hanyang University, Korea (South) | ||
| Session | C.5: List Decoding | ||
| Presentation | Lecture | ||
| Track | Coding for Communications | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | Ordered statistics-based decoding (OSD) is a soft decision decoding algorithm for linear block codes, yielding near maximum likelihood decoding performance. The OSD algorithm first sorts the received symbols in descending order based on the reliability and partitions the sorted symbols into the most reliable bases (MRB) and least reliable bases (LRB). Owing to the nature of the ordering symbols in the LRB, we presume that the expected number of errors in the leftmost (or most significant) part of LRB is relatively small compared to that in the other parts of LRB. Based on this observation, we can omit the impossible candidates in advance, by using Hamming weights of partial syndromes. This results in huge computational savings without compromising the decoding performance. Compared with OSD based on probabilistic necessary conditions and probabilistic sufficient conditions [3], [4], incorporation of the proposed algorithm into fast and scalable OSD [7] exhibits speed-up gains of a factor of approximately 405 (at 3.0 dB) for (127,64) BCH codes (maximum order 5), without compromising the decoding performance. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
