An approach for the fast analysis of "irregular", i.e., of conformal, periodic or aperiodic, 2D arrays, based on the use of the p-series approach and Non-Uniform FFT (NUFFT) routines is proposed. The approach allows for modulating the computational burden depending on the array curvature and, thanks to the use of the NUFFT, the asymptotic growth of the computing time reduces to that of a few, standard FFTs. A sub-array partition strategy is also sketched and shown to further unburden the procedure and control the accuracy. The approach has been implemented in both sequential and parallel codes enabling its execution on CPUs and on cost-effective, massively parallel computing platforms like Graphic Processing Units (GPUs). Its performance in...
In this paper, a hexagonal DFT convenient for triangular grid phased array computations is described...
This paper presents new radix-2 and radix-22 constant geometry fast Fourier transform (FFT) algorith...
Abstract—We present novel algorithms for computing discrete Fourier transforms with high performance...
An approach for the fast analysis of "irregular", i.e., of conformal, periodic or aperiodic, 2D arra...
An approach for the fast analysis of “irregular”, i.e., of conformal, periodic or aperiodic, 2D arra...
We deal with the development of a computationally effective approach for the synthesis of equivalent...
We deal with one of the computationally most critical steps of the Phase-Only synthesis of aperiodic...
We discuss one of the computationally most critical steps of the Phase-Only synthesis of aperiodic r...
We present and discuss the parallel implementation on GPUs of three types of NUFFTs in CUDA language...
A phase-only power pattern synthesis technique for flat aperiodic arrays is presented. A convenient ...
Previous work has demonstrated that it is possible to generate eicient and highly parallel code for ...
A fast full-wave simulation technique is presented for the analysis of large irregular planar arrays...
A multistage synthesis approach for the design of aperiodic refiectarray, based on an effective and ...
In this paper, a hexagonal DFT convenient for triangular grid phased array computations is described...
This paper presents new radix-2 and radix-22 constant geometry fast Fourier transform (FFT) algorith...
Abstract—We present novel algorithms for computing discrete Fourier transforms with high performance...
An approach for the fast analysis of "irregular", i.e., of conformal, periodic or aperiodic, 2D arra...
An approach for the fast analysis of “irregular”, i.e., of conformal, periodic or aperiodic, 2D arra...
We deal with the development of a computationally effective approach for the synthesis of equivalent...
We deal with one of the computationally most critical steps of the Phase-Only synthesis of aperiodic...
We discuss one of the computationally most critical steps of the Phase-Only synthesis of aperiodic r...
We present and discuss the parallel implementation on GPUs of three types of NUFFTs in CUDA language...
A phase-only power pattern synthesis technique for flat aperiodic arrays is presented. A convenient ...
Previous work has demonstrated that it is possible to generate eicient and highly parallel code for ...
A fast full-wave simulation technique is presented for the analysis of large irregular planar arrays...
A multistage synthesis approach for the design of aperiodic refiectarray, based on an effective and ...
In this paper, a hexagonal DFT convenient for triangular grid phased array computations is described...
This paper presents new radix-2 and radix-22 constant geometry fast Fourier transform (FFT) algorith...
Abstract—We present novel algorithms for computing discrete Fourier transforms with high performance...