dc.contributor.author |
Kulasekera, S |
|
dc.contributor.author |
Madanayake, A |
|
dc.contributor.author |
Wijenayake, C |
|
dc.contributor.author |
Bayer, FM |
|
dc.contributor.author |
Suarez, D |
|
dc.contributor.author |
Cintra, RJ |
|
dc.date.accessioned |
2018-09-19T19:43:42Z |
|
dc.date.available |
2018-09-19T19:43:42Z |
|
dc.identifier.uri |
http://dl.lib.mrt.ac.lk/handle/123/13571 |
|
dc.description.abstract |
The two-dimensional (2-D) discrete Fourier transform (DFT) is widely used in digital signal processing (DSP) and computing applications. Fast Fourier transforms (FFTs) are
widely used as low-complexity algorithms for the computation of the DFT as it reduces the required computation operations from O(N2) to O(N log2 N). The multiplicative complexity is used as a benchmark in comparing different algorithms as it affects the circuit complexity, chip area and power. This paper introduces a new class of multiplierless hardware algorithm consisting only of arithmetic adder circuits that closely approximates the 2-D version of the 8-point DFT. The paper discusses the theory behind the proposed new algorithm, with the DFT presented in the form of an 8 × 8 matrix. Furthermore it provide a multi-beam RF aperture application example where the 2-D DFT approximation
has been used to closely obtain the antenna array patterns. |
en_US |
dc.language.iso |
en |
en_US |
dc.subject |
DSP, FFT, arrays, beamforming, aperture, multibeam. |
en_US |
dc.title |
Multi-beam 8 × 8 RF aperture digital beamformers using mMultiplierless 2-D FFT appro ximations |
en_US |
dc.type |
Conference-Abstract |
en_US |
dc.identifier.year |
2015 |
en_US |
dc.identifier.conference |
Moratuwa Engineering Research Conference - MERCon 2015 |
en_US |
dc.identifier.place |
Moratuwa, Sri Lanka |
en_US |
dc.identifier.email |
arjuna@uakron.edu |
en_US |
dc.identifier.email |
c.wijenayake@unsw.edu.au |
en_US |
dc.identifier.email |
fabiobayer@gmail.com |
en_US |
dc.identifier.email |
dmsuarezv@unal.edu.co |
en_US |
dc.identifier.email |
rjdsc@stat.ufpe.org |
en_US |