مقاله

classical wavelet transforms over finite fields

چکیده

this article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. we present a concrete formulation for the frobenius norm of the classical wavelet transforms over finite fields. it is shown that each vector defined over a finite field can be represented as a finite coherent sum of classical wavelet coefficients.

اسناد مشابه

  • Classical Wavelet Transforms over Finite Fields

    مقاله۲۰۱۵Journal of Linear and Topological Algebra (JLTA)A. Ghaani Farashahi

    This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical

  • classical wavelet systems over finite fields

    مقالهwavelets and linear algebraarash ghaani farashahi, university of vienna

    this article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. it is shown that for a large class of non-zero window signals

  • Classical wavelet systems over finite fields

    مقاله۲۰۱۶Wavelets and Linear AlgebraArash Ghaani Farashahi

    This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals

  • Theory of wavelet transform over finite fields

    سند علمی۱۹۹۹ICASSPFaramarz Fekri, Russell M. Mersereau, Ronald W. Schafer

    In this paper, we develop the theory of the wavelet transform over Galois elds. To avoid the limitations inherent in the number theoretic Fourier transform over nite elds, our wavelet transform relies on a basis decomposition in the time domain rather than in the frequency domain

  • On Wavelet Decomposition over Finite Fields

    سند علمی۲۰۰۱CoRRHélio Magalhães de Oliveira, T. H. Falk

    Abstract – This paper introduces some foundations of wavelets over Galois fields. Standard orthogonal finite-field wavelets (FFWavelets) including FF-Haar and FFDaubechies are derived. Non-orthogonal FFwavelets such as B-spline over GF(p) are also considered. A few examples of mu

  • Computational Complexity of Fourier Transforms Over Finite Fields*

    سند علمی۲۰۱۰D. V. Sarwate

    In this paper we describe a method for computing the Discrete Fourier Transform (DFT) of a sequence of n elements over a finite field GF(pm) with a number of bit operations 0(nm log(nm) ■ P(q)) where P(q) is the number of bit operations required to multiply two q-bit integers and