Low-Power FPGA-Implementation of atan(Y/X) Using Look-Up Table Methods for Communication Applications

This paper presents an architecture for the computation of the atan(Y/X) operation suitable for broadband communication applications where a throughput of 20 MHz is required. The architecture takes advantage of embedded hard-cores of the FPGA device to achieve lower power consumption with respect to an atan(Y/X) operator based on CORDIC algorithm or conventional LUT-based methods. The proposed architecture can compute the atan(Y/X) with a latency of two clock cycles and its power consumption is 49% lower than a CORDIC or 46% lower than multipartite approach.

[1]  Earl E. Swartzlander,et al.  Computer Arithmetic , 1980 .

[2]  M.J. Canet,et al.  FPGA implementation of an IF transceiver for OFDM-based WLAN , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

[3]  Warren E. Ferguson.  Exact computation of a sum or difference with applications to argument reduction , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[4]  Michael J. Schulte,et al.  Symmetric bipartite tables for accurate function approximation , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[5]  Wayne Luk,et al.  Hierarchical segmentation schemes for function evaluation , 2003, Proceedings. 2003 IEEE International Conference on Field-Programmable Technology (FPT) (IEEE Cat. No.03EX798).

[6]  Debjit Das Sarma,et al.  Faithful bipartite ROM reciprocal tables , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[7]  John Terry,et al.  OFDM Wireless LANs: A Theoretical and Practical Guide , 2001 .

[8]  Debjit Das Sarma,et al.  Faithful interpolation in reciprocal tables , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[9]  Michael J. Schulte,et al.  Accurate function approximations by symmetric table lookup and addition , 1997, Proceedings IEEE International Conference on Application-Specific Systems, Architectures and Processors.

[10]  M. Combet,et al.  Computation of the Base Two Logarithm of Binary Numbers , 1965, IEEE Trans. Electron. Comput..

[11]  Shane Story,et al.  New algorithms for improved transcendental functions on IA-64 , 1999, Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336).

[12]  T. Sansaloni,et al.  Efficient Mapping of CORDIC Algorithm for OFDM-Based WLAN , 2008, J. Signal Process. Syst..

[13]  Jie Cheng,et al.  High-performance architectures for elementary function generation , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[14]  I. S. Gradshteyn,et al.  1 – ELEMENTARY FUNCTIONS , 1980 .

[15]  Earl E. Swartzlander,et al.  Hardware Designs for Exactly Rounded Elemantary Functions , 1994, IEEE Trans. Computers.

[16]  Vojin G. Oklobdzija,et al.  An algorithmic and novel design of a leading zero detector circuit: comparison with logic synthesis , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[17]  Umberto Mengali,et al.  Synchronization Techniques for Digital Receivers , 1997, Applications of Communications Theory.

[18]  Arnaud Tisserand,et al.  Some improvements on multipartite table methods , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[19]  Jean-Michel Muller,et al.  Elementary Functions: Algorithms and Implementation , 1997 .

[20]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .