Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/20.500.12258/14645
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBergerman, M. V.-
dc.contributor.authorБергерман, М. В.-
dc.contributor.authorLyakhov, P. A.-
dc.contributor.authorЛяхов, П. А.-
dc.date.accessioned2020-12-01T09:18:38Z-
dc.date.available2020-12-01T09:18:38Z-
dc.date.issued2020-
dc.identifier.citationBergerman, M.V., Lyakhov, P.A., Voznesensky, A.S., Bogaevskiy, D.V., Kaplun, D.I. Designing reverse converter for data transmission systems from two-level RNS to BNS // Journal of Physics: Conference Series. - 2020. - Volume 1658. - Issue 1. - Номер статьи 012005ru
dc.identifier.urihttp://hdl.handle.net/20.500.12258/14645-
dc.description.abstractIn this paper, we present a reverse conversion from a two-stage Residue Number System (RNS) to a Binary Number System (BNS) with a special set of level 1 modules {2 a1, 2 a2 - 1, ..., 2an - 1} and level 2 modules {2 ß1, 2 ß2 - 1, ..., 2 ß k - 1}. The proposed method is based on the Chinese Remainder Theorem (CRT) with fractions and using a calculation method that uses constant multiplications to speed up calculations. This article discusses the simulation of FPGA reverse conversion to a two-stage RNS using the proposed method and the standard CRT using adders, their comparison of latency and hardware costsru
dc.language.isoenru
dc.publisherIOP Publishing Ltdru
dc.relation.ispartofseriesJournal of Physics: Conference Series-
dc.subjectNumbering systemsru
dc.subjectTransmissionsru
dc.subjectResidue number system (RNS)ru
dc.subjectBinary number system (BNS)ru
dc.subjectData communication systemsru
dc.subjectLevel-1ru
dc.titleDesigning reverse converter for data transmission systems from two-level RNS to BNSru
dc.typeСтатьяru
vkr.instИнститут математики и естественных наукru
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File SizeFormat 
scopusresults 1461 .pdf
  Restricted Access
1.06 MBAdobe PDFView/Open


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