Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Comparison of Radix-2 Square Root Algorithms Using Digit Recurrence
Linköpings universitet, Institutionen för systemteknik, Elektroniska Kretsar och System.
2015 (engelsk)Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
Abstract [en]

When designing an electronic system, it might be desirable to implement a custom square root calculator unit to ensure quick calculations. The different questions when it comes to square root units are many. What algorithms are there? How are these algorithms implemented? What are the benefits and disadvantages of the different implementations? The goal of this thesis work is to try to answer these questions. In this paper, several different methods of calculating the radix-2 square root by digit recurrence are studied, designed and compared. The three main algorithms that are studied are the restoring square root algorithm, the non-restoring square root algorithm and the SRT (Sweeney, Robertson, Tocher) square root algorithm. They are all designed using the same technology and identical components where applicable. This is done in order to ensure that the comparisons give a fair assessment of the viability of the different algorithms. It is shown that the restoring and non-restoring square root algorithms perform similarly when using 65 nm technology, a 16 bit input, full data rate and 1.2 V power supply. The restoring square root algorithm have a slight edge when the systems are not pipelined, while the non-restoring algorithm performs slightly better when the systems are fully pipelined. The SRT square root algorithm perform worse than the other two in all cases.

sted, utgiver, år, opplag, sider
2015. , s. 50
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-122023ISRN: LiTH-ISY-EX--15/4896--SEOAI: oai:DiVA.org:liu-122023DiVA, id: diva2:861297
Fag / kurs
Integrated Circuits and Systems
Presentation
2015-10-13, Filtret, 09:57 (engelsk)
Veileder
Examiner
Tilgjengelig fra: 2015-10-20 Laget: 2015-10-16 Sist oppdatert: 2015-10-20bibliografisk kontrollert

Open Access i DiVA

fulltext(14059 kB)482 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 14059 kBChecksum SHA-512
ff8559295ae527702d83ea98c00796eac5c64748a8947ac1e76d43ff40c02fc6686d87f61dcfe2f8ac792dee32670f3d523be3022ada0306b0ecb8c71c7f0052
Type fulltextMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
Ledin, Staffan
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 482 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 581 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf