Jove
Visualize
Contact Us

Related Concept Videos

Fast Fourier Transform01:10

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)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
Discrete Fourier Transform01:15

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...
Discrete-time Fourier transform01:26

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...
Basic signals of Fourier Transform01:07

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...
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The general equation of δ direct methods and the novel SMAR algorithm residuals using the absolute value of ρ and the zero conversion of negative ripples.

Acta crystallographica. Section A, Foundations and advances·2024
Same author

Extending the novel |ρ|-based phasing algorithm to the solution of anomalous scattering substructures from SAD data of protein crystals.

Acta crystallographica. Section A, Foundations and advances·2022
Same author

A new density-modification procedure extending the application of the recent |ρ|-based phasing algorithm to larger crystal structures.

Acta crystallographica. Section A, Foundations and advances·2021
Same author

Novel phasing method using the origin-free modulus sum function expressed in terms of the absolute electron density.

Acta crystallographica. Section A, Foundations and advances·2020
Same author

Pure Polymorph C of Zeolite Beta Synthesized by Using Framework Isomorphous Substitution as a Structure-Directing Mechanism.

Angewandte Chemie (International ed. in English)·2018
Same author

Ag<sub>2</sub>Cu<sub>3</sub>Cr<sub>2</sub>O<sub>8</sub>(OH)<sub>4</sub>: a new bidimensional silver-copper mixed-oxyhydroxide with in-plane ferromagnetic coupling.

Dalton transactions (Cambridge, England : 2003)·2017
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Video

Updated: Jun 19, 2026

Analysis of SEC-SAXS data via EFA deconvolution and Scatter
10:59

Analysis of SEC-SAXS data via EFA deconvolution and Scatter

Published on: January 28, 2021

Improving the direct-methods sign-unconstrained S-FFT algorithm. XV.

Jordi Rius1, Carles Frontera

  • 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, 2009
PubMed
Summary
This summary is machine-generated.

The S(2)-FFT algorithm enhances direct-methods phase refinement for crystal structures by removing constraints. A new S(m) function further improves performance, especially for structures with light scatterers.

More Related Videos

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:48

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

Related Experiment Videos

Last Updated: Jun 19, 2026

Analysis of SEC-SAXS data via EFA deconvolution and Scatter
10:59

Analysis of SEC-SAXS data via EFA deconvolution and Scatter

Published on: January 28, 2021

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:48

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

Area of Science:

  • Crystallography
  • Materials Science
  • Computational Chemistry

Background:

  • Direct-methods algorithms are crucial for crystal structure determination.
  • The S-FFT algorithm, a direct-methods approach, faces limitations with density functions containing positive and negative peaks.
  • Existing methods often require an equal-sign constraint, limiting their applicability.

Purpose of the Study:

  • To generalize the S-FFT algorithm for broader application to diverse crystal structures.
  • To improve the success rate of phase refinement for structures containing only light scatterers.
  • To introduce a simpler, related algorithm for enhanced phase refinement.

Main Methods:

  • Modification of the S-FFT algorithm by removing the equal-sign constraint, creating the S(2)-FFT algorithm.
  • Combination of the electron density function rho(2) with a density function mask.
  • Improvement of the density function mask and investigation of the S(2)-FFT convergence rate.
  • Introduction of the S(m) phase-refinement function using rho and a novel mask.

Main Results:

  • The generalized S(2)-FFT algorithm effectively refines phases for crystal structures with at least one moderate scatterer.
  • The algorithm showed reduced effectiveness for structures solely composed of light scatterers.
  • Improvements to the mask and convergence analysis of S(2)-FFT were conducted.
  • The S(m) function demonstrated capability in handling density peaks without the equal-sign constraint in simple cases.

Conclusions:

  • The developed S(2)-FFT algorithm expands the applicability of direct-methods phase refinement.
  • Further mask optimization and investigation are needed to enhance performance for light-atom structures.
  • The S(m) function offers a simpler alternative for phase refinement, particularly in specific scenarios.