A design of complex square root for FPGA implementation

Dong Wang; Milos D. Ercegovac

doi:10.1117/12.831235

3 September 2009 A design of complex square root for FPGA implementation

Dong Wang, Milos D. Ercegovac

Proceedings Volume 7444, Mathematics for Signal and Information Processing; 74440L (2009) https://doi.org/10.1117/12.831235
Event: SPIE Optical Engineering + Applications, 2009, San Diego, California, United States

Abstract

We present a design for FPGA implementation of a complex square root algorithm for fixed-point operands in radix-4 representation. The design consists of (i) argument prescaling, (ii) residual recurrence, and (iii) result postscaling. These parts share logic resources and optimize the use of resources on FPGA devices used for implementation. Table building methods for prescaling and postscaling are analyzed and efficient designs approaches are discussed. The design is implemented in Altera Stratix-II FPGA for several argument precisions and compared in cost, latency and power with a design with an IP-based design. The results show advantages of the proposed design in cost, delay, and power.

Citation Download Citation

Dong Wang and Milos D. Ercegovac "A design of complex square root for FPGA implementation", Proc. SPIE 7444, Mathematics for Signal and Information Processing, 74440L (3 September 2009); https://doi.org/10.1117/12.831235

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available