Rajesh Thomas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rajesh Thomas has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Linda S. DeBrunner
Department of Electrical and Computer Engineering Florida State University Tallahassee Florida USA
2 shared publications - Victor DeBrunner
Electrical and Computer Engineering, Florida A&M University-Florida State University College of Engineering, 86485 Tallahassee, Florida, United States
2 shared publications
Latest Publications
- Open Access
A Sparse Algorithm for Computing the DFT Using Its Real Eigenvectors
Direct computation of the discrete Fourier transform (DFT) and its FFT computational algorithms requires multiplication (and addition) of complex numbers. Complex number multiplication requires four real-valued multiplications and two real-valued additions, or three real-valued multiplications and five real-valued additions, as well as the requisite added memory for temporary storage. In this paper, we present a method for computing a DFT via a natively real-valued algorithm that is computationally equivalent to a -length DFT (where k is a positive integer), and is substantially more efficient for any other length, N. Our method uses the eigenstructure of the DFT, and the fact that sparse, real-valued, eigenvectors can be found and used to advantage. Computation using our method uses only vector dot products and vector-scalar products.Open AccessA Sparse Algorithm for Computing the DFT Using Its Real Eigenvectors
Direct computation of the discrete Fourier transform (DFT) and its FFT computational algorithms requires multiplication (and addition) of complex numbers. Complex number multiplication requires four real-valued multiplications and two real-valued additions, or three real-valued multiplications and five real-valued additions, as well as the requisite added memory for temporary storage. In this paper, we present a method for computing a DFT via a natively real-valued algorithm that is computationally equivalent to a -length DFT (where k is a positive integer), and is substantially more efficient for any other length, N. Our method uses the eigenstructure of the DFT, and the fact that sparse, real-valued, eigenvectors can be found and used to advantage. Computation using our method uses only vector dot products and vector-scalar products. - 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 858-862
How the Discrete Hirschman Transform Inherits its Eigenstructure from the DFT
Following the earlier work, the discrete Hirschman transform (DHT) structure is extended to other transforms: the cosine, sine, Walsh-Hadamard and the wavelet transforms. The eigenstructure of the discrete Hirschman transforms are derived, and in fact we show that they are inherited directly from the DFT eigenstructure. Two properties of the discrete Hirschman transforms, invertibility and unitarity, are proven.
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 858-862
How the Discrete Hirschman Transform Inherits its Eigenstructure from the DFT
Following the earlier work, the discrete Hirschman transform (DHT) structure is extended to other transforms: the cosine, sine, Walsh-Hadamard and the wavelet transforms. The eigenstructure of the discrete Hirschman transforms are derived, and in fact we show that they are inherited directly from the DFT eigenstructure. Two properties of the discrete Hirschman transforms, invertibility and unitarity, are proven.