Abstract

In this article, we investigate a novel iterative antenna array synthesis method. The method is based on the iterative addition of antenna array elements. After defining the synthesis algorithm, we prove that the discrepancy between the goal and the synthesized pattern converges to the theoretical lower bound in the sense of a certain norm. The algorithm is also extended to iteratively replace already placed elements and for the synthesis of multiple goal patterns with the same array geometry but with different excitations. Some numerical examples are shown to illustrate the convergence properties of the proposed method. Possible applications include circularly polarized patterns, since the algorithm can handle the rotation as well as translation of the antenna elements.

Highlights

  • A MONG others, wireless communications, battery-free sensors, and passive RF identification are systems and concepts that benefit from the use of wireless power transmission (WPT) and energy-harvesting solutions to remotely power up wireless devices [1], [2]

  • Basic Algorithm We describe the basic algorithm for the synthesis of a goal radiation pattern fA

  • We prove that the synthesized radiation pattern is convergent to the best approximation of the goal pattern in the sense of the norm defined on a Hilbert space

Read more

Summary

INTRODUCTION

A MONG others, wireless communications, battery-free sensors, and passive RF identification are systems and concepts that benefit from the use of wireless power transmission (WPT) and energy-harvesting solutions to remotely power up wireless devices [1], [2]. E.g., radio-frequency identification (RFID) sensing or energy harvesting, usually involve antenna arrays. An interesting topic of research is related to millimeter-wave rectennas, which includes on-board energy harvesting in satellites [3], where, e.g., an optimal radiation/receiving pattern is essential. This topic leads to a more general problem of optimization/synthesis of radiation patterns [4]. Several methods exist for pattern synthesis: these include methods using orthogonal [5] and Inagaki modes [6], and methods employing iterative operations on array elements [7]. The algorithm involves iterative placement and replacement of the antenna array elements for the purpose of synthesizing its radiation patterns. We examine the convergence properties of the algorithm and provide numerical examples of its application

BASIC DEFINITIONS
RADIATION PATTERN SYNTHESIS ALGORITHM
Convergence Properties
Extension for Element Repositioning
Extension for Multiple Goal Patterns
Transformation of the Inner Product
Implementing the Maximization
Example
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call