Fast and Scalable Soft Decision Decoding of Linear Block Codes
- Authors
- Choi, Changryoul; Jeong, Je chang
- Issue Date
- Oct-2019
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Maximum likelihood decoding; Reliability; Probabilistic logic; Approximation algorithms; Computational complexity; Signal to noise ratio; OSD; soft decision decoding; ordered statistics-based decoding; linear block codes
- Citation
- IEEE COMMUNICATIONS LETTERS, v.23, no.10, pp.1753 - 1756
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE COMMUNICATIONS LETTERS
- Volume
- 23
- Number
- 10
- Start Page
- 1753
- End Page
- 1756
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/12469
- DOI
- 10.1109/LCOMM.2019.2927218
- ISSN
- 1089-7798
- Abstract
- Ordered statistics-based decoding (OSD), which exhibits a near maximum likelihood decoding performance, suffers from huge computational complexity as the order increases. In this letter, we propose a fast and scalable OSD by considering the OSD as a fast searching problem. In the searching process, if the up-to-date minimum cost value is less than a predicted threshold value, then we can safely skip the search for remaining higher orders. The computational complexity of the proposed algorithm converges quickly to that of order one, regardless of the maximum order. Compared with the probabilistic necessary conditions-based OSD, the proposed algorithm exhibits speed-up gains of a factor of approximately 2,740 (at 3.0dB) for (127,64) BCH codes, with an indistinguishable decoding performance.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.