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 条
  • [41] Complex lattice reduction algorithms for low-complexity MIMO detection
    Gan, YH
    Mow, WH
    GLOBECOM '05: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: DISCOVERY PAST AND FUTURE, 2005, : 2953 - 2957
  • [42] Low-complexity computation of plate eigenmodes with Vekua approximations and the method of particular solutions
    Chardon, Gilles
    Daudet, Laurent
    COMPUTATIONAL MECHANICS, 2013, 52 (05) : 983 - 992
  • [43] Low-Complexity Parallel Syndrome Computation for BCH Decoders Based on Cyclotomic FFT
    Qiao, Xinyuan
    Deng, Keyue
    Chen, Yuxing
    Song, Suwen
    Wang, Zhongfeng
    2022 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, APCCAS, 2022, : 350 - 354
  • [44] Low-complexity direct computation algorithm for cubic-spline interpolation scheme
    Hong, Shao-Hua
    Wang, Lin
    Trieu-Kien Truong
    JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2018, 50 : 159 - 166
  • [45] Low-complexity computation of plate eigenmodes with Vekua approximations and the method of particular solutions
    Gilles Chardon
    Laurent Daudet
    Computational Mechanics, 2013, 52 : 983 - 992
  • [46] On efficient computation of low-complexity controlled invariant sets for uncertain linear systems
    Blanco, Toni Barjas
    Cannon, Mark
    De Moor, Bart
    INTERNATIONAL JOURNAL OF CONTROL, 2010, 83 (07) : 1339 - 1346
  • [47] A Deterministic Low-Complexity Approximate (Multiplier-Less) Technique for DCT Computation
    Huang, Junqi
    Kumar, T. Nandha
    Almurib, Haider A. F.
    Lombardi, Fabrizio
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2019, 66 (08) : 3001 - 3014
  • [48] On the computation of the coherent point-spread function using a low-complexity representation
    Bagheri, Saeed
    de Farias, Daniela Pucci
    Barbastathis, George
    Neifeld, Mark A.
    OPTICAL INFORMATION SYSTEMS IV, 2006, 6311
  • [49] Low-Complexity Statistically Robust Precoder/Detector Computation for Massive MIMO Systems
    Boroujerdi, Mahdi Nouri
    Haghighatshoar, Saeid
    Caire, Giuseppe
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (10) : 6516 - 6530
  • [50] Low-complexity EDAS and low-complexity detection scheme for MPSK spatial modulation
    Balmahoon, Tarika
    Xu, Hongjun
    IET COMMUNICATIONS, 2016, 10 (14) : 1752 - 1757