Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12258/18568
Title: Algorithm for constructing modular projections for correcting multiple errors based on a redundant residue number system using maximum likelihood decoding
Authors: Babenko, M. G.
Бабенко, М. Г.
Nazarov, A. S.
Назаров, А. С.
Vashchenko, I. S.
Ващенко, И. С.
Keywords: Data handling;Decoding;Digital storage;Error;Maximum likelihood;Numbering systems;Residue number system (RNS)
Issue Date: 2021
Publisher: Pleiades journals
Citation: Babenko, M., Nazarov A., Tchernykh, A., Pulido-Gaytan B., Cortés-Mendoza, J. M., Vashchenko, I. Algorithm for constructing modular projections for correcting multiple errors based on a redundant residue number system using maximum likelihood decoding // Programming and Computer Software. - 2021. - Том 47. - Выпуск 8. - Стр.: 839 - 848. - DOI 10.1134/S0361768821080089
Series/Report no.: Programming and Computer Software
Abstract: One of the most important applications of the Redundant Residual Numbers System (RRNS) is to improve the fault tolerance of the data storage, processing, and transmission. Correcting multiple errors is a challenging computational task. This complexity is mainly due to the numerous combinations of erroneous residuals at the error localization stage. In this paper, we propose an approach for constructing modular projections to correct any number of errors. The algorithm uses the Maximum Likelihood Decoding (MLD) and the Approximate Rank (AR) to reduce the number of projections and processing time. AR-RRNS with MLD algorithm can provide the number of modular projections close to the theoretical lower bound of the most efficient state-of-the-art algorithm.
URI: http://hdl.handle.net/20.500.12258/18568
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
scopusresults 2000 .pdf
  Restricted Access
574.75 kBAdobe PDFView/Open
WoS 1357 .pdf
  Restricted Access
85.93 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.