Parallel-array implementations of a non-restoring square root algorithm

In this paper we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQRT has several features unlike other implementations. First, it does not use redundant representation for square root resu...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings International Conference on Computer Design VLSI in Computers and Processors s. 690 - 695
Hlavní autori: Yamin Li, Wanming Chu
Médium: Konferenčný príspevok..
Jazyk:English
Japanese
Vydavateľské údaje: IEEE 01.01.1997
Predmet:
Circuits
Clocks
Concurrent computing
Equations
Hardware
Iterative algorithms
Throughput
ISBN:9780818682063, 081868206X
ISSN:1063-6404
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this paper we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQRT has several features unlike other implementations. First, it does not use redundant representation for square root result. Second, each iteration generates an exact resulting value. Next it does not require any conversion on the inputs of the CSA. And last, a precise remainder can be obtained immediately. Furthermore, we present an improved version-a root-select parallel-array implementation (RS-PASQRT) for fast result value generation. The RSPASQRT is capable of achieving up to about 150% speedup ratio over the PASQRT. The simplicity of the implementations indicates that the proposed approach is an alternative to consider when designing a fully pipelined square root unit.
AbstractList In this paper we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQRT has several features unlike other implementations. First, it does not use redundant representation for square root result. Second, each iteration generates an exact resulting value. Next it does not require any conversion on the inputs of the CSA. And last, a precise remainder can be obtained immediately. Furthermore, we present an improved version-a root-select parallel-array implementation (RS-PASQRT) for fast result value generation. The RSPASQRT is capable of achieving up to about 150% speedup ratio over the PASQRT. The simplicity of the implementations indicates that the proposed approach is an alternative to consider when designing a fully pipelined square root unit.
Author Yamin Li
Wanming Chu
Author_xml – sequence: 1
  surname: Yamin Li
  fullname: Yamin Li
  organization: Comput. Archit. Lab., Univ. of Aizu, Japan
– sequence: 2
  surname: Wanming Chu
  fullname: Wanming Chu
BookMark eNotj71OwzAUhS1RJErJjpj8Ag73xk5sjyhAqVQJBpirm9QuQUlc7DD07YnUnuWTznB-btliDKNj7B4hRwT7uKnr5xyt1XlVGKvgimVWGzBoKlNAJRdsiTNEpUDdsCylH5ilSrSlWbL1B0Xqe9cLipFOvBuOvRvcONHUhTHx4DnxuVFEl6YQu_HA0-8fRcdjCBOn_jCb0_dwx6499cllF67Y1-vLZ_0mtu_rTf20FR1qmESLFrxttTdaKmygMU43yqMxUmpA0kWpLVWqLBSg9fNKU7ZSl7AH3TrayxV7OOd2zrndMXYDxdPu_Fz-A4VOTac
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICCD.1997.628940
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 695
ExternalDocumentID 628940
GroupedDBID -~X
29F
29O
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i170t-c190f9c7f87341b0b8e7b4f18833701a72579a64524019f45185c3750d07cead3
IEDL.DBID RIE
ISBN 9780818682063
081868206X
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=628940&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1063-6404
IngestDate Tue Aug 26 16:40:59 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i170t-c190f9c7f87341b0b8e7b4f18833701a72579a64524019f45185c3750d07cead3
PageCount 6
ParticipantIDs ieee_primary_628940
PublicationCentury 1900
PublicationDate 1997-01-01
PublicationDateYYYYMMDD 1997-01-01
PublicationDate_xml – month: 01
  year: 1997
  text: 1997-01-01
  day: 01
PublicationDecade 1990
PublicationTitle Proceedings International Conference on Computer Design VLSI in Computers and Processors
PublicationTitleAbbrev ICCD
PublicationYear 1997
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000451958
ssj0008317
Score 1.4519304
Snippet In this paper we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the...
SourceID ieee
SourceType Publisher
StartPage 690
SubjectTerms Circuits
Clocks
Concurrent computing
Equations
Hardware
Iterative algorithms
Throughput
Title Parallel-array implementations of a non-restoring square root algorithm
URI https://ieeexplore.ieee.org/document/628940
WOSCitedRecordID wos628940&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYoAFKEW85YHVrVO7fsyFAhKqOgDqVjmODZX6Ik2R-PecnaaAxMIWW4ocXc6-l-_7ELpmyoeCpiNaqIxwbjokBbeImERm2nhlk4hT8PIo-301HOrBGmc79sI45-LlM9cMj7GWn83tKqTKWgKiAw7x-baUomzV2qRTNrAp60NYsUi2CwEPI4JTHqEfAzR8m4oKeKcas6p8SXXrodu9CR18slku9ot0Jdqc3v6_vvYANb579_BgY5UO0Zab1dHeD9jBI3Q3MHmgUJkQk-fmE4-n1SXyqIR47rHBs_mM5JF2Bt7By3dQJYfBzS6wmbzCZPE2baDn3u1T956sCRXIOJG0ICB46rWVXkkwXilNlZMp90kgHJY0MRL2rzah1AlRl_YgUtWxDHyKjEoLKseOUQ1WdycIQxjnbAaHgUgDZCDTNrXGZFwwLlPRtqeoHiQyWpSYGaNSGGd_zp6j3RIUNiQ2LlCtyFfuEu3Yj2K8zK_if_4CI7yhMQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG8MmqgXFTF-24PXQkfL2p5RlIiEAxpupOs6JeFDxzDxv_e121ATL97WJkuXt9e-r77fD6FrJhNX0LREhTImnOsWicAtIjoQsdKJNIHHKXjuiX5fjkZqUOBs-14Ya62_fGbr7tHX8uOFWblUWSOE6IBDfL7piLOKZq11QmUNnFIcw5J5ul0IeRgJOeUe_NGBwzdpWELvlGNWFjCpanTb7RvXwyfq-XK_aFe81ens_et791Htu3sPD9Z26QBt2HkV7f4AHjxEdwOdOhKVKdFpqj_xZFZeI_dqiBcJ1ni-mJPUE8_AO3j5DspkMTjaGdbTF5jMXmc19NS5HbbvSUGpQCaBoBkB0dNEGZFIAeYropG0IuJJ4CiHBQ20gB2stCt2QtylEhCpbBkGXkVMhQGlY0eoAqvbY4QhkLMmhuMgjBxoIFMmMlrHPGRcRGHTnKCqk8j4LUfNGOfCOP1z9gpt3w8fe-Net_9whnZyiFiX5jhHlSxd2Qu0ZT6yyTK99P_8C8ChpHo
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%3Abook&rft.genre=proceeding&rft.title=Proceedings+International+Conference+on+Computer+Design+VLSI+in+Computers+and+Processors&rft.atitle=Parallel-array+implementations+of+a+non-restoring+square+root+algorithm&rft.au=Yamin+Li&rft.au=Wanming+Chu&rft.date=1997-01-01&rft.pub=IEEE&rft.isbn=9780818682063&rft.issn=1063-6404&rft.spage=690&rft.epage=695&rft_id=info:doi/10.1109%2FICCD.1997.628940&rft.externalDocID=628940
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6404&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6404&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6404&client=summon