Results 251 to 260 of about 340,305 (333)
Butler-Matrix Beamspace Front-Ends for Massive MIMO: Architecture, Loss Budget, and Capacity Impact. [PDF]
Sensors (Basel)Vico F, Monserrat JF, Ge Y.
europepmc +1 more source
Synthesis of PtCu/C Nanostructured Electrocatalysts for the Oxygen Reduction Reaction via One-Step Electrochemical Erosion. [PDF]
ACS Appl Mater InterfacesSchneider PM +11 more
europepmc +1 more source
Pre-trained multi-scale RWKV-GCN for multivariate time series forecasting. [PDF]
Sci RepHao J, Liu F, Zhang W.
europepmc +1 more source
FPGA Implementation of an Efficient FFT Processor for FMCW Radar Signal Processing
Sensors, 2021 This paper presents the design and implementation results of an efficient fast Fourier transform (FFT) processor for frequency-modulated continuous wave (FMCW) radar signal processing.
Jinmoo Heo, Yongchul Jung, Seongjoo Lee
exaly +2 more sources
A FFT solver for variational phase-field modeling of brittle fracture
Computer Methods in Applied Mechanics and Engineering, 2019 The variational phase-field method is an attractive non-local approach of modeling fracture in heterogeneous materials. However, these materials usually require a fine mesh to resolve the fracture process zone.
Yang Chen +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021
The fast Fourier Transform (FFT), a reduced-complexity formulation of the Discrete Fourier Transform (DFT), is an important tool in many areas of science and engineering. FFTW is a well-known package that follows this approach and is currently one of the fastest available implementations of the FFT.
Sultan Durrani +4 more
openaire +1 more source
The fast Fourier Transform (FFT), a reduced-complexity formulation of the Discrete Fourier Transform (DFT), is an important tool in many areas of science and engineering. FFTW is a well-known package that follows this approach and is currently one of the fastest available implementations of the FFT.
Sultan Durrani +4 more
openaire +1 more source