Jove
Visualize
Contact Us
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 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...
Inverse z-Transform by Partial Fraction Expansion01:20

Inverse z-Transform by Partial Fraction Expansion

The inverse z-transform is a crucial technique for converting a function from its z-domain representation back to the time domain. One effective method for finding the inverse z-transform is the Partial Fraction Method, which involves decomposing a function into simpler fractions with distinct coefficients. These fractions correspond to known z-transform pairs, facilitating the inverse transformation process.
To begin the process, the poles of the function are identified and the function is...
Partial Fractions01:28

Partial Fractions

A partial fraction is a component of a rational expression represented as the sum of simpler fractions. When a rational function is expressed as a ratio of two polynomials, it can often be decomposed into a sum of fractions whose denominators are simpler polynomials, typically linear or irreducible quadratic factors. This process is called partial fraction decomposition, and it is used to simplify complex expressions for integration, solving equations, or analysis.Partial fraction decomposition...
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 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...

You might also read

Related Articles

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

Sort by
Same author

High-efficiency arbitrary array generator.

Applied optics·2010
Same author

Multichannel single-output color pattern recognition by use of a joint-transform correlator.

Applied optics·2010
Same author

Two-dimensional wavelet transform by wavelength multiplexing.

Applied optics·2010
Same author

Two-dimensional wavelet processor.

Applied optics·2010
Same author

Single-channel polychromatic pattern recognition by the use of a joint-transform correlator.

Applied optics·2010
Same author

Wavelet-transform-based composite filters for invariant pattern recognition.

Applied optics·2010
Same journal

Gaussian-modulated continuous-variable quantum key distribution over 60 km fiber using an integrated silicon photonic receiver.

Optics letters·2026
Same journal

E2E-OCT: end-to-end joint learning model using optical coherence tomography images for vocal cord leukoplakia diagnosis.

Optics letters·2026
Same journal

Holographic generation of panoramic 3D scenes by concave ellipsoidal mirror reflection.

Optics letters·2026
Same journal

Dual-pilot phase recovery with pair-wise maximum-ratio combining for coherent PONs.

Optics letters·2026
Same journal

Mapping the whispering gallery modes of a CaF<sub>2</sub> disk resonator with half-tapered fibers to estimate the fundamental mode volume.

Optics letters·2026
Same journal

Quantitative estimation of deep-subwavelength scale via dark-field scattering axial energy concentration decay profiles.

Optics letters·2026
See all related articles

Related Experiment Video

Updated: Jun 19, 2026

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Fractional Hilbert transform.

A W Lohmann, D Mendlovic, Z Zalevsky

    Optics Letters
    |October 30, 2009
    PubMed
    Summary
    This summary is machine-generated.

    Researchers generalized the Hilbert transform by introducing the fractional Hilbert transform (FHT). Two novel approaches were developed and combined, offering a two-parameter characterization of the FHT, validated through simulations.

    Related Experiment Videos

    Last Updated: Jun 19, 2026

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
    13:44

    Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

    Published on: August 30, 2013

    Area of Science:

    • Signal Processing
    • Mathematical Physics
    • Harmonic Analysis

    Background:

    • The Hilbert transform is a fundamental tool in signal processing and analysis.
    • Generalizations of integral transforms are crucial for expanding their applicability.
    • Existing transforms may not capture all desired spectral properties.

    Purpose of the Study:

    • To introduce and define a generalized Hilbert transform operation.
    • To explore novel methods for constructing this fractional Hilbert transform.
    • To characterize the generalized transform and validate its properties.

    Main Methods:

    • Defining the fractional Hilbert transform (FHT) through two distinct approaches.
    • Approach 1: Modifying the spatial filter.
    • Approach 2: Utilizing the fractional Fourier plane for filtering.
    • Combining the two definitions into a unified, two-parameter FHT.

    Main Results:

    • Successful generalization of the Hilbert transform.
    • Development of two novel, complementary methods for FHT definition.
    • A combined FHT characterized by two independent parameters was established.
    • Computer simulations demonstrated the validity of the proposed methods.

    Conclusions:

    • The fractional Hilbert transform offers a powerful generalization of the classical Hilbert transform.
    • The proposed two-parameter FHT provides enhanced flexibility for signal analysis.
    • The presented methods and simulations confirm the theoretical framework.