3 September 2009 A design of complex square root for FPGA implementation
Author Affiliations +
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.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Dong Wang, Dong Wang, Milos D. Ercegovac, 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); doi: 10.1117/12.831235; https://doi.org/10.1117/12.831235
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT


Back to Top