A Fast and Low-Complexity Operator for the Computation of the Arctangent of a Complex Number

被引:12
|
作者
Torres, Vicente [1 ]
Valls, Javier [1 ]
机构
[1] Univ Politecn Valencia, Dept Ingn Elect, E-46022 Valencia, Spain
关键词
Approximation; atan2; FPGA; SYMMETRIC BIPARTITE TABLES; FPGA-IMPLEMENTATION; APPROXIMATIONS;
D O I
10.1109/TVLSI.2017.2700519
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The computation of the arctangent of a complex number, i.e., the atan2 function, is frequently needed in hardware systems that could profit from an optimized operator. In this brief, we present a novel method to compute the atan2 function and a hardware architecture for its implementation. The method is based on a first stage that performs a coarse approximation of the atan2 function and a second stage that improves the output accuracy by means of a lookup table. We present results for fixed-point implementations in a field-programmable gate array device, all of them guaranteeing last-bit accuracy, which provide an advantage in latency, speed, and use of resources, when compared with well-established fixed-point options.
引用
收藏
页码:2663 / 2667
页数:5
相关论文
共 50 条
  • [1] A Universal Methodology of Complex Number Computation for Low-Complexity and High-Speed Implementation
    Wang, Yu
    Zhang, Jin
    Wu, Youlong
    Lyu, Fei
    Luo, Yuanyong
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2024,
  • [2] Low-Complexity Methodology for Complex Square-Root Computation
    Mopuri, Suresh
    Acharyya, Amit
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2017, 25 (11) : 3255 - 3259
  • [3] Fast computation of residual complexity image similarity metric using low-complexity transforms
    Pauchard, Yves
    Cintra, Renato J.
    Madanayake, Arjuna
    Bayer, Fabio M.
    IET IMAGE PROCESSING, 2015, 9 (08) : 699 - 708
  • [4] Fast and low-complexity Audio watermarking
    Fallahpour, Mehdi
    Megias, David
    2014 10TH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS (MSN), 2014, : 329 - 335
  • [5] Fast and low-complexity method for exact computation of 3D Legendre moments
    Hosny, Khalid M.
    PATTERN RECOGNITION LETTERS, 2011, 32 (09) : 1305 - 1314
  • [6] Unconditionally Secure Computation Against Low-Complexity Leakage
    Bogdanov, Andrej
    Ishai, Yuval
    Srinivasan, Akshayaram
    ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT II, 2019, 11693 : 387 - 416
  • [7] Universal Computation with Low-Complexity Wireless Relay Networks
    Slottke, Eric
    Rolny, Raphael
    Wittneben, Armin
    2012 CONFERENCE RECORD OF THE FORTY SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2012, : 1770 - 1774
  • [8] Unconditionally Secure Computation Against Low-Complexity Leakage
    Bogdanov, Andrej
    Ishai, Yuval
    Srinivasan, Akshayaram
    JOURNAL OF CRYPTOLOGY, 2021, 34 (04)
  • [9] Unconditionally Secure Computation Against Low-Complexity Leakage
    Andrej Bogdanov
    Yuval Ishai
    Akshayaram Srinivasan
    Journal of Cryptology, 2021, 34
  • [10] Low-Complexity Welch Power Spectral Density Computation
    Parhi, Keshab K.
    Ayinala, Manohar
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2014, 61 (01) : 172 - 182