Abstract
Many fast signal processing algorithms are based on a geometric framework and efficient implementations of these algorithms often require the computation of elementary functions involving such operations as vector rotations and exponentials. The CORDIC (COordinate Rotation Digital Computer) algorithms are the natural candidates for these elementary operations and they lead to novel realizations in many promising algorithms such as the square-root normalized ladder algorithms. FFT and several well-known matrix algorithms for signal processing. The development of algorithms involving nonstationary processes and the limiting constraints of VLSI motivate the extension of the CORDIC concept in other directions. It can be applied not only to one-parameter groups but to other Lie groups as well, i.e., higher dimensional manifolds, leading to generalized CORDIC algorithms. The computation of special functions is some of the potential benefits. Several such generalizations will be discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
