Name
Abstract | ||
|---|---|---|
All of the existing TV-point discrete fractional signal transforms require O(N2) computation complexity. In this paper, we propose a new discrete fractional signal transform whose computation complexity can be reduced to O(N1.5). This new transform is a fractional version of a DFT-based signal transform called as the Hirschman optimal transform (HOT) in the literature. Eigenvalues and eigenvectors properties of the HOT are also developed. Moreover, the proposed discrete fractional HOT transform is extended to further reduce the required computation complexity to linear order O(N). As an application example, we apply this new computationally efficient discrete fractional signal transform to encrypt digital images. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ICASSP.2011.5946258 | ICASSP |
Keywords | Field | DocType |
digital image encryption,eigenvalues,image coding,dft,cryptography,hirschman optimal transform,tv-point discrete fractional signal transform,computational complexity,discrete fourier transforms,fractional fourier transform,computation complexity,dft-based signal transform,eigenvectors,discrete fractional hot transform,discrete fractional hirschman optimal transform,discrete fractional fourier transform,digital image,encryption,indexing terms,linear order,signal processing,discrete fourier transform,eigenvalues and eigenvectors | Mathematical optimization,Lapped transform,Computer science,Discrete Fourier transform (general),Discrete Hartley transform,Hartley transform,Discrete Fourier transform,S transform,Discrete sine transform,Fractional Fourier transform | Conference |
ISSN | ISBN | Citations |
1520-6149 E-ISBN : 978-1-4577-0537-3 | 978-1-4577-0537-3 | 1 |
PageRank | References | Authors |
0.38 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wen-Liang Hsue | 1 | 100 | 10.67 |
| Soo-Chang Pei | 2 | 60 | 6.87 |
| Jian-Jiun Ding | 3 | 738 | 88.09 |