The arithmetic Fourier transform and real neural networks: Summability by primes (Q1892528): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jmaa.1995.1072 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000218953 / rank | |||
Normal rank | |||
Latest revision as of 19:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The arithmetic Fourier transform and real neural networks: Summability by primes |
scientific article |
Statements
The arithmetic Fourier transform and real neural networks: Summability by primes (English)
0 references
11 March 1997
0 references
The arithmetic Fourier transform (AFT) is most suitable for the evaluation of Fourier cosine coefficients. The computation is accomplished by use of the Möbius function. The AFT first aroused interest in the field of signal processing because it was suitable for parallel processing. Another feature of the AFT algorithm is that it models the structure of a double layer in an artificial neural network. If the brain (a real neural network) carries out Fourier analysis, is this similar to the AFT rather than conventional Fourier analysis? The purpose of this paper is to present some mathematical results related to the question.
0 references
summability by primes
0 references
summability method
0 references
Möbius inversion
0 references
arithmetic Fourier transform
0 references
Fourier cosine coefficients
0 references
Möbius function
0 references
signal processing
0 references
parallel processing
0 references
double layer
0 references
artificial neural network
0 references
