A Consideration on High-Radix CORDIC Algorithms

8 References

Bibliographic Information

Other Title
  • 高基数CORDICアルゴリズムに関する検討

Search this article

Description

One of the problems of the CORDIC algorithm is that its convergence speed is proportional to the bit-length of the arithmetic unit. This paper proposes a new redundant CORDIC algorithm that employs a higher radix r(≤2) in microrotation. The use of higher radices makes possible the reduction of number of iterations. The major drawback of the high-radix CORDIC algorithms is the increased complexity in digit selection process for microrotatiorn. In this algorithm, by converting the representation of each angular remainder into partially non-redundant representation, the digit for microrotation can be obtained directly from the integer part of the angular remainder. Also, using the proposed algorithm, we can control the trade-off between processing latency and circuit complexity by changing radix value r(r≥2) and digit set D according to design specifications.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 52 1-8, 1996-07-24

    Information Processing Society of Japan (IPSJ)

References(8)*help

See more

Details 詳細情報について

  • CRID
    1572261552070406784
  • NII Article ID
    110002812236
  • NII Book ID
    AN1009593X
  • ISSN
    09196072
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top