Digital delay line

Last updated
Standard block diagram representation of the integer M delay line. M-Sample Delay Line.png
Standard block diagram representation of the integer M delay line.

A digital delay line (or simply delay line, also called delay filter) is a discrete element in a digital filter, which allows a signal to be delayed by a number of samples. Delay lines are commonly used to delay audio signals feeding loudspeakers to compensate for the speed of sound in air, and to align video signals with accompanying audio, called audio-to-video synchronization. Delay lines may compensate for electronic processing latency so that multiple signals leave a device simultaneously despite having different pathways.

Contents

Digital delay lines are widely used building blocks in methods to simulate room acoustics, musical instruments and effects units. Digital waveguide synthesis shows how digital delay lines can be used as sound synthesis methods for various musical instruments such as string instruments and wind instruments.

If a delay line holds a non-integer value smaller than one, it results in a fractional delay line (also called interpolated delay line or fractional delay filter). A series of an integer delay line and a fractional delay filter is commonly used for modelling arbitrary delay filters in digital signal processing. [2] The Dattorro scheme is an industry standard implementation of digital filters using fractional delay lines. [3]

Theory

The standard delay line with integer delay is derived from the Z-transform of a discrete-time signal delayed by samples [4] :

In this case, is the integer delay filter with:

The discrete-time domain filter for integer delay as the inverse zeta transform of is trivial, since it is an impulse shifted by [5] :

Working in the discrete-time domain with fractional delays is less trivial. In its most general theoretical form, a delay line with arbitrary fractional delay is defined as a standard delay line with delay , which can be modelled as the sum of an integer component and a fractional component which is smaller than one sample:

(Fractional) Delay Line - Domain
(Def. 1)

This is the domain representation of a non-trivial digital filter design problem: the solution is an any time-domain filter that represents or approximates the inverse Z-transform of . [2]

Filter design solutions

Naive solution

The conceptually easiest solution is obtained by sampling the continuous-time domain solution, which is trivial for any delay value. Given a continuous-time signal delayed by samples, or seconds [6] :

In this case, is the continuous-time domain fractional delay filter with:

The naive solution for the sampled filter is the sampled inverse Fourier transform of , which produces a non-causal IIR filter shaped as a Cardinal Sine shifted by [6] :

The continuous-time domain is shifted by the fractional delay while the sampling is always aligned to the cartesian plane, therefore:

The ideal fractional delay line is obtained by sampling the inverse Fourier transform of the continuous-time domain fractional delay filter. Note how for integer delay value this case degenerates to simple shifted impulses. Delaying a sampled signal with this filter conceptually coincides to resampling its analog source with equal sampling period but sample alignment shifted by
D
[?]
R
{\displaystyle D\in \mathbb {R} }
. Also note that the image shows only the few samples around zero, but the non-causal IIR is defined for an infinite number of samples in both directions of the x-axis. Sampling of continuous-time domain sinc function at various fractional delay values.gif
The ideal fractional delay line is obtained by sampling the inverse Fourier transform of the continuous-time domain fractional delay filter. Note how for integer delay value this case degenerates to simple shifted impulses. Delaying a sampled signal with this filter conceptually coincides to resampling its analog source with equal sampling period but sample alignment shifted by . Also note that the image shows only the few samples around zero, but the non-causal IIR is defined for an infinite number of samples in both directions of the x-axis.

Truncated causal FIR solution

The conceptually easiest implementable solution is the causal truncation of the naive solution above. [7]

Truncating the impulse response might however cause instability, which can be mitigated in a few ways:

A block diagram representation of the Lagrange Interpolator formula. Block Diagram for the Explicit Formula for Lagrange Interpolation Coefficients.png
A block diagram representation of the Lagrange Interpolator formula.

What follows is an expansion of the formula above displaying the resulting filters of order up to :

Lagrange Interpolator Formula Expansion [7]
N = 1--
N = 2-
N = 3

All-pass IIR phase-approximated solution

Another approach is designing an IIR filter of order with a Z-transform structure that forces it to be an all-pass while still approximating a delay [7] :

The reciprocally placed zeros and poles of respectively flatten the frequency response, while the phase is function of the phase of . Therefore, the problem becomes designing the FIR filter , that is finding its coefficients as a function of D (note that always), so that the phase approximates best the desired value . [7]

The main solutions are:

What follows is an expansion of the formula above displaying the resulting coefficients of order up to :

Thiran All-Pole Low-Pass Filter Coefficients Formula Expansion [7]
N = 11--
N = 21-
N = 31

Commercial history

Eventide DDL 1745 Digital Delay Line DDL 1745-rack.jpg
Eventide DDL 1745 Digital Delay Line

Digital delay lines were first used to compensate for the speed of sound in air in 1973 to provide appropriate delay times for the distant speaker towers at the Summer Jam at Watkins Glen rock festival in New York, with 600,000 people in the audience. New York City–based company Eventide Clock Works provided digital delay devices each capable of 200 milliseconds of delay. Four speaker towers were placed 200 feet (60 m) from the stage, their signal delayed 175 ms to compensate for the speed of sound between the main stage speakers and the delay towers. Six more speaker towers were placed 400 feet from the stage, requiring 350 ms of delay, and a further six towers were placed 600 feet away from the stage, fed with 525 ms of delay. Each Eventide DDL 1745 module contained one hundred 1000-bit shift register chips and a bespoke digital-to-analog converter, and cost $3,800 (equivalent to $27,679in 2023). [12] [13]

See also

Related Research Articles

<span class="mw-page-title-main">Discrete Fourier transform</span> Type of Fourier transform in discrete mathematics

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies. It has the same sample-values as the original input sequence. The DFT is therefore said to be a frequency domain representation of the original input sequence. If the original sequence spans all the non-zero values of a function, its DTFT is continuous, and the DFT provides discrete samples of one cycle. If the original sequence is one cycle of a periodic function, the DFT provides all the non-zero values of one DTFT cycle.

<span class="mw-page-title-main">Nyquist–Shannon sampling theorem</span> Sufficiency theorem for reconstructing signals from samples

The Nyquist–Shannon sampling theorem is an essential principle for digital signal processing linking the frequency range of a signal and the sample rate required to avoid a type of distortion called aliasing. The theorem states that the sample rate must be at least twice the bandwidth of the signal to avoid aliasing. In practice, it is used to select band-limiting filters to keep aliasing below an acceptable amount when an analog signal is sampled or when sample rates are changed within a digital signal processing function.

<span class="mw-page-title-main">Wavelet</span> Function for integral Fourier-like transform

A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times. Wavelets are termed a "brief oscillation". A taxonomy of wavelets has been established, based on the number and direction of its pulses. Wavelets are imbued with specific properties that make them useful for signal processing.

A low-pass filter is a filter that passes signals with a frequency lower than a selected cutoff frequency and attenuates signals with frequencies higher than the cutoff frequency. The exact frequency response of the filter depends on the filter design. The filter is sometimes called a high-cut filter, or treble-cut filter in audio applications. A low-pass filter is the complement of a high-pass filter.

<span class="mw-page-title-main">Window function</span> Function used in signal processing

In signal processing and statistics, a window function is a mathematical function that is zero-valued outside of some chosen interval. Typically, window functions are symmetric around the middle of the interval, approach a maximum in the middle, and taper away from the middle. Mathematically, when another function or waveform/data-sequence is "multiplied" by a window function, the product is also zero-valued outside the interval: all that is left is the part where they overlap, the "view through the window". Equivalently, and in actual practice, the segment of data within the window is first isolated, and then only that data is multiplied by the window function values. Thus, tapering, not segmentation, is the main purpose of window functions.

In mathematics, the Gibbs phenomenon is the oscillatory behavior of the Fourier series of a piecewise continuously differentiable periodic function around a jump discontinuity. The th partial Fourier series of the function produces large peaks around the jump which overshoot and undershoot the function values. As more sinusoids are used, this approximation error approaches a limit of about 9% of the jump, though the infinite Fourier series sum does eventually converge almost everywhere except points of discontinuity.

In signal processing, a finite impulse response (FIR) filter is a filter whose impulse response is of finite duration, because it settles to zero in finite time. This is in contrast to infinite impulse response (IIR) filters, which may have internal feedback and may continue to respond indefinitely.

<span class="mw-page-title-main">Butterworth filter</span> Type of signal processing filter

The Butterworth filter is a type of signal processing filter designed to have a frequency response that is as flat as possible in the passband. It is also referred to as a maximally flat magnitude filter. It was first described in 1930 by the British engineer and physicist Stephen Butterworth in his paper entitled "On the Theory of Filter Amplifiers".

In mathematics and signal processing, the Hilbert transform is a specific singular integral that takes a function, u(t) of a real variable and produces another function of a real variable H(u)(t). The Hilbert transform is given by the Cauchy principal value of the convolution with the function (see § Definition). The Hilbert transform has a particularly simple representation in the frequency domain: It imparts a phase shift of ±90° (π/2 radians) to every frequency component of a function, the sign of the shift depending on the sign of the frequency (see § Relationship with the Fourier transform). The Hilbert transform is important in signal processing, where it is a component of the analytic representation of a real-valued signal u(t). The Hilbert transform was first introduced by David Hilbert in this setting, to solve a special case of the Riemann–Hilbert problem for analytic functions.

<span class="mw-page-title-main">Comb filter</span> Signal processing filter

In signal processing, a comb filter is a filter implemented by adding a delayed version of a signal to itself, causing constructive and destructive interference. The frequency response of a comb filter consists of a series of regularly spaced notches in between regularly spaced peaks giving the appearance of a comb.

In mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier analysis that is applicable to a sequence of discrete values.

<span class="mw-page-title-main">Rectangular function</span> Function whose graph is 0, then 1, then 0 again, in an almost-everywhere continuous way

The rectangular function is defined as

In signal processing, linear phase is a property of a filter where the phase response of the filter is a linear function of frequency. The result is that all frequency components of the input signal are shifted in time by the same constant amount, which is referred to as the group delay. Consequently, there is no phase distortion due to the time delay of frequencies relative to one another.

<span class="mw-page-title-main">Linear time-invariant system</span> Mathematical model which is both linear and time-invariant

In system analysis, among other fields of study, a linear time-invariant (LTI) system is a system that produces an output signal from any input signal subject to the constraints of linearity and time-invariance; these terms are briefly defined in the overview below. These properties apply (exactly or approximately) to many important physical systems, in which case the response y(t) of the system to an arbitrary input x(t) can be found directly using convolution: y(t) = (xh)(t) where h(t) is called the system's impulse response and ∗ represents convolution (not to be confused with multiplication). What's more, there are systematic methods for solving any such system (determining h(t)), whereas systems not meeting both properties are generally more difficult (or impossible) to solve analytically. A good example of an LTI system is any electrical circuit consisting of resistors, capacitors, inductors and linear amplifiers.

<span class="mw-page-title-main">Lanczos resampling</span> Application of a mathematical formula

Lanczos filtering and Lanczos resampling are two applications of a certain mathematical formula. It can be used as a low-pass filter or used to smoothly interpolate the value of a digital signal between its samples. In the latter case, it maps each sample of the given signal to a translated and scaled copy of the Lanczos kernel, which is a sinc function windowed by the central lobe of a second, longer, sinc function. The sum of these translated and scaled kernels is then evaluated at the desired points.

Pulse compression is a signal processing technique commonly used by radar, sonar and echography to either increase the range resolution when pulse length is constrained or increase the signal to noise ratio when the peak power and the bandwidth of the transmitted signal are constrained. This is achieved by modulating the transmitted pulse and then correlating the received signal with the transmitted pulse.

In functional analysis, the Shannon wavelet is a decomposition that is defined by signal analysis by ideal bandpass filters. Shannon wavelet may be either of real or complex type.

The Mathieu equation is a linear second-order differential equation with periodic coefficients. The French mathematician, E. Léonard Mathieu, first introduced this family of differential equations, nowadays termed Mathieu equations, in his “Memoir on vibrations of an elliptic membrane” in 1868. "Mathieu functions are applicable to a wide variety of physical phenomena, e.g., diffraction, amplitude distortion, inverted pendulum, stability of a floating body, radio frequency quadrupole, and vibration in a medium with modulated density"

The chirp pulse compression process transforms a long duration frequency-coded pulse into a narrow pulse of greatly increased amplitude. It is a technique used in radar and sonar systems because it is a method whereby a narrow pulse with high peak power can be derived from a long duration pulse with low peak power. Furthermore, the process offers good range resolution because the half-power beam width of the compressed pulse is consistent with the system bandwidth.

In number theory, the prime omega functions and count the number of prime factors of a natural number Thereby counts each distinct prime factor, whereas the related function counts the total number of prime factors of honoring their multiplicity. That is, if we have a prime factorization of of the form for distinct primes , then the respective prime omega functions are given by and . These prime factor counting functions have many important number theoretic relations.

References

  1. "The M-Sample Delay Line". ccrma.stanford.edu. Retrieved 2023-07-06.
  2. 1 2 3 4 5 Laakso, Timo I.; Välimäki, Vesa; Karjalainen, Matti A.; Laine, Unto K. (January 1996), "Splitting the unit delay [FIR/all pass filters design]", IEEE Signal Processing Magazine, vol. 13, no. 1, pp. 30–60, Bibcode:1996ISPM...13...30L, doi:10.1109/79.482137
  3. Smith, Julius O.; Lee, Nelson (June 5, 2008), "Computational Acoustic Modeling with Digital Delay", Center for Computer Research in Music and Acoustics, retrieved 2007-08-21
  4. "Delay Lines". ccrma.stanford.edu. Retrieved 2023-07-06.
  5. "INTRODUCTION TO DIGITAL FILTERS WITH AUDIO APPLICATIONS". ccrma.stanford.edu. Retrieved 2023-07-06.
  6. 1 2 "Ideal Bandlimited (Sinc) Interpolation". ccrma.stanford.edu. Retrieved 2023-07-06.
  7. 1 2 3 4 5 6 Välimäki, Vesa (1998). "Discrete Time Modeling of Acoustic Tubes Using Fractional Delay Filters".
  8. Harris, F.J. (1978). "On the use of windows for harmonic analysis with the discrete Fourier transform". Proceedings of the IEEE. 66 (1): 51–83. doi:10.1109/proc.1978.10837. ISSN   0018-9219. S2CID   426548.
  9. Hermanowicz, E. (1992). "Explicity [sic] formulas for weighting coefficients of maximally flat tunable FIR delays". Electronics Letters. 28 (20): 1936. doi:10.1049/el:19921239.
  10. Smith, Julius (5 September 2022). "Explicit Formula for Lagrange Interpolation Coefficients". ccrma .
  11. Thiran, J.-P. (1971). "Recursive digital filters with maximally flat group delay". IEEE Transactions on Circuit Theory. 18 (6): 659–664. doi:10.1109/TCT.1971.1083363. ISSN   0018-9324.
  12. Nalia Sanchez (July 29, 2016), "Remembering the Watkins Glen Festival", Eventide Audio, retrieved February 20, 2020
  13. "DDL 1745 Digital Delay". Eventide Audio. Retrieved 2023-07-22.

Further reading