SearcharxivSearch

arXiv subjects

Ashish Patwari

Publications and source records attributed to Ashish Patwari.

5 recordsLinked to original sources

An Interactive Graphical Tool to Check the Coarray Continuity of Two-Fold Redundant Sparse Arrays (TFRSAs) Under Single Sensor Failures

Two-fold redundant sparse arrays possess inbuilt redundancy to tackle single-element failures. This property enables them to perform accurate direction of arrival (DOA) estimation even during single sensor faults. However, recent literature suggests that some TFRSAs suffer from hidden dependencies whereby a single sensor fault at peculiar positions within the array cause discontinuities (holes) in the difference coarray (DCA). This violates the very idea of providing two-fold redundancy. Such hidden dependencies could prove catastrophic in many critical applications such as defense, autonomous driving, and biomedical imaging. Despite this issue, no formal tools or techniques exist to ascertain whether a given array configuration is truly twofold redundant or not. To address this gap, we provide a comprehensive framework and a first-ever graphical user interface (GUI). The GUI has been built using the features in MATLAB app designer and tested with known examples available in sparse array literature. Several numerical examples have been discussed to check the tool's response in each scenario. We conclude that the GUI is functionally accurate and can be an indispensable tool for sparse array designers in making informed choices about array configurations prior to real deployment.

eess.SP

Discovering Optimal Robust Minimum Redundancy Arrays (RMRAs) through Exhaustive Search and Algebraic Formulation of a New Sub-Optimal RMRA

Modern sparse arrays are maximally economic in that they retain just as many sensors required to provide a specific aperture while maintaining a hole-free difference coarray. As a result, these are susceptible to the failure of even a single sensor. Contrarily, two-fold redundant sparse arrays (TFRSAs) and robust minimum redundancy arrays (RMRAs) ensure robustness against single-sensor failures due to their inherent redundancy in their coarrays. At present, optimal RMRA configurations are known only for arrays with sensor counts N=6 to N=10. To this end, this paper proposes two objectives: (i) developing a systematic algorithm to discover optimal RMRAs for N>10, and (ii) obtaining a new family of near-/sub-optimal RMRA that can be completely specified using closed-form expressions (CFEs). We solve the combinatorial optimization problem of finding RMRAs using an exhaustive search technique implemented in MATLAB. Optimal RMRAs for N = 11 to 14 were successfully found and near/sub-optimal arrays for N = 15 to 20 were determined using the proposed technique. As a byproduct of the exhaustive search, a large catalogue of valid near- and sub-optimal RMRAs was also obtained. In the second stage, CFEs for a new TFRSA were obtained by applying pattern mining and algebraic generalizations to the arrays obtained through exhaustive search. The proposed family enjoys CFEs for sensor positions, available aperture, and achievable degrees of freedom (DOFs). The CFEs have been thoroughly validated using MATLAB and are found to be valid for $N\geq8$. Hence, it can be concluded that the novelty of this work is two-fold: extending the catalogue of known optimal RMRAs and formulating a sub-optimal RMRA that abides by CFEs.

eess.SP

Design and Validation of a MATLAB-based GUI for Coarray Domain Analysis of Sparse Linear Arrays

This work presents a first-of-its-kind graphical user interface (GUI)-based simulator developed using MATLAB App designer for the comprehensive analysis of sparse linear arrays (SLAs) in the difference coarray (DCA) domain. Sparse sensor arrays have emerged as a critical solution in enhancing signal detection, direction of arrival (DOA) estimation, and beamforming in fields such as wireless communication, radar, sonar, and integrated sensing systems. They offer several advantages over traditional uniform arrays, including reduced system complexity, lower deployment costs, and improved mitigation of mutual coupling effects. The tool enables users to input array configurations, compute DCAs, visualize weight function graphs, and assess the hole-free status of arrays, as applicable for coarray processing. Unlike conventional simulators that focus on radiation pattern visualization (array pattern, main lobe and sidelobe characteristics, azimuth cut, rectangular view, polar view etc.), this tool addresses the behavior of SLAs from a coarray domain perspective. Numerical validations demonstrate the tool's correctness, effectiveness, and its potential to foster further research in sparse arrays. This simulator could also be used as a teaching aid to drive home complicated topics and attract young minds towards the fascinating field of sparse array design.

eess.SP

A Systematic Framework to Test the Resilience of Three-Fold Redundant Sparse Arrays Against Two Sensor Failures and Some Never-Before Findings

As the field of sparse arrays progressed, numerous array designs have been introduced with a focus on larger apertures and higher degrees of freedom (DOFs), resulting in maximally economic sparse arrays (MESAs) that operate with the least number of sensors required to provide a given aperture while ensuring a hole-free difference coarray (DCA). Consequently, MESAs are least robust to sensor failures and cannot afford the failure of even a single sensor. Multifold redundant sparse arrays (MFRSAs) provide a practical solution to the problem of sensor failures in sparse arrays by making sure that the array contains enough sensor pairs necessary to produce each spatial lag multiple times. Owing to this property, a \b{eta}-fold redundant array can withstand simultaneous failure of at least \b{eta}-1 sensors without losing the hole-free DCA property. Nevertheless, MFRSAs are also prone to hidden dependencies that prevent them from being fully robust. In this work, we present a systematic framework to evaluate the robustness of triple redundant sparse linear arrays (TRSLAs) against all possible two-sensor failures. After detailing the proposed approach, we present the failure analysis of representative TRSLAs available in existing literature. It is found that existing TRSLAs have some hidden vulnerabilities against the failure of some peculiar sensor pairs. Corresponding MATLAB programs and numerical simulations are provided for evaluation and use by the array processing community. The proposed approach has a great archival value as it can evaluate the robustness of any present or future TRSLAs through objective means.

eess.SP

A Leap-on-Success Exhaustive Search Method to Find Optimal Robust Minimum Redundancy Arrays (RMRAs): New Array Configurations for Sensor Counts 11 to 20

Two-fold redundant sparse arrays (TFRAs) are designed to maintain accurate direction estimation even in the event of a single sensor failure, leveraging the deliberate coarray redundancy infused into their design. Robust Minimum Redundancy Arrays (RMRAs), a specialized class of TFRAs, optimize this redundancy to achieve the maximum possible aperture for a given number of sensors. However, finding optimal RMRA configurations is an NP-hard problem, with prior research reporting optimal solutions only for arrays of up to ten sensors. This paper presents newly discovered optimal RMRA configurations for array sizes 11 to 15, identified using a novel Leap-on-Success exhaustive search algorithm that efficiently reduces computational effort by terminating the search upon locating optimal solutions. The robustness of these arrays was validated under all single-element failure scenarios using MATLAB simulations, confirming their superior resilience compared to some existing TFRAs vulnerable to failures at specific sensor positions. Furthermore, near-optimal configurations for array sizes 16 to 20 are also reported, highlighting the potential applicability of the proposed method for larger array designs given sufficient computational resources. This work not only advances the state-of-the-art in RMRA design but also introduces an effective search methodology that can be leveraged for future explorations in array configuration optimization.

eess.SP