{"title":"一种有效的10点DFT算法及其应用","authors":"Haijun Li, Ran Fei","doi":"10.1109/ICECE.2010.1122","DOIUrl":null,"url":null,"abstract":"An efficient algorithm for computing 10-point DFT, which can contribute fast algorithms to more N-point DFTs, is developed. The computation of one 10-point DFT requires only 20 real multiplications, 84 real additions and 4 real right-shiftings 2 bits. According to the principles of decimation-in-time (DIT) or decimation-in-frequency (DIF) or double factors algorithm and the efficient algorithm of 10-point DFT, 10M, 10×M, 2M×10, 4M×10-point DFT have their own efficient algorithms, respectively. Thus, many N-point DFTs are possessed of own fast fourier transform algorithms. Especially, in efficient algorithm for computing 10-point DFT, in other words, in radix-10 FFT algorithm, one 102-point DFT requires 720 real multiplications, 1840 real additions and 80 real right-shiftings, one 103-point DFT requires 12760 real multiplications, 28580 real additions and 1200 real right-shiftings 2 bits, and one 104-point DFT requires 183560 real multiplications, 387780 real additions and 16000 real right-shiftings 2 bits.","PeriodicalId":6419,"journal":{"name":"2010 International Conference on Electrical and Control Engineering","volume":"37 1","pages":"4642-4645"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Efficient Algorithm of 10-Point DFT and its Applications\",\"authors\":\"Haijun Li, Ran Fei\",\"doi\":\"10.1109/ICECE.2010.1122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient algorithm for computing 10-point DFT, which can contribute fast algorithms to more N-point DFTs, is developed. The computation of one 10-point DFT requires only 20 real multiplications, 84 real additions and 4 real right-shiftings 2 bits. According to the principles of decimation-in-time (DIT) or decimation-in-frequency (DIF) or double factors algorithm and the efficient algorithm of 10-point DFT, 10M, 10×M, 2M×10, 4M×10-point DFT have their own efficient algorithms, respectively. Thus, many N-point DFTs are possessed of own fast fourier transform algorithms. Especially, in efficient algorithm for computing 10-point DFT, in other words, in radix-10 FFT algorithm, one 102-point DFT requires 720 real multiplications, 1840 real additions and 80 real right-shiftings, one 103-point DFT requires 12760 real multiplications, 28580 real additions and 1200 real right-shiftings 2 bits, and one 104-point DFT requires 183560 real multiplications, 387780 real additions and 16000 real right-shiftings 2 bits.\",\"PeriodicalId\":6419,\"journal\":{\"name\":\"2010 International Conference on Electrical and Control Engineering\",\"volume\":\"37 1\",\"pages\":\"4642-4645\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Electrical and Control Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECE.2010.1122\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Electrical and Control Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECE.2010.1122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Algorithm of 10-Point DFT and its Applications
An efficient algorithm for computing 10-point DFT, which can contribute fast algorithms to more N-point DFTs, is developed. The computation of one 10-point DFT requires only 20 real multiplications, 84 real additions and 4 real right-shiftings 2 bits. According to the principles of decimation-in-time (DIT) or decimation-in-frequency (DIF) or double factors algorithm and the efficient algorithm of 10-point DFT, 10M, 10×M, 2M×10, 4M×10-point DFT have their own efficient algorithms, respectively. Thus, many N-point DFTs are possessed of own fast fourier transform algorithms. Especially, in efficient algorithm for computing 10-point DFT, in other words, in radix-10 FFT algorithm, one 102-point DFT requires 720 real multiplications, 1840 real additions and 80 real right-shiftings, one 103-point DFT requires 12760 real multiplications, 28580 real additions and 1200 real right-shiftings 2 bits, and one 104-point DFT requires 183560 real multiplications, 387780 real additions and 16000 real right-shiftings 2 bits.