Sciweavers

160 search results - page 3 / 32
» On the diagonalization of the discrete Fourier transform
Sort
View
TSP
2008
178views more  TSP 2008»
13 years 7 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
ICMCS
2005
IEEE
140views Multimedia» more  ICMCS 2005»
14 years 29 days ago
Watermarking digital 3D volumes in the discrete Fourier transform domain
In this paper, a robust blind watermarking method for 3D volumes is presented. A bivalued watermark is embedded in the Fourier transform magnitude of the 3D volume. The Fourier do...
Vassilios Solachidis, Ioannis Pitas
IAJIT
2010
107views more  IAJIT 2010»
13 years 6 months ago
Low Latency, High Throughput, and Less Complex VLSI Architecture for 2D-DFT
: This paper proposes a pipelined, systolic architecture for two- dimensional discrete Fourier transform computation which is highly concurrent. The architecture consists of two, o...
Sohil Shah, Preethi Venkatesan, Deepa Sundar, Muni...
ISCAS
1999
IEEE
82views Hardware» more  ISCAS 1999»
13 years 11 months ago
Discrete fractional Hadamard transform
This paper is concerned with the definitions of the discrete fractional cosine transform (DFRCT) and the discrete fractional sine transform (DFRST). The definitions of DFRCT and DF...
Soo-Chang Pei, Min-Hung Yeh
ICASSP
2011
IEEE
12 years 11 months ago
The Centered Discrete Fourier Transform and a parallel implementation of the FFT
This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the...
Dale H. Mugler