Sciweavers

187 search results - page 25 / 38
» Alternatives to the discrete fourier transform
Sort
View
TWC
2008
148views more  TWC 2008»
13 years 8 months ago
ARMA Synthesis of Fading Channels
Computationally scalable and accurate estimation, prediction, and simulation of wireless communication channels is critical to the development of more adaptive transceiver algorith...
Hani Mehrpouyan, Steven D. Blostein
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 8 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 8 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
CVPR
2008
IEEE
14 years 3 months ago
Rotation symmetry group detection via frequency analysis of frieze-expansions
We present a novel and effective algorithm for rotation symmetry group detection from real-world images. We propose a frieze-expansion method that transforms rotation symmetry gro...
Seungkyu Lee, Robert T. Collins, Yanxi Liu
ICIP
2002
IEEE
14 years 10 months ago
Interpretation of uniform translational image motion: DCT versus FT
We study properties of the discrete cosine transform (DCT) when applied to an image sequence formed by uniformly translating a still image. The Fourier transform (FT) applied to s...
Nikola Bozinovic, Janusz Konrad