Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
21
click to vote
ICASSP
2011
IEEE
favorite
Email
discuss
report
153
views
Signal Processing
»
more
ICASSP 2011
»
Efficient discrete fractional Hirschman optimal transform and its application
13 years 2 months ago
Download
mirlab.org
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
Wen-Liang Hsue, Soo-Chang Pei, Jian-Jiun Ding
Real-time Traffic
Computation Complexity
|
Discrete Fractional Signal
|
Fractional Signal
|
ICASSP 2011
|
Signal Processing
|
claim paper
Related Content
»
Small Discrete Fourier Transforms on GPUs
»
SHIFTSPLIT IO Efficient Maintenance of WaveletTransformed Multidimensional Data
»
Mining discrete patterns via binary matrix factorization
»
Video face recognition with graphbased semisupervised learning
»
Splines and Wavelets New Perspectives for Pattern Recognition
more »
Post Info
More Details (n/a)
Added
20 Aug 2011
Updated
20 Aug 2011
Type
Journal
Year
2011
Where
ICASSP
Authors
Wen-Liang Hsue, Soo-Chang Pei, Jian-Jiun Ding
Comments
(0)
Researcher Info
Signal Processing Study Group
Computer Vision