<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Infokommunikacionnye tehnologii</journal-id><journal-title-group><journal-title xml:lang="en">Infokommunikacionnye tehnologii</journal-title><trans-title-group xml:lang="ru"><trans-title>Инфокоммуникационные технологии</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2073-3909</issn><publisher><publisher-name xml:lang="en">Povolzhskiy State University of Telecommunications and Informatics</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">56132</article-id><article-id pub-id-type="doi">10.18469/ikt.2017.15.2.01</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">A NOVEL APPROACH TO DESIGN RESIDUE NUMBER SYSTEM</article-title><trans-title-group xml:lang="ru"><trans-title>НОВЫЙ ПОДХОД К ПРОЕКТИРОВАНИЮ СИСТЕМЫ ОСТАТОЧНЫХ КЛАССОВ</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Seyed</surname><given-names>Mostafa Mirhosseini</given-names></name><name xml:lang="ru"><surname>Сейед</surname><given-names>Мостафа Мирхоссеини</given-names></name></name-alternatives><email>s.m.mirhoseini@srbiau.ac.ir</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Amir</surname><given-names>Sabbagh Molahosseini</given-names></name><name xml:lang="ru"><surname>Амир</surname><given-names>Саббаг Молахоссеини</given-names></name></name-alternatives><email>sabbagh@iauk.ac.ir</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Mehdi</surname><given-names>Hosseinzadeh</given-names></name><name xml:lang="ru"><surname>Мехди</surname><given-names>Хоссеинзаде</given-names></name></name-alternatives><email>hosseinzadeh.m@Iums.ac.ir</email><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Islamic Azad University</institution></aff><aff><institution xml:lang="ru">Исламский университет Азад</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Iran University of Medical Sciences</institution></aff><aff><institution xml:lang="ru">Иранский медицинский университет</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2017-06-15" publication-format="electronic"><day>15</day><month>06</month><year>2017</year></pub-date><volume>15</volume><issue>2</issue><issue-title xml:lang="en">VOL 15, NO2 (2017)</issue-title><issue-title xml:lang="ru">ТОМ 15, №2 (2017)</issue-title><fpage>113</fpage><lpage>117</lpage><history><date date-type="received" iso-8601-date="2020-12-20"><day>20</day><month>12</month><year>2020</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2017, Seyed M.M., Amir S.M., Mehdi H.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2017, Сейед М.М., Амир С.М., Мехди Х.</copyright-statement><copyright-year>2017</copyright-year><copyright-holder xml:lang="en">Seyed M.M., Amir S.M., Mehdi H.</copyright-holder><copyright-holder xml:lang="ru">Сейед М.М., Амир С.М., Мехди Х.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc-nd/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.eco-vector.com/2073-3909/article/view/56132">https://journals.eco-vector.com/2073-3909/article/view/56132</self-uri><abstract xml:lang="en"><p>The Residue Number System (RNS) has been considered as an efficient parallel tool to increase the performance of computational systems. However, RNS consists of several parts which lead to complexity of RNS. In this paper, a new method to the design of RNS systems based on unification of the carry-propagate adders (CPAs) of the arithmetic units of RNS with reverse converter is presented. The proposed method eliminates the complex modular CPA for some of channels, and improves the current reverse converter designs by shifting some complex additions from arithmetic channel of RNS to the reverse converter. Experimental results shows a significant reduction in area, power consumption and the delay in compare with previous design.</p></abstract><trans-abstract xml:lang="ru"><p>Система остаточных классов (СОК) рассматривается в качестве эффективного параллельного инструмента повышения производительности вычислительных систем. Однако, СОК содержит некоторые компоненты, увеличивающие ее сложность. В данной статье предлагается новый подход к проектированию СОК, основанный на унификации последовательных сумматоров (ПС) в арифметических устройствах СОК для обратного преобразования. Предложенный метод исключает сложные модулярные ПС для некоторых каналов и улучшает существующие обратные преобразователи за счет перемещения некоторых сложных суммирований из арифметического канала СОК в обратный преобразователь. Экспериментальные результаты показывают существенное уменьшение аппаратных затрат, энергопотребления и задержки по сравнению с известными разработками.</p></trans-abstract><kwd-group xml:lang="en"><kwd>Residue Number System</kwd><kwd>computational system</kwd><kwd>adder</kwd><kwd>reverse conversion</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>система остаточных классов</kwd><kwd>вычислительная система</kwd><kwd>сумматор</kwd><kwd>обратное преобразование</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Parhami B. Computer Arithmetic: Algorithms and Hardware Design. Oxford, U.K.: Oxford Univ. Press, 2000.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Wang Y. Residue-to-binary converters based on new Chinese remainder theorems // IEEE Trans. Circuits Syst. II, Analog. Digit. Signal Process. Vol. 47, No. 3, Mar. 2000. - P. 197-205.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Wang Y., Abd-el-barr M. A new algorithm for RNS decoding // IEEE Trans. Circuits Syst. I, vol. 43, Dec. 1996. - P. 998-1001.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Molahosseini A.S., Navi K., Dadkhah C., Kavehei O., Timarchi S. Efficient Reverse Converter Designs for the New 4-Moduli Sets {2n-1, 2n, 2n+1, 22n+1-1} and {2n-1, 2n+1, 22n, 22n+1} Based on New CRTs // IEEE Transactions on Circuits and Systems-I, Vol. 57, No. 4, 2010. - P. 823-835.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Patronik P., Piestrak S.J. Design of Reverse Converters for the New RNS Moduli Set{ and }(odd) // IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 61, No. 12, Dec. 2014. - P. 3436-3449.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Sousa L., Antão S.F. MRC-based RNS Reverse Converters for the Four-Moduli Sets {, , , } and {, , , } // IEEE Transactions on Circuits and Systems-II, Vol. 59, No. 4, April 2012. - P. 244-248.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Chokshi R., Berezowski K.S., Shrivastava A., Piestrak S. J. Exploiting Residue Number System for Power-Efficient Digital SignalProcessing in Embedded Processors // Proc. of 2009 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, 2009. - P. 19-28.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Kalampoukas L. et al. High-Speed Parallel-Prefix Modulo Adders // IEEE Trans. Computers, Vol. 49, No. 7, July 2000. - P. 673-680.</mixed-citation></ref></ref-list></back></article>
