Failure correction of antenna arrays using convex optimization

Abstract

In this article, a convex optimization method for failure correction of impaired antenna arrays is proposed. The number of elements to be corrected is iteratively minimized through the reweighted L1‐norm algorithm while the corrected radiation pattern can be also ensured to be nearly consistent with the original one. Numerical results of a linear and a planar array correction demonstrate the better performance of the proposed method in terms of pattern consistency, number of corrected elements, and iteration speed compared with the state‐of‐the‐art techniques.

A compressed sensing‐based diagnosis method for impaired subarrayed antenna arrays

“…When certain elements in a subarray are failed, some algorithms can be used to simulate the error 7 and correct them. 8 In engineering applications, the original radiation characteristics can be maintained by directly replacing the impaired antenna elements or subarrays with new ones. To this end, we need to initially determine the locations of the failed or impaired elements (subarrays) and further estimate their actual excitations.…”

“…When certain elements in a subarray are failed, some algorithms can be used to simulate the error 7 and correct them 8 . In engineering applications, the original radiation characteristics can be maintained by directly replacing the impaired antenna elements or subarrays with new ones.…”