.png){kind=icon}
.png){kind=icon}
Return
Optimization of Clutter Simulation Based on GPU
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2972941.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Weibull clutter is used as an example in this paper. Based on the serial parallel analysis of Zero-memory non-linear transformation;s Weibull distributed clutter algorithm, fine-grained optimization is performed. The fine-grained part uses the cuBLAS library to optimize the performance of convolution calculations. Compared with CUDA shared memory convolution method and GPU parallel matrix multiplication convolution method, its computational performance can be significantly improved under a large amount of data. Simulation results show that the Zero-memory non-linear transformation;s Weibull distributed clutter simulation method is optimized and accelerated. The real-time performance of clutter data is significantly improved and its acceleration effect will be better as the amount of clutter data increases. It turns out that through fine-grained optimization, the performance of convolution calculations with large amounts of data is improved.
Keywords:
GPU parallel operation
clutter model
fine-grained optimization
convolution calculation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.