Blind Recognition Algorithm of Reed-Solomon Codes Based on Multiple Threshold Judgment and Matrix Recording

IF 4.4 3区计算机科学 Q2 TELECOMMUNICATIONS IEEE Communications Letters Pub Date : 2024-10-18 DOI:10.1109/LCOMM.2024.3483281

Zhuolun Wu;Wei Zhang;Yihan Wang;Yanyan Liu

{"title":"Blind Recognition Algorithm of Reed-Solomon Codes Based on Multiple Threshold Judgment and Matrix Recording","authors":"Zhuolun Wu;Wei Zhang;Yihan Wang;Yanyan Liu","doi":"10.1109/LCOMM.2024.3483281","DOIUrl":null,"url":null,"abstract":"Reed-Solomon (RS) codes are widely utilized in systems such as digital transmission and storage systems because of their error-correcting capability. Nevertheless, the substantial number of iterative operations inherent to existing RS code recognition algorithms results in a considerable increase in computational complexity. In this letter, a blind recognition algorithm of RS codes based on multiple threshold judgment and the matrix recording is proposed. The multiple threshold judgment method terminates the iterative process when the threshold condition is satisfied, effectively reducing the recognition process’s computational complexity. Meanwhile, the matrix recording method significantly improves the recognition probability. Simulation results show that the false recognition probability of the proposed recognition algorithm is approaching the false recognition bottom bound and achieves a gain of 0.5dB for RS(31,15,8,37) compared to the low-complexity GFFT (LC-GFFT). Under favourable channel conditions, the computational complexity of the proposed recognition algorithm is reduced by 82.74% and 16.79% compared with the existing RS (31,15,8,37) and RS (255,239,8,285) blind recognition algorithms, respectively.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2709-2713"},"PeriodicalIF":4.4000,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10721469/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}

引用次数: 0

Abstract

Reed-Solomon (RS) codes are widely utilized in systems such as digital transmission and storage systems because of their error-correcting capability. Nevertheless, the substantial number of iterative operations inherent to existing RS code recognition algorithms results in a considerable increase in computational complexity. In this letter, a blind recognition algorithm of RS codes based on multiple threshold judgment and the matrix recording is proposed. The multiple threshold judgment method terminates the iterative process when the threshold condition is satisfied, effectively reducing the recognition process’s computational complexity. Meanwhile, the matrix recording method significantly improves the recognition probability. Simulation results show that the false recognition probability of the proposed recognition algorithm is approaching the false recognition bottom bound and achieves a gain of 0.5dB for RS(31,15,8,37) compared to the low-complexity GFFT (LC-GFFT). Under favourable channel conditions, the computational complexity of the proposed recognition algorithm is reduced by 82.74% and 16.79% compared with the existing RS (31,15,8,37) and RS (255,239,8,285) blind recognition algorithms, respectively.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于多阈值判断和矩阵记录的Reed-Solomon码盲识别算法

RS码由于其纠错能力在数字传输和存储系统中得到了广泛的应用。然而，现有RS码识别算法固有的大量迭代操作导致计算复杂性的显著增加。本文提出了一种基于多阈值判断和矩阵记录的RS码盲识别算法。多阈值判断方法在阈值条件满足时终止迭代过程，有效降低了识别过程的计算复杂度。同时，矩阵记录法显著提高了识别概率。仿真结果表明，与低复杂度GFFT （LC-GFFT）相比，本文提出的识别算法的误识别概率接近误识别下限，在RS（31、15、8、37）下实现了0.5dB的增益。在良好的信道条件下，与现有的RS（31、15、8、37）和RS（255,239、8,285）盲识别算法相比，本文算法的计算复杂度分别降低了82.74%和16.79%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

IEEE Communications Letters 工程技术-电信学

CiteScore

8.10

自引率

7.30%

发文量

590

审稿时长

2.8 months

期刊介绍： The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.