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

Properties of DTFT I

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...

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

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

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

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 Series

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

You might also read

Related Articles

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

Sort by

Same author

Gamma Ray Bursts in Active Galactic Nucleia.

Annals of the New York Academy of Sciences·2015

Same author

New family of binary arrays for coded aperture imaging.

Applied optics·2010

Same author

Time-resolved and energy-resolved coded aperture images with URA tagging.

Applied optics·2010

Same author

Uniformly redundant arrays: digital reconstruction methods.

Applied optics·2010

Same author

Coded aperture imaging: the modulation transfer function for uniformly redundant arrays.

Applied optics·2010

Same author

Uniformly redundant array imaging of laser driven compressions: preliminary results.

Applied optics·2010

Same journal

Multifunctional reconfigurable terahertz metasurface based on vanadium dioxide phase transition: achieving broadband absorption and efficient polarization conversion.

Applied optics·2026

Same journal

High-Q-factor electromagnetically induced transparency utilizing quasi-bound states in the continuum in an all-dielectric terahertz metasurface.

Applied optics·2026

Same journal

Automated stitching interferometry for high-precision metrology of X-ray mirrors.

Applied optics·2026

Same journal

Experimental demonstration of an approach to designing a metal-dielectric DBR resonant cavity structure.

Applied optics·2026

Same journal

High-precision wavefront reconstruction from a single-shot interferogram using a physics-driven hybrid feature calibration network.

Applied optics·2026

Same journal

Ultra-high-Q Fano resonance based on coupled topological corner states in Kagome photonic crystals.

Applied optics·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 14, 2026

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Published on: July 28, 2013

Fast delta Hadamard transform.

E E Fenimore, G S Weston

|March 25, 2010

Summary

This summary is machine-generated.

New fast delta Hadamard transforms (FDHT) improve measurement decoding for applications like spectroscopy and imaging. These methods overcome resolution limitations and phasing errors associated with the traditional fast Hadamard transform (FHT).

More Related Videos

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Published on: June 15, 2022

Related Experiment Videos

Last Updated: Jun 14, 2026

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Diffusion Tensor Magnetic Resonance Imaging in the Analysis of Neurodegenerative Diseases

Published on: July 28, 2013

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Quantifying Cytoskeleton Dynamics Using Differential Dynamic Microscopy

Published on: June 15, 2022

Area of Science:

* Signal processing and computational imaging.
* Optics and spectroscopy.
* Image reconstruction and analysis.

Background:

* Multiplexing using m-sequences enhances measurement throughput in fields like spectroscopy and coded aperture imaging.
* Traditional decoding methods rely on the fast Hadamard transform (FHT), which offers computational efficiency but limits sampling resolution and can introduce phasing errors.
* Existing limitations hinder fine sampling and accurate reconstruction near sample boundaries.

Purpose of the Study:

* To introduce novel 1-D and 2-D fast delta Hadamard transforms (FDHT) that overcome the limitations of the FHT.
* To enhance measurement decoding accuracy and resolution in multiplexed systems.
* To provide a unified mathematical framework for techniques in Hadamard spectroscopy and coded aperture imaging.

Main Methods:

* Development of 1-D and 2-D fast delta Hadamard transforms (FDHT).
* Application of FDHT to decoding m-sequence encoded measurements.
* Integration of techniques from Hadamard spectroscopy and coded aperture imaging under the FDHT framework.

Main Results:

* FDHT successfully overcomes the resolution sampling limitations inherent in the FHT.
* Phasing errors near sample boundaries are mitigated by the FDHT.
* The developed methods provide a unified mathematical basis for diverse imaging and spectroscopic techniques.

Conclusions:

* The fast delta Hadamard transform (FDHT) offers a significant advancement in decoding multiplexed measurements.
* FDHT enhances spectral and image resolution and reduces artifacts compared to FHT.
* This work unifies disparate techniques in spectroscopy and imaging, paving the way for broader applications.