Name
Abstract | ||
|---|---|---|
This paper deals with fast calculation of cross-ambiguity functions. The approach that we develop is based on Gauss- Legendre quadrature associated with Fermat Number Trans- form. For fixed number of quadrature nodes, these nodes are approximated by their closest neighbors on a regular sam- pling grid. This enables Gauss quadrature good approxima- tion while preserving the convolution structure of the grid quantized quadrature. The interest of preserving the convo- lution structure of the cross ambiguity terms in the corre- sponding discretized problem lies in the possibility of using fast transform Fourier-like algorithms. In a digital processing context, Number Theoretic Transforms (NTT) in finite fields of order a Fermat number are known to be particularly well suited to achieve convolution at very low computational cost. The contribution of this paper lies in the association of both powerful concepts of Gauss quadrature and NTT to realize fast convolution, and in particular fast cross-ambiguity cal- culation. Simulations are carried out to illustrate calculation of a few standard radar waveforms ambiguity functions. |
Year | Venue | Keywords |
|---|---|---|
2008 | Lausanne | ambiguity function,finite field |
Field | DocType | ISSN |
Gauss–Kronrod quadrature formula,Convolution,Mathematical analysis,Tanh-sinh quadrature,Clenshaw–Curtis quadrature,Algorithm,Circular convolution,Gauss–Jacobi quadrature,Overlap–add method,Mathematics,Pseudo-spectral method | Conference | 2219-5491 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Khalid Minaoui | 1 | 7 | 7.42 |
| Thierry Chonavel | 2 | 248 | 33.28 |
| Benayad Nsiri | 3 | 8 | 4.65 |
| D. Aboutajdine | 4 | 93 | 12.21 |