1993
DOI: 10.1016/0030-4018(93)90495-q
|View full text |Cite
|
Sign up to set email alerts
|

An efficient interpolation algorithm for Fourier and diffractive optics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

1996
1996
2019
2019

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 3 publications
0
8
0
Order By: Relevance
“…Due to the usual extreme ratio of the two different scales, approaches such as zero padding can cause difficult memory issues and prevent the calculation of the investigated field components. To prevent this problem, chirp z-transformations can be used to unify the grids without causing memory problems [41,[46][47][48].…”
Section: Full Vectorial Field Reconstructionmentioning
confidence: 99%
“…Due to the usual extreme ratio of the two different scales, approaches such as zero padding can cause difficult memory issues and prevent the calculation of the investigated field components. To prevent this problem, chirp z-transformations can be used to unify the grids without causing memory problems [41,[46][47][48].…”
Section: Full Vectorial Field Reconstructionmentioning
confidence: 99%
“…A method derived from the Chirp-Z transform was adapted to perform the required 2D complex interpolation. The key of the method is to express the affine transform as a convolution [2] [3].…”
Section: A Complex Interpolationmentioning
confidence: 99%
“…The techniques used in the chirp-z transform 39,40 are also useful for efficient calculation of the ChT of a given function f(x). Substituting the following expression into Eq.…”
Section: B Fast Numerical Algorithm For the Chirp Transformmentioning
confidence: 99%
“…By using this algorithm, one can freely set the sampling steps in both x and u space, which is very useful under some circumstances such as examining near-field diffraction patterns and interpolation of sparse data in u space. 15,39 One can also choose different numbers of samples in x and u space by means of the implementation techniques in Subsection 3.C.…”
Section: B Fast Numerical Algorithm For the Chirp Transformmentioning
confidence: 99%
See 1 more Smart Citation