Addendum to “A fully parallel algorithm for residue to binary conversion”

Previously, 2 VLSI designs of a residue-to-binary converter were presented and evaluated according to the VLSI model of computation. Subsequently, a VLSI AT lower bound for the residue-to-binary conversion was derived. It has been proved that not only do the proposed structures compare favorably wit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 55; číslo 1; s. 25 - 26
Hlavní autoři: Barsi, Ferrucio, Perotti, M.Cristina
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 07.07.1995
Elsevier Science
Elsevier Sequoia S.A
Témata:
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Previously, 2 VLSI designs of a residue-to-binary converter were presented and evaluated according to the VLSI model of computation. Subsequently, a VLSI AT lower bound for the residue-to-binary conversion was derived. It has been proved that not only do the proposed structures compare favorably with the previous results presented in the literature, but they also achieve the optimal AT figure for some choices of the residue system parameters.
AbstractList Previously, 2 VLSI designs of a residue-to-binary converter were presented and evaluated according to the VLSI model of computation. Subsequently, a VLSI AT lower bound for the residue-to-binary conversion was derived. It has been proved that not only do the proposed structures compare favorably with the previous results presented in the literature, but they also achieve the optimal AT figure for some choices of the residue system parameters.
Author Barsi, Ferrucio
Perotti, M.Cristina
Author_xml – sequence: 1
  givenname: Ferrucio
  surname: Barsi
  fullname: Barsi, Ferrucio
  organization: Dipartimento di Matematica, Università di Perugia, Perugia, Italy
– sequence: 2
  givenname: M.Cristina
  surname: Perotti
  fullname: Perotti, M.Cristina
  email: pinotti@iei.pi.cnr.it
  organization: Istituto di Elaborazione dell'Informazione del C.N.R., Via S. Maria 46, I-56100 Pisa, Italy
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3588908$$DView record in Pascal Francis
BookMark eNqFkDlOBDEQRS0EEsNyA4IWIoCgwXbvBEgtxCaBSCC2vJTByGMPdjcSGQeBy3ESPAwQEEBUyfu_qt4aWnbeAUJbBO8TTOoDjCnOMenwblftYYyLMu-X0IS0Dc1rQrplNPlBVtFajA8JqsuimaCrXilwapxmg8_eX177TI_WPmczHri1YDNu73www_000z5kAaJRI8xhYRwPz5n07glCNN69v7xtoBXNbYTNr7mObk9Pbo7P88vrs4vj_jKXtGmGvBZCi4Jo0E2hal1KJUCUlZK0qBUBIajQJcUdbgnUpKGdrsqSaKE6qdNzuFhH24veWfCPI8SBPfgxuLSS0aKhTUvaOkE7XxCPklsduJMmslkw03Q4K6q2TRsSdrjAZPAxBtBMmoEP6aEhcGMZwWwumc0NsrlB1lXsUzLrU7j8Ff6u_yd2tIhBkvRkILAoDTgJygSQA1Pe_F3wAWUXlwY
CODEN IFPLAT
CitedBy_id crossref_primary_10_1109_81_678485
Cites_doi 10.1016/0020-0190(94)90036-1
ContentType Journal Article
Copyright 1995
1995 INIST-CNRS
Copyright Elsevier Sequoia S.A. Jul 7, 1995
Copyright_xml – notice: 1995
– notice: 1995 INIST-CNRS
– notice: Copyright Elsevier Sequoia S.A. Jul 7, 1995
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/0020-0190(95)00034-A
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1872-6119
EndPage 26
ExternalDocumentID 6794735
3588908
10_1016_0020_0190_95_00034_A
002001909500034A
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M26
M41
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SME
SPC
SPCBC
SSV
SSZ
T5K
TN5
UQL
WH7
WUQ
XPP
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c277t-6bbfb31fef73d6f4cdbeb45dc236d1ebb2bf4209081e61729f5441fbd9cf03403
ISSN 0020-0190
IngestDate Sun Nov 30 05:21:27 EST 2025
Mon Jul 21 09:16:13 EDT 2025
Sat Nov 29 02:29:44 EST 2025
Tue Nov 18 21:27:04 EST 2025
Fri Feb 23 02:33:11 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Parallel algorithms
Integer
Lower bound
Parallel algorithm
VLSI circuit
Data conversion
Binary system
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c277t-6bbfb31fef73d6f4cdbeb45dc236d1ebb2bf4209081e61729f5441fbd9cf03403
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 237278186
PQPubID 45522
PageCount 2
ParticipantIDs proquest_journals_237278186
pascalfrancis_primary_3588908
crossref_citationtrail_10_1016_0020_0190_95_00034_A
crossref_primary_10_1016_0020_0190_95_00034_A
elsevier_sciencedirect_doi_10_1016_0020_0190_95_00034_A
PublicationCentury 1900
PublicationDate 1995-07-07
PublicationDateYYYYMMDD 1995-07-07
PublicationDate_xml – month: 07
  year: 1995
  text: 1995-07-07
  day: 07
PublicationDecade 1990
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Information processing letters
PublicationYear 1995
Publisher Elsevier B.V
Elsevier Science
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Science
– name: Elsevier Sequoia S.A
References Barsi, Pinotti (BIB1) 1994; 50
Barsi (10.1016/0020-0190(95)00034-A_BIB1) 1994; 50
References_xml – volume: 50
  start-page: 1
  year: 1994
  end-page: 8
  ident: BIB1
  article-title: A fully parallel algorithm for residue to binary conversion
  publication-title: Inform. Process. Lett.
– volume: 50
  start-page: 1
  year: 1994
  ident: 10.1016/0020-0190(95)00034-A_BIB1
  article-title: A fully parallel algorithm for residue to binary conversion
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(94)90036-1
SSID ssj0006437
Score 1.4264032
Snippet Previously, 2 VLSI designs of a residue-to-binary converter were presented and evaluated according to the VLSI model of computation. Subsequently, a VLSI AT...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 25
SubjectTerms Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science
Computer science; control theory; systems
Exact sciences and technology
Parallel algorithms
Parallel processing
Studies
Theoretical computing
Title Addendum to “A fully parallel algorithm for residue to binary conversion”
URI https://dx.doi.org/10.1016/0020-0190(95)00034-A
https://www.proquest.com/docview/237278186
Volume 55
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AIEXJ
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZKxwMS4o4oY8iaKAJVGYtzcfwYoVYMlYK0TuqbFSc2VOrark2n8Sf4zRzfUiougwdeoijOTT5fPp9zci4IvYgLWNRDWQawtCZBLNMoyFTJglAw2I9jmhamiOuQjkbZZMI-tVrffC7M5YzO59nVFVv-V1HDMRC2Tp39B3E3N4UDsA9Chy2IHbZ_JfhcU0m1OddaZZeQvKc97F97usb3bCZ1QPLnxWpafzk3EYZgbU-rjemfIWxqrolDN060rs3l9bqry1wygFna_ALtZ5iZhKCttx0sZRMhMJArwI0N87Lku1rUNnjgg-4mBtxiO3dbp4NN4tYOza0nzGfDnMqLzWJa9E6P8h9ZluhgN9sG9EhaYs0oATPV0aNjXlugdwdhjkaTX7K7dTQ0twcVnCVdwkyRnaCplrotqD36yAdnwyEf9yfj3VGzgKfARTRKXi4vAt2FTP-tdy1ZbqA9QhOWtdFeftKfvG_Wdv2b0wYN2VfwyZhh-qY59oolr90r_U7Zub0s1vAJKts75Sc1wOg243vojjNKcG7BdB-15PwBuusbfmDH_w_RiccWrhf4MMcGWdgjCzfIwgAU7JClT7XIwltkHT5CZ4P--O27wPXiCEpCaR2kQigRhUoqGlWpistKSBEnVUmitAqlEESomBwz0DClVoqZ0s3tlKhYqWAqjqPHqD1fzOUThFlGS0X0oC4_KcNMkUimGVjqrEjLquigyE8aL12het0vZcZ9RKKeaq6nmrOEm6nmeQcFzVVLW6jlmvOplwd3yqZVIjmg7ZorD3bE1zwuSrIMJqCD9r04ueOFNScRGAq6euTTP47uo1vbz-0ZaterjTxAN8vLerpePXdo_A4LfKw0
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Addendum+to+%22A+fully+parallel+algorithm+for+residue+to+binary+conversion%22&rft.jtitle=Information+processing+letters&rft.au=Barsi%2C+Ferrucio&rft.au=Perotti%2C+M+Cristina&rft.date=1995-07-07&rft.pub=Elsevier+Sequoia+S.A&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=55&rft.issue=1&rft.spage=25&rft_id=info:doi/10.1016%2F0020-0190%2895%2900034-A&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=6794735
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon