Fast computation of time-dependent acoustic fields

Michael Carley1, Ghader Ghorbaniasl2

  • 1Department of Mechanical Engineering, University of Bath, Bath BA2 7AY, United Kingdom.

Summary

This study introduces a fast method for calculating time-dependent acoustic fields from complex sources. The technique significantly reduces computation time for transient signals, especially with numerous sources.

Related Concept Videos

Echo01:06

Echo

The human ear cannot distinguish between two sources of sound if they happen to reach within a specific time interval, typically 0.1 seconds apart. More than this, and they are perceived as separate sources.
Imagine the sound is reflected back to the ears. Assuming that the source is very close to the human, the difference between hearing the two sounds—the emitted sound and the reflected sound—may be more than the minimum time for perceiving distinct sounds. If this is the case,...
1.1K
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...
1.1K
Deriving the Speed of Sound in a Liquid01:09

Deriving the Speed of Sound in a Liquid

As with waves on a string, the speed of sound or a mechanical wave in a fluid depends on the fluid's elastic modulus and inertia. The two relevant physical quantities are the bulk modulus and the density of the material. Indeed, it turns out that the relationship between speed and the bulk modulus and density in fluids is the same as that between the speed and the Young's modulus and density in solids.
The speed of sound in fluids can be derived by considering a mechanical wave...
1.0K
Properties of DTFT II01:24

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 ω.
602
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
387
Discrete Fourier Transform01:15

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