New Frontiers in Stellar Interferometry 2004
DOI: 10.1117/12.551625
|View full text |Cite
|
Sign up to set email alerts
|

Fringe tracking at the IOTA interferometer

Abstract: We describe the fringe-packet tracking software installed at the infrared optical telescope array (IOTA). Three independently developed fringe-packet tracking algorithms can be used to equalise the optical path lengths at the interferometer. We compare the performance of these three algorithms and show results obtained tracking fringes for three independent baselines on the sky.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2004
2004
2024
2024

Publication Types

Select...
4
3

Relationship

3
4

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 30 publications
0
11
0
Order By: Relevance
“…It was then tested briefly in an online implementation, producing good stable fringe tracking. Ettore Pedretti, in an attempt to quantitatively evaluate the online performance of this and two other algorithms [2,23], developed an experimental procedure to do so, as described in [22]. The basic result was that this adaptive DFTbased algorithm and one developed by Pedretti both were found to perform well on both moderate and low photon flux targets, as measured by the closure-phase error.…”
Section: Performancementioning
confidence: 96%
See 2 more Smart Citations
“…It was then tested briefly in an online implementation, producing good stable fringe tracking. Ettore Pedretti, in an attempt to quantitatively evaluate the online performance of this and two other algorithms [2,23], developed an experimental procedure to do so, as described in [22]. The basic result was that this adaptive DFTbased algorithm and one developed by Pedretti both were found to perform well on both moderate and low photon flux targets, as measured by the closure-phase error.…”
Section: Performancementioning
confidence: 96%
“…As noted previously, there are aspects of the algorithm that could have been further optimized (e.g., pre-calculation of the sinusoidal vectors) if this compute time had been excessive. As implemented, the speed of the algorithm was sufficiently fast that compute time was negligible as compared to the scanning period [22].…”
Section: Speedmentioning
confidence: 99%
See 1 more Smart Citation
“…17 This algorithm is sensitive to step size errors, as they change the location of the signal peak in Fourier space. Hence, the interferogram peak location is extracted by averaging the phases in the FFT over a broad range of bins.…”
Section: Opd Measuring Algorithmsmentioning
confidence: 99%
“…There are obviously many other ways to estimate x GD from a set of data, but we assume that this is a second order problem. Indeed, Pedretti et al (2004) compared three different algorithms to estimate the group delay with a temporal method and noted only little differences in the performance, even with an algorithm as sophisticated as the one proposed by Wilson et al (2004).…”
Section: Description Of the Simulationsmentioning
confidence: 99%