A Low-SWaP 16-Beam 2.4 GHz Digital Phased Array Receiver Using DFT Approximation

A low-complexity approximation for the 16-point DFT and its respective multiplierless fast algorithm is proposed. A receive mode multibeam phased-array experiment was realized at 2.4 GHz employing a 16-element IQ receiver array that uses the proposed approximate spatial DFT in real-time in order to achieve multibeam digital beamforming. The 16-beam digital receiver experiment uses a ROACH-2 based Xilinx Virtex-6 FPGA platform for both digital beam computation as well as to perform the multireceiver analog-to-digital conversion. Receive mode RF beams were measured and compared to the exact DFT (realized with fixed-point multipliers with 8-bit twiddle factors). The measured approximate DFT closely followed the measured beams resulting from the fixed-point conventional DFT implementation. The approximate DFT achieves RF beam performance (mainlobe gain, sidelobes) similar to the DFT at the cost of a small error which would be tolerable for the majority of multibeam phased-array receivers. The 16-point approximate DFT provides a hardware reduction of $\sim$70% with respect to FFTs, setting up a low size, weight and power (SWaP) system.The maximum magnitude error of the filter bank response is 0.106 ($\approx -20$ dB).

[1]  R. Weiner Lecture Notes in Economics and Mathematical Systems , 1985 .

[2]  Sheng-Fuh Chang,et al.  A 24-GHz CMOS Butler Matrix MMIC for multi-beam smart antenna systems , 2008, 2008 IEEE Radio Frequency Integrated Circuits Symposium.

[3]  Karl F. Warnick,et al.  Low-Noise Amplifier Design Considerations For Use in Antenna Arrays , 2015, IEEE Transactions on Antennas and Propagation.

[4]  A. Madanayake,et al.  An 8-Beam 2.4 GHz Digital Array Receiver Based on a Fast Multiplierless Spatial DFT Approximation , 2018, 2018 IEEE/MTT-S International Microwave Symposium - IMS.

[5]  Ali Gharsallah,et al.  Design of a 4×4 butler matrix for beamforming antenna applications , 2014, Proceedings of 2014 Mediterranean Microwave Symposium (MMS2014).

[6]  Chang Liu,et al.  A face image recognition algorithm based on DFT encryption domain , 2017, 2017 First International Conference on Electronics Instrumentation & Information Systems (EIIS).

[7]  Arjuna Madanayake,et al.  Multi-Beam RF Aperture Using Multiplierless FFT Approximation , 2015, ArXiv.

[8]  M. Omair Ahmad,et al.  Binary Discrete Cosine and Hartley Transforms , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[9]  Shuangfeng Han,et al.  Large-scale antenna systems with hybrid analog and digital beamforming for millimeter wave 5G , 2015, IEEE Communications Magazine.

[10]  L Belostotski,et al.  On the Number of Noise Parameters for Analyses of Circuits With MOSFETs , 2011, IEEE Transactions on Microwave Theory and Techniques.

[11]  A NikaraJari,et al.  Discrete cosine and sine transforms , 2006 .

[12]  Hanho Lee,et al.  A high-speed four-parallel radix-24 FFT/IFFT processor for UWB applications , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[13]  Steven W. Ellingson,et al.  Efficient multibeam synthesis with interference nulling for large arrays , 2003 .

[14]  Arjuna Madanayake,et al.  Low-Power VLSI Architectures for DCT\/DWT: Precision vs Approximation for HD Video, Biomedical, and Smart Antenna Applications , 2015, IEEE Circuits and Systems Magazine.

[15]  Jianhao Hu,et al.  Hardware Efficient Mixed Radix-25/16/9 FFT for LTE Systems , 2015, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[16]  Chun-Lung Hsu,et al.  Adaptive De-noising Filter Algorithm for CMOS Image Sensor Testing Applications , 2010, 2010 IEEE 25th International Symposium on Defect and Fault Tolerance in VLSI Systems.

[17]  Fábio M. Bayer,et al.  A class of DCT approximations based on the Feig-Winograd algorithm , 2015, Signal Process..

[18]  Arjuna Madanayake,et al.  Fast computation of residual complexity image similarity metric using low-complexity transforms , 2015, IET Image Process..

[19]  M.N.S. Swamy,et al.  Low-complexity 8×8 transform for image compression , 2008 .

[20]  C. Loan Computational Frameworks for the Fast Fourier Transform , 1992 .

[21]  Michael T. Heideman Multiplicative complexity, convolution, and the DFT , 1988 .

[22]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[23]  Franklin T. Luk,et al.  Fast Algorithms for Signal Processing , 1990 .

[24]  G. Krieger,et al.  Digital beamforming and MIMO SAR: Review and new concepts , 2012 .

[25]  Fábio M. Bayer,et al.  A DCT Approximation for Image Compression , 2011, IEEE Signal Processing Letters.

[26]  Arjuna Madanayake,et al.  Multibeam Digital Array Receiver Using a 16-Point Multiplierless DFT Approximation , 2019, IEEE Transactions on Antennas and Propagation.

[27]  Arjuna Madanayake,et al.  Multiplier-free DCT approximations for RF multi-beam digital aperture-array space imaging and directional sensing , 2012 .

[28]  Arjuna Madanayake,et al.  A Speed-Optimized Systolic Array Processor Architecture for Spatio-Temporal 2-D IIR Broadband Beam Filters , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[29]  P. Russer,et al.  Minimizing the Noise Penalty Due to Mutual Coupling for a Receiving Array , 2009, IEEE Transactions on Antennas and Propagation.

[30]  H. Moody The systematic design of the Butler matrix , 1964 .

[31]  A. Dempster,et al.  Constant integer multiplication using minimum adders , 1994 .