Related Experiment Videos

Comparing the performance of FA, DFA and DMA using different synthetic long-range correlated time series

Ying-Hui Shao1, Gao-Feng Gu, Zhi-Qiang Jiang

  • 1School of Business, East China University of Science and Technology, Shanghai 200237, China.

Scientific Reports
|November 15, 2012
PubMed

Related Concept Videos

Drug Concentration Versus Time Correlation01:15

Drug Concentration Versus Time Correlation

The plasma drug concentration-time curve is a crucial tool in pharmacokinetics, representing the drug's concentration in plasma at different time intervals post-administration. This curve illustrates the drug's journey from absorption into the systemic circulation, distribution to body tissues, and eventual elimination through excretion or biotransformation.
Two pivotal parameters are the minimum effective concentration (MEC) and the minimum toxic concentration (MTC). The MEC is the lowest drug...
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]...
Mean Absolute Deviation01:13

Mean Absolute Deviation

The mean absolute deviation is also a measure of the variability of data in a sample. It is the absolute value of the average difference between the data values and the mean.
Let us consider a dataset containing the number of unsold cupcakes in five shops: 10, 15, 8, 7, and 10. Initially, calculate the sample mean. Then calculate the deviation, or the difference, between each data value and the mean. Next, the absolute values of these deviations are added and divided by the sample size to...
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...
Relation of DFT to z-Transform01:20

Relation of DFT to z-Transform

The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the terms of...
Aliasing01:18

Aliasing

Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...