An efficient construction strategy for minimum redundancy linear arrays based on linear array formulations

The acquisition of large‑element minimum redundancy linear arrays (MRLAs) remains a challenging problem in radar, microwave radiometer, and wireless communication systems. Existing computational approaches often require prohibitively long runtimes, yields only limited number of solutions and may fail to identify application-specific optimal array configurations. To address this issue, this study analyzes the defining conditions of four mathematical constructs: (i) restricted difference bases with the minimum number of elements for a given baseline length L; (ii) MRLAs with maximum contiguous baseline length L; (iii) scale values of perfect sparse rulers of length L, and (iv) vertex labelings of minimal graceful graphs with L edges. Through cyclic reasoning, their mathematical equivalence among these four formulations is rigorously established. Several theoretical properties are further derived. First, linear arrays exist in symmetric pairs. Second, the redundancy R of a linear array satisfies R ≥ 1, with R>1 when the number of elements exceeds four. Third, if an MRLA with maximum contiguous baseline length L contains n elements, an MRLA with maximum baseline length L + 1 contains no more than n + 1 elements. Based on large‑scale MRLA data analysis, a practical hypothesis is proposed: linear arrays with redundancy R ≤ 1.5 may be regarded as effectively minimum‑redundancy linear arrays. In addition, two novel types of analytical formulas for linear arrays are introduced, enabling efficient screening of infinitely MRLA configuration patterns—each corresponding to scale values of perfect sparse rulers—and allowing flexible adjustment of redundancy thresholds according to application requirements. These results provide theoretical support for both the practical deployment of MRLAs and the systematic design of perfect sparse rulers.