Abstract: In this paper, a novel subarray-level adaptive beamforming algorithm is proposed to address performance degradation under low snapshot conditions and strong noise environments. The method ...

This PR adds an implementation of Kadane's Algorithm, an efficient dynamic programming approach to solve the Maximum Subarray Sum problem in O(n) time. Initializes current and global maximum values.

Bug: A naive solution may try all subarrays using nested loops (O(n²) or worse), which is too slow for large inputs. Expected: Use Kadane’s Algorithm (O(n)), which efficiently updates the running sum ...

Abstract: We develop and then demonstrate a modified planar subarray processing algorithm based on the inverse scaled Fourier transform applied to very high frequency ice-sounding data that produces ...

\[ \gdef\bias{\mathrm{bias}} \gdef\deg{\mathrm{deg}} \gdef\indeg{\mathrm{indeg}} \gdef\outdeg{\mathrm{outdeg}} \gdef\Snap{\mathrm{Snap}} \gdef\RSnap{\mathrm{RefSnap ...

We propose a refined iterative likelihood-maximization algorithm for reconstructing a quantum state from a set of tomographic measurements. The algorithm is characterized by a very high convergence ...