Abstract
This study presented an algorithm for fast hardware execution of complex cube root. In this algorithm, which is based on the Laurent series of ∛z function, first, the z-plane's numbers are mapped by using a rapid scaling and rotation operation to a pre-specified limited region, and then the sequences of the series are computed. The parameters of the algorithm are thoroughly analyzed and selected to achieve high precision. The algorithm has been implemented on a field programmable gate array-based platform using the Simulink HDL Coder tool and Xilinx ISE 14.7. In addition, the resource usage and speed parameters are carefully examined for the implementation of each step of the algorithm. Hardware was implemented in two 56-bit and 32-bit versions (for comparison). The 32-bit version occupies 140 slice Regs, 421 slice LUTs, and 5 DSP48s. The hardware with the capability of computing complex cube roots has appropriate specifications comparable with those of previous implementations of real cube root calculation on FPGA.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
