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

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

Linear Approximation in Frequency Domain

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

Continuous -time Fourier Transform

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...

You might also read

Related Articles

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

Sort by

Same author

Low-Complexity 2D-DOD and 2D-DOA Estimation in Bistatic MIMO Radar Systems: A Reduced-Dimension MUSIC Algorithm Approach.

Sensors (Basel, Switzerland)·2024

Same author

The Robust EM-type Algorithms for Log-concave Mixtures of Regression Models.

Computational statistics & data analysis·2017

Same author

Tubulins, rhythms and cell walls in poplar leaves: it's all in the timing.

Tree physiology·2017

Same author

Biomimetic matrix fabricated by LMP-1 gene-transduced MC3T3-E1 cells for bone regeneration.

Biofabrication·2017

Same author

Dynamic contrast-enhanced MRI in orbital lymphoproliferative disorders: Effects of region of interest selection methods on time efficiency, measurement reproducibility, and diagnostic ability.

Journal of magnetic resonance imaging : JMRI·2017

Same author

Global patent landscape of programmed cell death 1: implications of the rapid expansion.

Expert opinion on therapeutic patents·2017

Search research articles

Related Experiment Video

Updated: Jun 22, 2025

Simultaneous Data Collection of fMRI and fNIRS Measurements Using a Whole-Head Optode Array and Short-Distance Channels

Simultaneous Data Collection of fMRI and fNIRS Measurements Using a Whole-Head Optode Array and Short-Distance Channels

Published on: October 20, 2023

Direct Position Determination of Non-Gaussian Sources for Multiple Nested Arrays: Discrete Fourier Transform and

Hao Hu^1,2,3, Meng Yang^1,2, Qi Yuan^1,2

¹College of Electronic Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China.

Sensors (Basel, Switzerland)

|June 27, 2024

Summary

This study introduces a new direct position determination (DPD) algorithm for non-Gaussian sources using multiple nested arrays (MNAs). The method enhances computational efficiency and accuracy in source localization.

Keywords:

Discrete Fourier Transform Taylor compensation direct position determination multiple nested arrays non-Gaussian signal

More Related Videos

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

Published on: May 30, 2016

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

Published on: October 24, 2012

Related Experiment Videos

Last Updated: Jun 22, 2025

Simultaneous Data Collection of fMRI and fNIRS Measurements Using a Whole-Head Optode Array and Short-Distance Channels

Simultaneous Data Collection of fMRI and fNIRS Measurements Using a Whole-Head Optode Array and Short-Distance Channels

Published on: October 20, 2023

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

Published on: May 30, 2016

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

Published on: October 24, 2012

Area of Science:

Signal Processing
Array Signal Processing
Statistical Signal Processing

Background:

Direct Position Determination (DPD) algorithms often face computational challenges with non-Gaussian sources.
Existing methods using Multiple Nested Arrays (MNAs) can be computationally intensive and may not fully utilize signal characteristics.

Purpose of the Study:

To propose a novel and computationally efficient DPD algorithm for non-Gaussian sources utilizing MNAs.
To improve the accuracy of source localization by addressing limitations of current DPD techniques.

Main Methods:

Computation of the fourth-order cumulant matrix of the received signal.
Application of a vectorizing method and a normalized Discrete Fourier Transform (DFT) matrix for an efficient DPD cost function.
Utilization of first-order Taylor compensation to refine localization accuracy.

Main Results:

The proposed algorithm demonstrates reduced computational complexity compared to existing methods.
Numerical simulations confirm the enhanced accuracy of the DPD results.
The algorithm effectively handles non-Gaussian signal characteristics in MNA scenarios.

Conclusions:

The Discrete Fourier Transform (DFT) and Taylor compensation algorithm offers a superior approach for DPD of non-Gaussian sources with MNAs.
This method provides a more computationally tractable and accurate solution for source localization problems.