Efficient discrete fractional Hirschman optimal transform and its application

All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose computation

• Type: Journal
• Year: 2011
• Where: ICASSP
• Authors: Wen-Liang Hsue, Soo-Chang Pei, Jian-Jiun Ding
• Keywords: Computation Complexity, Discrete Fractional Signal, Fractional Signal, ICASSP 2011, Signal Processing