Phase extension in crystallography using the iterative Fienup-Gerchberg-Saxton algorithm and Hilbert transforms

J. S. Wu*, J. C H Spence

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

A procedure for phase extension in electron crystallography is proposed based on the iterative Fienup-Gerchberg-Saxton algorithm in combination with the use of discrete Hilbert transforms. This transform is used to provide oversampling in reciprocal space, thus satisfying the Shannon sampling requirement and introducing reflections with fractional indices. When the procedure is combined with the knowledge of a small set of strong phased Bragg reflections from electron-microscope images (or direct methods), the magnitudes of many non-Bragg reflections can be calculated with useful accuracy, thus enhancing the performance of the iterative algorithm for phase extension. The effects of various constraints used in the iterative algorithm are discussed. In this way, it is shown that the iterative algorithm conventionally used for phasing diffuse scattering from non-periodic objects can also be applied to problems in conventional crystallography to find the phases of high-order (resolution) beams from a known set of low-order (resolution) phases.

Original languageEnglish (US)
Pages (from-to)577-583
Number of pages7
JournalActa Crystallographica Section A: Foundations of Crystallography
Volume59
Issue number6
DOIs
StatePublished - Nov 1 2003

ASJC Scopus subject areas

  • Structural Biology

Fingerprint

Dive into the research topics of 'Phase extension in crystallography using the iterative Fienup-Gerchberg-Saxton algorithm and Hilbert transforms'. Together they form a unique fingerprint.

Cite this