DocumentCode
1846525
Title
Efficient FPGA implementation of complex multipliers using the logarithmic number system
Author
Man Yan Kong ; Langlois, J.M.P. ; Al-Khalili, D.
Author_Institution
Intel Corp., Hillsboro, OR
fYear
2008
fDate
18-21 May 2008
Firstpage
3154
Lastpage
3157
Abstract
In many real-time DSP applications, high performance is a prime target. However, achieving this may be done at the expense of area, power dissipation and accuracy. Attempts have been made to use alternative number systems to optimize the realization of arithmetic blocks, maintaining high performance without incurring prohibitive area and power increases. This paper presents the FPGA implementation of complex multipliers based on the logarithmic number system. Synthesis results show that a design with a 10-stage pipeline can achieve a maximum clock rate of 224 MHz and 140 MHz for 16-bit and 32-bit designs, respectively. Both designs use the lowest amount of hardware in terms of gate equivalents as compared to a complex multiplier built with regular FPGA features. In particular, the proposed architecture uses 67% and 35% fewer gates to implement a 32-bit and 16-bit complex multiplier, respectively, when compared to a design realized with embedded multipliers. Simulation results based on selected test vectors show that the greatest relative error of the logarithmic-based 16-bit complex multiplier is 2.14%.
Keywords
field programmable gate arrays; signal processing; DSP applications; FPGA; complex multipliers; logarithmic number system; Baseband; Computer architecture; Costs; Digital signal processing; Educational institutions; Field programmable gate arrays; Frequency; Hardware; Mixers; Power dissipation;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2008. ISCAS 2008. IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
978-1-4244-1683-7
Type
conf
DOI
10.1109/ISCAS.2008.4542127
Filename
4542127
Link To Document