| Study on High-Speed Magnitude Approximation for Complex Vectors |
| |
| 作者姓名： | 陈建春 杨万海 许少英 |
| |
| 作者单位： | Chen Jianchun，Yang Wanhai & Xu Shaoying School of Electronic Engineering，Xidian University，Xi'an 710071，P. R. China |
| |
| 基金项目： | This project was supported by the Natural Science Foundation of Shaanxi Province. |
| |
| 摘 要： | Abstract: High-speed magnitude approximation algorithms for complex vectors are discussed intensively. The perfor-mance and the convergence speed of these approximation algorithms are analyzed. For the polygon fitting algorithms, theapproximation formula under the least mean square error criterion is derived. For the iterative algorithms, a modifiedCORDIC (coordinate rotation digital computer) algorithm is developed. This modified CORDIC algorithm is proved to bewith a maximum relative error about one half that of the original CORDIC algorithm. Finally, the effects of the finiteregister length on these algorithms are also concerned, which shows that 9 to 12-bit coefficients are sufficient for practicalapplications.
|
Study on High-Speed Magnitude Approximation for Complex Vectors |
| |
| Chen Jianchun,Yang Wanhai & Xu Shaoying School of Electronic Engineering,Xidian University,Xi'an ,P. R. China.Study on High-Speed Magnitude Approximation for Complex Vectors[J].Journal of Systems Engineering and Electronics,2003,14(1). |
| |
| Authors: | Chen Jianchun Yang Wanhai & Xu Shaoying School of Electronic Engineering Xidian University Xi'an P R China |
| |
| Institution: | School of Electronic Engineering, Xidian University, Xi'an 710071, P. R. China |
| |
| Abstract: | High-speed magnitude approximation algorithms for complex vectors are discussed intensively. The performance and the convergence speed of these approximation algorithms are analyzed. For the polygon fitting algorithms, the approximation formula under the least mean square error criterion is derived. For the iterative algorithms, a modified CORDIC (coordinate rotation digital computer) algorithm is developed. This modified CORDIC algorithm is proved to be with a maximum relative error about one half that of the original CORDIC algorithm. Finally, the effects of the finite register length on these algorithms are also concerned, which shows that 9 to 12-bit coefficients are sufficient for practical applications. |
| |
| Keywords: | Modulus of complex number Linear approximation Least mean square error criterion CORDIC |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
