Diminishing Returns With Increasing Complexity in Reconfigurable Aperture Antennas

作者：Mehmood Rashid^*; Wallace Jon W

来源：IEEE Antennas and Wireless Propagation Letters, 2010, 9: 299-302.

DOI：10.1109/LAWP.2010.2047090

• Antenna arrays
• beam steering
• complexity theory
• genetic algorithms
• reconfigurable antennas

Reconfigurable aperture (RECAP) antennas hold the promise of allowing nearly arbitrary antennas to be synthesized dynamically. An important outstanding question regards the level of RECAP complexity required to capture most of the performance gains in terms of the number of reconfigurable elements (REs) per wavelength and the number of reconfiguration bits (RBs) per reconfigurable element. Diminishing improvement of beamforming performance with increasing RECAP complexity is investigated by considering a square parasitic dipole array with 9 9 elements with dimensions 1 lambda x 1 lambda x 0.5 lambda. For a fixed RECAP complexity of N(RE)N(RB), it is observed that having higher N(RE) is more beneficial than high N(RB) for dynamic beam steering, and that approximately eight REs per wavelength are required to reach diminishing performance returns.

• 出版日期2010