상세정보
학술지
Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes
- 발행일
- 202208
- 출처
- IEEE Communications Letters, v.26 no.8, pp.1720-1724
- ISSN
- 1089-7798
- 출판사
- IEEE
- 협약과제
- 21HH1200, 셀룰러 기반 산업 자동화 시스템 구축을 위한 5G 성능 한계 극복 저지연, 고신뢰, 초연결 통합 핵심기술 개발, 신재승
- 초록
- The ordered statistic decoding (OSD) algorithm for short-length linear block codes provides an attractive ML-approaching performance, expected to be used for the ultra-reliable low latency communication (URLLC) at the next-generation wireless solutions. To find the corrected codeword among numerous candidates, however, the decoding process requires a considerable amount of computational costs, which need to be simplified to achieve low-latency processing. In this letter, we present several schemes that relax the overall complexity of the state-of-the-art segmentation discarding algorithm. Without degrading the error-correcting power, our method approximate the internal steps for computing the segment sizes and the stopping bounds at the run time, reducing the average processing costs by 1.6×104 times for achieving the low-BLER performance.
- KSP 제안 키워드
- Error correcting, Linear Block Codes, Low latency, Next-generation, Run time, Short-length, computational cost, state-of-The-Art