BROWSE
Detail
Journal Article
Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes
Cited 0 time in 
Share 
Share
- Authors
- Changhyeon Kim, Dongyun Kam, Seokki Kim, Giyoon Park, Youngjoo Lee
- Issue Date
- 2022-08
- Citation
- IEEE Communications Letters, v.26, no.8, pp.1720-1724
- ISSN
- 1089-7798
- Publisher
- IEEE
- Language
- English
- Type
- Journal Article
- Abstract
- 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 Keywords
- Error correcting, Linear Block Codes, Low latency, Next-generation, Run time, Short-length, computational cost, state-of-The-Art