Representation of real discrete Fourier transform in terms of a new set of functions based upon Möbius inversion

DOI10.1007/BF01935373zbMath0589.65094OpenAlexW1979589668MaRDI QIDQ1074335

B. George

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01935373

zbMATH Keywords

factorizationMöbius inversiontransformdiscrete Fouriernumber theoretic series

Mathematics Subject Classification ID

Factorization of matrices (15A23) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (1)

Maximum likelihood ratio detection of abrupt state change for MIMO linear systems based on frequency domain data

Cites Work

• Discrete Fourier transform computation via the Walsh transform
• On Computing the Discrete Fourier Transform
• An Algorithm for the Machine Calculation of Complex Fourier Series
• The Calculation of Fourier Coefficients by the Mobius Inversion of the Poisson Summation Formula. Part I: Functions whose Early Derivatives are Continuous
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Representation of real discrete Fourier transform in terms of a new set of functions based upon Möbius inversion