Figure 3 shows the schematic diagram of the forward and backward spatial smoothing (FBSS) algorithm. The principle of the forward smoothing algorithm is as follows. Divide the \(N\) uniform linear arrays into the \(P\) subarrays, where the adjacent subarrays are misaligned by one element. If the number of the elements of each subarray is \(M\), then the number of the subarrays is \(P = N – M + 1\), and the number of the elements of the subarray is \(M = N – P + 1\).
The output vector of each subarray can be expressed as follows.
Continue Reading
News Source: www.nature.com