Engineering Papers⌕ Search

Engineering topics

Kotas, Charlotte W

Publications and source records attributed to Kotas, Charlotte W.

Acoustically Induced Streaming Flows near a Model Cod Otolith and their Potential Implications for Fish Hearing

The ears of fishes are remarkable sensors for the small acoustic disturbances associated with underwater sound. For example, each ear of the Atlantic cod (Gadus morhua) has three dense bony bodies (otoliths) surrounded by fluid and tissue, and detects sounds at frequencies from 30 to 500 Hz. Atlantic cod have also been shown to localize sounds. However, how their ears perform these functions is not fully understood. Steady streaming, or time-independent, flows near a 350% scale model Atlantic cod otolith immersed in a viscous fluid were studied to determine if these fluid flows contain acoustically relevant information that could be detected by the ear s sensory hair cells. The otolith was oscillated sinusoidally at various orientations at frequencies of 8 24 Hz, corresponding to an actual frequency range of 280 830 Hz. Phaselocked particle pathline visualizations of the resulting flows give velocity, vorticity, and rate of strain fields over a single plane of this mainly two-dimensional flow. Although the streaming flows contain acoustically relevant information, the displacements due to these flows are likely too small to explain Atlantic cod hearing abilities near threshold. The results, however, may suggest a possible mechanism for detection of ultrasound in some fish species.

54 ENVIRONMENTAL SCIENCES↗

Singular value decomposition utilizing parallel algorithms on graphical processors

One of the current challenges in underwater acoustic array signal processing is the detection of quiet targets in the presence of noise. In order to enable robust detection, one of the key processing steps requires data and replica whitening. This, in turn, involves the eigen-decomposition of the sample spectral matrix, Cx = 1/K xKX(k)XH(k) where X(k) denotes a single frequency snapshot with an element for each element of the array. By employing the singular value decomposition (SVD) method, the eigenvectors and eigenvalues can be determined directly from the data without computing the sample covariance matrix, reducing the computational requirements for a given level of accuracy (van Trees, Optimum Array Processing). (Recall that the SVD of a complex matrix A involves determining V, , and U such that A = U VH where U and V are orthonormal and is a positive, real, diagonal matrix containing the singular values of A. U and V are the eigenvectors of AAH and AHA, respectively, while the singular values are the square roots of the eigenvalues of AAH.) Because it is desirable to be able to compute these quantities in real time, an efficient technique for computing the SVD is vital. In addition, emerging multicore processors like graphical processing units (GPUs) are bringing parallel processing capabilities to an ever increasing number of users. Since the computational tasks involved in array signal processing are well suited for parallelization, it is expected that these computations will be implemented using GPUs as soon as users have the necessary computational tools available to them. Thus, it is important to have an SVD algorithm that is suitable for these processors. This work explores the effectiveness of two different parallel SVD implementations on an NVIDIA Tesla C2050 GPU (14 multiprocessors, 32 cores per multiprocessor, 1.15 GHz clock - peed). The first algorithm is based on a two-step algorithm which bidiagonalizes the matrix using Householder transformations, and then diagonalizes the intermediate bidiagonal matrix through implicit QR shifts. This is similar to that implemented for real matrices by Lahabar and Narayanan ("Singular Value Decomposition on GPU using CUDA", IEEE International Parallel Distributed Processing Symposium 2009). The implementation is done in a hybrid manner, with the bidiagonalization stage done using the GPU while the diagonalization stage is done using the CPU, with the GPU used to update the U and V matrices. The second algorithm is based on a one-sided Jacobi scheme utilizing a sequence of pair-wise column orthogonalizations such that A is replaced by AV until the resulting matrix is sufficiently orthogonal (that is, equal to U ). V is obtained from the sequence of orthogonalizations, while can be found from the square root of the diagonal elements of AH A and, once is known, U can be found from column scaling the resulting matrix. These implementations utilize CUDA Fortran and NVIDIA's CUB LAS library. The primary goal of this study is to quantify the comparative performance of these two techniques against themselves and other standard implementations (for example, MATLAB). Considering that there is significant overhead associated with transferring data to the GPU and with synchronization between the GPU and the host CPU, it is also important to understand when it is worthwhile to use the GPU in terms of the matrix size and number of concurrent SVDs to be calculated.

99 GENERAL AND MISCELLANEOUS↗