Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2022-08, Vol.26 (8), p.1720-1724
Main Authors: Kim, Changhyeon, Kam, Dongyun, Kim, Seokki, Park, Giyoon, Lee, Youngjoo
Format: Article
Language:English
Subjects:
Algorithms
Approximation algorithms
Block codes
Complexity theory
Computing costs
Costs
Decoding
Error correction
Linear block codes
Network latency
Optimized production technology
ordered statistic decoding
Reliability
Segmentation
Ultra reliable low latency communication
ultra-reliable low-latency communications
Wireless communications
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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\times 10 ^{4} times for achieving the low-BLER performance.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2022.3176646