Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Fast Fourier Transform

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-time Fourier transform

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

Discrete Fourier Transform

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

Basic signals of Fourier Transform

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

Properties of DTFT II

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

Properties of Fourier Transform I

Properties of Fourier Transform I

The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...

You might also read

Related Articles

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

Sort by

Same author

Beyond healing: rethinking traditional lateral internal sphincterotomy in the long term.

Techniques in coloproctology·2026

Same author

From prediction to clinical action in colorectal surgery: rethinking DLNN use for postoperative risk.

Techniques in coloproctology·2025

Same author

Surgical Management of Chronic Subdural Hematoma: A Single Center Experience.

Nigerian journal of clinical practice·2025

Same author

Correction to: Does onlay mesh placement in emergency laparotomy prevent incisional hernia? A prospective randomized double‑blind study.

Hernia : the journal of hernias and abdominal wall surgery·2025

Same author

Morphometric Analysis of the Tibial Tunnel after Primary and Revision Anterior Cruciate Ligament Reconstruction.

Malaysian orthopaedic journal·2025

Same author

Prevalence of rectus diastasis is higher in patients with inguinal hernia.

Hernia : the journal of hernias and abdominal wall surgery·2023

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Nonseparable two-dimensional fractional fourier transform.

A Sahin, M A Kutay, H M Ozaktas

|February 21, 2008

Summary

A new nonseparable definition for the 2D fractional Fourier transform is introduced, generalizing previous separable versions. This advanced transform offers improved capabilities, demonstrated through image restoration applications.

Area of Science:

Signal Processing
Image Analysis
Mathematical Physics

Background:

Fractional Fourier transform (FRFT) is a generalization of the Fourier transform with applications in signal processing and optics.
Existing 2D FRFT definitions primarily rely on separable kernels, limiting their scope.
The need for more versatile FRFT definitions is evident in complex image processing tasks.

Purpose of the Study:

To introduce a novel, nonseparable definition for the two-dimensional fractional Fourier transform (2D FRFT).
To demonstrate that the proposed nonseparable 2D FRFT encompasses existing separable definitions as a special case.
To present digital and optical implementation strategies for the new transform and validate its utility.

Main Methods:

Development of a generalized mathematical framework for the nonseparable 2D FRFT.

More Related Videos

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

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

Published on: August 30, 2013

Related Experiment Videos

Last Updated: Jul 7, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

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

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

Published on: August 30, 2013

Design and simulation of digital algorithms for computing the nonseparable 2D FRFT.

Conceptualization and analysis of optical setups for implementing the nonseparable 2D FRFT.

Application of the nonseparable 2D FRFT to an image restoration problem.

Main Results:

A new nonseparable definition for the 2D FRFT has been successfully formulated.
The proposed definition is shown to be a generalization, including separable kernels as a specific instance.
Feasible digital and optical implementation methods for the nonseparable 2D FRFT were outlined.
The nonseparable 2D FRFT demonstrated effectiveness in a practical image-restoration scenario.

Conclusions:

The nonseparable 2D FRFT provides a more comprehensive and flexible tool for signal and image processing.
The presented implementation methods pave the way for practical applications of the nonseparable 2D FRFT.
The nonseparable 2D FRFT offers advantages over separable versions, particularly in complex image restoration tasks.