Representation of real discrete Fourier transform in terms of a new set of functions based upon Möbius inversion (Q1074335): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3254471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Calculation of Fourier Coefficients by the Mobius Inversion of the Poisson Summation Formula. Part I: Functions whose Early Derivatives are Continuous / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Fourier transform computation via the Walsh transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Discrete Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01935373 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979589668 / rank
 
Normal rank

Latest revision as of 08:29, 30 July 2024

scientific article
Language Label Description Also known as
English
Representation of real discrete Fourier transform in terms of a new set of functions based upon Möbius inversion
scientific article

    Statements

    Representation of real discrete Fourier transform in terms of a new set of functions based upon Möbius inversion (English)
    0 references
    0 references
    0 references
    1985
    0 references
    Anstelle der trigonometrischen Basisfunktionen sin(2\(\pi\) n/N) und cos(2\(\pi\) n/N) wird mit Hilfe der inversen Möbius-Transformation eine neue Basis eingeführt, deren Elemente zahlentheoretische Funktionen sind. Diese Basisfunktionen besitzen eine Reihe von Eigenschaften, welche gestatten, die reelle diskrete Fouriertransformation mit ihrer Hilfe so darzustellen, daß sich die zugehörige Matrix faktorisieren läßt in das Produkt einer blockdiagonalen Matrix mit unterschiedlich großen Untermatrizen und einer Matrix, deren Elemente 1, -1 und 0 sind. Als Vorteil der resultierenden Methode können bestimmte Gruppen von Frequenzen unabhängig voneinander berechnet werden.
    0 references
    Möbius inversion
    0 references
    number theoretic series
    0 references
    discrete Fourier
    0 references
    transform
    0 references
    factorization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references