The arithmetic Fourier transform and real neural networks: Summability by primes (Q1892528)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 765119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The arithmetic Fourier transform and real neural networks: Summability by primes |
scientific article; zbMATH DE number 765119 |
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
0.7993300557136536
0 references
0.7548456192016602
0 references
