Pub Date : 2013-01-01DOI: 10.5013/ijssst.a.17.33.23
Fang Aidong
Fast Fourier Transformation is widely applied in fields of digital signal processing and communication.Multi-core CPU is increasingly common,and based on the parallelism of FFT algorithm,butterfly algorithm can be flexibly decomposited;we can improve the computational efficiency of FFT via investigating the allocation of parallel blocks and nested relations to optimize the algorithm,and reasonably allocating threads to realize parallel computing of multi-core CPU.
{"title":"Optimization of FFT Parallel Algorithm on Multi-Core CPUs","authors":"Fang Aidong","doi":"10.5013/ijssst.a.17.33.23","DOIUrl":"https://doi.org/10.5013/ijssst.a.17.33.23","url":null,"abstract":"Fast Fourier Transformation is widely applied in fields of digital signal processing and communication.Multi-core CPU is increasingly common,and based on the parallelism of FFT algorithm,butterfly algorithm can be flexibly decomposited;we can improve the computational efficiency of FFT via investigating the allocation of parallel blocks and nested relations to optimize the algorithm,and reasonably allocating threads to realize parallel computing of multi-core CPU.","PeriodicalId":15302,"journal":{"name":"Journal of Changsha University of Electric Power","volume":"36 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90077269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：