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

J. S. Wu, John Spence

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 2003

Fingerprint

Crystallography
crystallography
Electrons
Electron microscopes
electron microscopes
sampling
Scattering
Sampling
requirements
scattering
electrons

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Structural Biology

Cite this

@article{a4d341710cd248e29429028bbb135344,
title = "Phase extension in crystallography using the iterative Fienup-Gerchberg-Saxton algorithm and Hilbert transforms",
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.",
author = "Wu, {J. S.} and John Spence",
year = "2003",
month = "11",
doi = "10.1107/S0108767303021123",
language = "English (US)",
volume = "59",
pages = "577--583",
journal = "Acta Crystallographica Section A: Foundations and Advances",
issn = "0108-7673",
publisher = "John Wiley and Sons Inc.",
number = "6",

}

TY - JOUR

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

AU - Wu, J. S.

AU - Spence, John

PY - 2003/11

Y1 - 2003/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0344445522&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0344445522&partnerID=8YFLogxK

U2 - 10.1107/S0108767303021123

DO - 10.1107/S0108767303021123

M3 - Article

C2 - 14581757

AN - SCOPUS:0344445522

VL - 59

SP - 577

EP - 583

JO - Acta Crystallographica Section A: Foundations and Advances

JF - Acta Crystallographica Section A: Foundations and Advances

SN - 0108-7673

IS - 6

ER -