Method to Determine the Far-Field Beam Pattern of A Long Array From Subarray Beam Pattern Measurements

Beam pattern measurement is essential to verifying the performance of an array sonar. However, common problems in beam pattern measurement of arrays include constraints on achieving the far-field condition and reaching plane waves mainly due to limited measurement space as in acoustic water tank. For this purpose, the conventional method of measuring beam patterns in limited spaces, which transform near-field measurement data into far-field results, is used. However, the conventional method is time-consuming because of the dense spatial sampling. Hence, we devised a method to measure the beam pattern of a discrete line array in limited space based on the subarray method. In this method, a discrete line array with a measurement space that does not satisfy the far-field condition is divided into several subarrays, and the beam pattern of the line array can then be determined from the subarray measurements by the spatial convolution that is equivalent to the multiplication of beam pattern. The proposed method was verified through simulation and experimental measurement on a line array with 256 elements of 16 subarrays.

Duality and Dimensionality Reduction Discrete Line Generation Algorithm for a Triangular Grid

Vectors are a key type of geospatial data, and their discretization, which involves solving the problem of generating a discrete line, is particularly important. In this study, we propose a method for constructing a discrete line mathematical model for a triangular grid based on a “weak duality” hexagonal grid, to overcome the drawbacks of existing discrete line generation algorithms for a triangular grid. First, a weak duality relationship between triangular and hexagonal grids is explored. Second, an equivalent triangular grid model is established based on the hexagonal grid, using this weak duality relationship. Third, the two-dimensional discrete line model is solved by transforming it into a one-dimensional optimal wandering path model. Finally, we design and implement the dimensionality reduction generation algorithm for a discrete line in a triangular grid. The results of our comparative experiment indicate that the proposed algorithm has a computation speed that is approximately 10 times that of similar existing algorithms; in addition, it has better fitting effectiveness. Our proposed algorithm has broad applications, and it can be used for real-time grid transformation of vector data, discrete global grid system (DGGS), and other similar applications.