User:Hiiqit/sandbox

Fast calculation algorithm for discrete resonance-based band-pass filter
A Fast calculation algorithm for discrete resonance-based band-pass filter (DRBF) computes the Discrete resonance-based transform (DRT) of a discrete-time signal. Similarly as Discrete Fourier transform, Discrete resonance-based transform converts a signal from its original domain (time, space or other domain) to a representation in the frequency domain. A DRT formulation is triggered by an inner ear (cochlea) simulation research. The stand-alone calculation algorithm related to the DRBF filter (the main element of DRT), produces its output with a delay of just one sampling period. This is an advantage over the most known frequency transformation algorithms, such as Fast Fourier transform and Discrete wavelet transform since latter two produce their results after with a delay of (usually) many sampling periods. The algorithm’s calculation cost is only 3 multiplications and 3 additions per sample, and does not require long memory buffers, which is another advantage over FFT. However, Discrete resonance-based transform does not surpass the precision of Discrete Fourier transform and Discrete wavelet transform. Still, it may prove essential when the noise-artifacts of a near-real-world simulation are necessary in order to produce some specific auditory-perception phenomena.