Related Experiment Video
Updated: Jun 28, 2026

15:06
Measurement of Scattering Nonlinearities from a Single Plasmonic Nanoparticle
Published on: January 3, 2016
Extending the S-FFT direct-methods algorithm to density functions with positive and negative peaks. XIV.
1Institut de Ciència de Materials de Barcelona (CSIC), Campus de la UAB, 08193-Bellaterra, Catalunya, Spain. jordi.rius@icmab.es
Acta Crystallographica. Section A, Foundations of Crystallography
|October 22, 2008
Summary
A new S2-FFT algorithm efficiently solves crystal structures using Fourier transforms. This method enhances direct-methods phase determination for X-ray and neutron diffraction data, even with negative scatterers.
Area of Science:
- Crystallography
- Materials Science
- Computational Chemistry
Background:
- Direct methods in crystallography traditionally use phase relationships.
- Previous modulus sum function (S) adaptations handled positive/negative density peaks but were slow for large datasets.
- Generalizing to larger problems was limited by time-consuming quartet term manipulation.
Purpose of the Study:
- To present a modified S-FFT algorithm, termed S2-FFT.
- To overcome the computational limitations of previous direct-methods approaches.
- To enable efficient structure solution for larger and more complex crystal structures.
Main Methods:
- Modification of the S-FFT algorithm, which maximizes the modulus sum function (S) using only Fourier transforms.
- Application of the S2-FFT algorithm to intensity data from various diffraction techniques.
- Testing on conventional single-crystal X-ray diffraction, neutron diffraction data, and superstructure reflection intensities.
Main Results:
- The S2-FFT algorithm demonstrates high effectiveness for crystal structures with at least one moderate scatterer.
- Successful structure solution was achieved for diverse datasets, including those with negative scatterers.
- The method efficiently solves difference structures and is applicable to various diffraction data types.
Conclusions:
- The S2-FFT algorithm provides a computationally efficient advancement for direct-methods crystallography.
- This method overcomes previous limitations in handling large datasets and complex structures.
- S2-FFT is a valuable tool for solving crystal structures across different diffraction experiments.
Related Concept Videos
Basic signals of Fourier Transform
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
Discrete Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Fast Fourier Transform
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Properties of DTFT II
In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
Discrete-time Fourier transform
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
Properties of Fourier series II
Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...
A function f(t) is...

