Fast and Scalable Soft Decision Decoding of Linear Block Codes
- Title
- Fast and Scalable Soft Decision Decoding of Linear Block Codes
- Author
- 정제창
- 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
- Issue Date
- 2019-10
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Citation
- IEEE COMMUNICATIONS LETTERS, v. 23, no. 10, Page. 1753-1756
- 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.
- URI
- https://ieeexplore.ieee.org/document/8756215https://repository.hanyang.ac.kr/handle/20.500.11754/154628
- ISSN
- 1089-7798; 1558-2558
- DOI
- 10.1109/LCOMM.2019.2927218
- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > ELECTRONIC ENGINEERING(융합전자공학부) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML