Sparse-array phasing algorithm based on recursive estimation of fringe contrast

Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

This paper describes a novel real-time algorithm for optically phasing sub-apertures of a sparse-array telescope system based on recursive estimation of the sub-aperture placement that maximizes a fringe-contrast metric. The sub-apertures are phased in pairs using broad spectral band flood-illumination of the sparse-array, while blocking reflections from all but two sub-apertures. The resulting Young"s geometry at the pupil produces an interference pattern that is characterized to determine spatial-frequency filters that are utilized to generate a contrast metric from the fringe patterns. This contrast metric is shown to generate a near-Gaussian variation as a function of optical path-length difference (OPD), with the maximum contrast occurring at zero OPD. The functional relationship between fringe contrast and sub-aperture position based on a common-path, laser-based relative-piston measurement system is developed into an estimator for maximization of fringe contrast (and therefore phasing of sub-apertures). The recursive algorithm produces real-time estimates of the zero OPD value of the relative position that improves as additional data is acquired.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Sparse-array phasing algorithm based on recursive estimation of fringe contrast does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sparse-array phasing algorithm based on recursive estimation of fringe contrast, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse-array phasing algorithm based on recursive estimation of fringe contrast will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-1311131

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.