<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">46574253X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323111811.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170327e19900401xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF00929920</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF00929920</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A VLSI structure for X (mod m ) operation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Giuseppe Alia, Enrico Martinelli]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">High-computing speed and modularity have made RNS-based arithmetic processors attractive for a long time, especially in signal processing, where additions and multiplications are very frequent. The VLSI technology renewed this interest because RNS-based circuits are becoming more feasible; however, intermodular operations degradate their performance and a great effort results on this topic. In this paper, we deal with the problem of performing the basic operationX(modm), that is the remainder of the integer divisionX/m, for large values of the integerX, following an approximating and correcting approach, which guarantees the correctness of the result. We also define a structure to computeX(modm) by means of few fast VLSI binary multipliers, which is exemplified for 32-bit long numbers, obtaining a total response time lower than 200 nsec. Furthermore, such a structure is evaluated in terms of VLSI complexity and area and time figuresA=ϑ(n 2 T m 2 ) andT=ϑ(T M ) for the parameterT M in $$[\log n,\sqrt n ]$$ are derived. A simple positional-to-residue converter is finally presented, based on this structure; it improves some complexity results previously obtained by authors.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 1990</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Alia</subfield>
   <subfield code="D">Giuseppe</subfield>
   <subfield code="u">Instituto di Elettronic e Telecomunicazioni, Facoltá di Ingegneria, Universitá di Pisa, Via Diotisalvi, 2, 56100, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Martinelli</subfield>
   <subfield code="D">Enrico</subfield>
   <subfield code="u">Istituto di Elaborazione dell'Informazione del Consiglio Nazionale delle Ricerche, Via S. Maria, 46, 56100, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of VLSI signal processing systems for signal, image and video technology</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">1/4(1990-04-01), 257-264</subfield>
   <subfield code="x">0922-5773</subfield>
   <subfield code="q">1:4&lt;257</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">1</subfield>
   <subfield code="o">11265</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF00929920</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF00929920</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Alia</subfield>
   <subfield code="D">Giuseppe</subfield>
   <subfield code="u">Instituto di Elettronic e Telecomunicazioni, Facoltá di Ingegneria, Universitá di Pisa, Via Diotisalvi, 2, 56100, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Martinelli</subfield>
   <subfield code="D">Enrico</subfield>
   <subfield code="u">Istituto di Elaborazione dell'Informazione del Consiglio Nazionale delle Ricerche, Via S. Maria, 46, 56100, Pisa, Italy</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Journal of VLSI signal processing systems for signal, image and video technology</subfield>
   <subfield code="d">Springer Netherlands</subfield>
   <subfield code="g">1/4(1990-04-01), 257-264</subfield>
   <subfield code="x">0922-5773</subfield>
   <subfield code="q">1:4&lt;257</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">1</subfield>
   <subfield code="o">11265</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
