Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/84761
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gan, Woon-Seng | en |
dc.contributor.author | Seth, Abhishek. | en |
dc.date.accessioned | 2013-09-09T07:20:54Z | en |
dc.date.accessioned | 2019-12-06T15:50:52Z | - |
dc.date.available | 2013-09-09T07:20:54Z | en |
dc.date.available | 2019-12-06T15:50:52Z | - |
dc.date.copyright | 2012 | en |
dc.date.issued | 2012 | en |
dc.identifier.citation | Seth, A., & Gan, W. S. (2012). Fixed-point square roots . 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 1725-1728. | en |
dc.identifier.uri | https://hdl.handle.net/10356/84761 | - |
dc.description.abstract | Square root (SQRT) is a common arithmetic operation used in many DSP algorithms. In this paper, we evaluate square rooting methods suitable for implementation on fixed-point (FxP) DSP processors with a fast multiplying unit. The finite wordlength effect on the square rooting methods is highlighted, and it is shown that the theoretically derived convergence rate for the Newton-Raphson (NR) based square rooting methods are not suitable for FxP processor. Also, the most efficient methods for 8-bit and 16-bit FxP processors are identified. | en |
dc.language.iso | en | en |
dc.rights | © 2012 IEEE. | en |
dc.subject | DRNTU::Engineering::Electrical and electronic engineering | en |
dc.title | Fixed-point square roots | en |
dc.type | Conference Paper | en |
dc.contributor.school | School of Electrical and Electronic Engineering | en |
dc.contributor.conference | IEEE International Conference on Acoustics, Speech and Signal Processing (2012 : Kyoto, Japan) | en |
dc.identifier.doi | 10.1109/ICASSP.2012.6288231 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | EEE Conference Papers |
SCOPUSTM
Citations
50
4
Updated on Mar 14, 2024
Page view(s) 20
701
Updated on Mar 27, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.