Research Article Open Access

Braun's Multipliers: Spartan-3AN based Design and Implementation

Muhammad H. Rais and Mohammed H. Al Mijalli

Abstract

Problem statement: Multiplication is an essential airthematic operation for common Digital Signal Processing (DSP) applications, such as filtering and Fast Fourier Transform (FFT). To achieve high execution speed, parallel array multipliers are widely used. Approach: The field Programmable Gate Arrays (FPGAs) is currently the dominant and viable technology that could be implemented and reconfigured at the same time. Results: The Sparatn-3An FPGA resources utilization for 4×4, 6×6, 8×8 and 12×12 bit Braun’s multipliers are obtained and Analysis Of Variance (ANOVA) presents that the 12×12 multiplier has significant difference than other three multipliers. The mean delay time for four multipliers shows that as the size of multiplier increases the mean delay time also increases. Conclusion: In essence, parallel multipliers based on the FPGA technology can provide better solution for DSP processor, medical imaging and multimedia.

Journal of Computer Science
Volume 7 No. 11, 2011, 1629-1632

DOI: https://doi.org/10.3844/jcssp.2011.1629.1632

Submitted On: 10 August 2011 Published On: 18 August 2011

How to Cite: Rais, M. H. & Al Mijalli, M. H. (2011). Braun's Multipliers: Spartan-3AN based Design and Implementation. Journal of Computer Science, 7(11), 1629-1632. https://doi.org/10.3844/jcssp.2011.1629.1632

  • 1,923 Views
  • 3,394 Downloads
  • 0 Citations

Download

Keywords

  • Application Specific Integrated Circuits (ASICs)
  • braun’s multipliers
  • Field Programmable Gate Array (FPGA)
  • spartan-3AN
  • Fast Fourier Transform (FFT)
  • Digital Signal Processing (DSP)
  • General Purpose Signal Processing (GPSP)