Study on High—Speed Magnitude Approximation for Complex Vectors
摘要
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.
引用本文（GB/T 7714）
陈建春, 杨万海, 许少英. Study on High—Speed Magnitude Approximation for Complex Vectors[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2003.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。