Fixed-point square roots
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,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/84761 http://hdl.handle.net/10220/13408 |
| _version_ | 1826122541767327744 |
|---|---|
| author | Gan, Woon-Seng Seth, Abhishek. |
| author2 | School of Electrical and Electronic Engineering |
| author_facet | School of Electrical and Electronic Engineering Gan, Woon-Seng Seth, Abhishek. |
| author_sort | Gan, Woon-Seng |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T05:49:51Z |
| format | Conference Paper |
| id | ntu-10356/84761 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T05:49:51Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/847612020-03-07T13:24:45Z Fixed-point square roots Gan, Woon-Seng Seth, Abhishek. School of Electrical and Electronic Engineering IEEE International Conference on Acoustics, Speech and Signal Processing (2012 : Kyoto, Japan) DRNTU::Engineering::Electrical and electronic engineering 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. 2013-09-09T07:20:54Z 2019-12-06T15:50:52Z 2013-09-09T07:20:54Z 2019-12-06T15:50:52Z 2012 2012 Conference Paper Seth, A., & Gan, W. S. (2012). Fixed-point square roots . 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 1725-1728. https://hdl.handle.net/10356/84761 http://hdl.handle.net/10220/13408 10.1109/ICASSP.2012.6288231 en © 2012 IEEE. |
| spellingShingle | DRNTU::Engineering::Electrical and electronic engineering Gan, Woon-Seng Seth, Abhishek. Fixed-point square roots |
| title | Fixed-point square roots |
| title_full | Fixed-point square roots |
| title_fullStr | Fixed-point square roots |
| title_full_unstemmed | Fixed-point square roots |
| title_short | Fixed-point square roots |
| title_sort | fixed point square roots |
| topic | DRNTU::Engineering::Electrical and electronic engineering |
| url | https://hdl.handle.net/10356/84761 http://hdl.handle.net/10220/13408 |
| work_keys_str_mv | AT ganwoonseng fixedpointsquareroots AT sethabhishek fixedpointsquareroots |