convolution+multiple

См. также в других словарях:

• Code division multiple access — This article is about a channel access method. For the mobile phone technology referred to as CDMA, see IS 95 and CDMA2000. Multiplex techniques Circuit mode (constant bandwidth) TDM · FDM  …   Wikipedia

• Plus petit commun multiple — En mathématiques et plus précisément en arithmétique, le plus petit commun multiple – en abrégé PPCM – de deux entiers non nuls a et b est le plus petit entier strictement positif qui soit à la fois multiple de ces deux nombres. On le note a ∨… …   Wikipédia en Français

• Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …   Wikipedia

• Schönhage-Strassen algorithm — The Schönhage Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. [A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen ,… …   Wikipedia

• Dirac delta function — Schematic representation of the Dirac delta function by a line surmounted by an arrow. The height of the arrow is usually used to specify the value of any multiplicative constant, which will give the area under the function. The other convention… …   Wikipedia

• Overlap-add method — The overlap add method (OA, OLA) is an efficient way to evaluate the discrete convolution between a very long signal x [n] with a finite impulse response (FIR) filter h [n] ::egin{align}y [n] = x [n] * h [n] stackrel{mathrm{def{=} sum {m=… …   Wikipedia

• Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… …   Wikipedia

• Distribution (mathematics) — This article is about generalized functions in mathematical analysis. For the probability meaning, see Probability distribution. For other uses, see Distribution (disambiguation). In mathematical analysis, distributions (or generalized functions) …   Wikipedia

• Overlap–add method — The overlap–add method (OA, OLA) is an efficient way to evaluate the discrete convolution of a very long signal x[n] with a finite impulse response (FIR) filter h[n]: where h[m]=0 for m outside the region [1, M]. The concept is to divide the… …   Wikipedia

• Coding theory — is the study of the properties of codes and their fitness for a specific application. Codes are used for data compression, cryptography, error correction and more recently also for network coding. Codes are studied by various scientific… …   Wikipedia

• Convergence of Fourier series — In mathematics, the question of whether the Fourier series of a periodic function converges to the given function is researched by a field known as classical harmonic analysis, a branch of pure mathematics. Convergence is not necessarily a given… …   Wikipedia