A Random Coding Approach to Performance Analysis of the Locally Constrained Ordered Statistic Decoding

• DOI: 10.36227/techrxiv.22771085.v1
• Publication Date: 2023-05-11T02:27:57Z
• Authors: Jifan Liang; Xiao Ma
• Keywords: List decoding

<p>This paper is concerned with the locally constrained ordered statistic decoding (LC-OSD) of binary linear block codes, which a near maximum-likelihood algorithm. Compared conventional OSD, LC-OSD significantly reduces both maximum and average number searches. The former achieved by performing serial list Viterbi algorithm (SLVA) over trellis for local constraints on test error patterns, while latter incorporating tailored early termination criteria. main objective this to explore relationship between performance parameters, such as constraint degree size. To end, we approximate parity-check matrix totally random then estimate analyzing codes channels associated most reliable bits (MRBs). coding approach enables us derive an upper bound predict rank transmitted codeword in delivered LC-OSD. This allows balance size (or maximum) time complexity reduction. Simulation results show that approximation numerically effective powerful. also comparable other existing algorithms, including soft guessing additive noise (SGRAND), verifying efficiency universality LC-OSD.</p>