离散分数傅里叶变换

Proceedings of Third International Symposium on Time-Frequency and Time-Scale Analysis (TFTS-96) Pub Date : 1996-06-18 DOI:10.1109/TFSA.1996.547217

O. Arikan, M. Kutay, H. Ozaktas, O.K. Akdemir

{"title":"离散分数傅里叶变换","authors":"O. Arikan, M. Kutay, H. Ozaktas, O.K. Akdemir","doi":"10.1109/TFSA.1996.547217","DOIUrl":null,"url":null,"abstract":"Based on the fractional Fourier transformation of sampled periodic functions, the discrete form of the fractional Fourier transformation is obtained. It is found that for a certain dense set of fractional orders it is possible to define a discrete transformation. Also, for its efficient computation a fast algorithm, which has the same complexity as the FFT, is given.","PeriodicalId":415923,"journal":{"name":"Proceedings of Third International Symposium on Time-Frequency and Time-Scale Analysis (TFTS-96)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"The discrete fractional Fourier transformation\",\"authors\":\"O. Arikan, M. Kutay, H. Ozaktas, O.K. Akdemir\",\"doi\":\"10.1109/TFSA.1996.547217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the fractional Fourier transformation of sampled periodic functions, the discrete form of the fractional Fourier transformation is obtained. It is found that for a certain dense set of fractional orders it is possible to define a discrete transformation. Also, for its efficient computation a fast algorithm, which has the same complexity as the FFT, is given.\",\"PeriodicalId\":415923,\"journal\":{\"name\":\"Proceedings of Third International Symposium on Time-Frequency and Time-Scale Analysis (TFTS-96)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Third International Symposium on Time-Frequency and Time-Scale Analysis (TFTS-96)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TFSA.1996.547217\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Third International Symposium on Time-Frequency and Time-Scale Analysis (TFTS-96)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TFSA.1996.547217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 29

摘要

基于采样周期函数的分数阶傅里叶变换，得到了分数阶傅里叶变换的离散形式。发现对于一个分数阶的密集集合，可以定义一个离散变换。同时，为了提高算法的计算效率，给出了一种与FFT算法具有相同复杂度的快速算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The discrete fractional Fourier transformation

Based on the fractional Fourier transformation of sampled periodic functions, the discrete form of the fractional Fourier transformation is obtained. It is found that for a certain dense set of fractional orders it is possible to define a discrete transformation. Also, for its efficient computation a fast algorithm, which has the same complexity as the FFT, is given.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of Third International Symposium on Time-Frequency and Time-Scale Analysis (TFTS-96)

自引率

0.00%

发文量