Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Multi-beam RF aperture using multiplierless FFT approximation

Multiple independent radio-frequency (RF) beams find applications in communications, radio astronomy, radar and microwave imaging. An N-point fast Fourier transform (FFT) applied spatially across an array of receiver antennas provides N-independent RF beams at N/2 log2 N multiplier complexity. Here, a low-complexity multiplierless approximation for the 8-point FFT is presented for RF beamforming, using only 26 additions. The algorithm provides eight beams that closely resemble the antenna array patterns of the traditional FFT-based beamformer albeit without using multipliers. The proposed FFT-like algorithm was verified on-chip using a Xilinx Virtex-6 Lx240T field programmable gate array (FPGA) device. The FPGA implementation indicated bandwidth of 369 MHz for each of the independent receive-mode RF beams.

References

    1. 1)
      • 4. Blahut, R.E.: ‘Fast algorithms for digital signal processing’ (Cambridge University Press, 2010).
    2. 2)
    3. 3)
    4. 4)
      • 3. Oppenheim, A.V., Schafer, R.W.: ‘Discrete-time signal processing’ (Prentice-Hall, 2009, 3rd edn.).
    5. 5)
    6. 6)
    7. 7)
    8. 8)
      • 2. Coleman, J.O.: ‘A generalized FFT for many simultaneous receive beams’, Naval Res. Lab., 2007, NRL/MR/532007-9029.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2014.3561
Loading

Related content

content/journals/10.1049/el.2014.3561
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address