用中国剩余定理梳理共环DFT矩阵的方法

Ying Guo, Yangye Liu, M. Lee, Wei Duan
{"title":"用中国剩余定理梳理共环DFT矩阵的方法","authors":"Ying Guo, Yangye Liu, M. Lee, Wei Duan","doi":"10.1109/CSSR.2010.5773811","DOIUrl":null,"url":null,"abstract":"Employing Chinese remainder theorem (CRT) index mapping for DFT matrices, a notation referred as cocyclic DFT matrices is proposed. Following the mathematical proof, it can be seen that using CRT index scheme proves the resulting DFT matrix in possession of cocyclic property. By exploiting the close relationship of successively lower order DFT matrices, a fast construction approach for general cocyclic DFT matrices is described in simple way. The proposed construction algorithm is presented for simplicity and clarity for it only minimally related to sparse matrices. The result indicates the presented fast algorithm performs quite well at decreasing the computation complexity.","PeriodicalId":236344,"journal":{"name":"2010 International Conference on Science and Social Research (CSSR 2010)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A combing method of cocyclic DFT matrices by the Chinese remainder theorem\",\"authors\":\"Ying Guo, Yangye Liu, M. Lee, Wei Duan\",\"doi\":\"10.1109/CSSR.2010.5773811\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Employing Chinese remainder theorem (CRT) index mapping for DFT matrices, a notation referred as cocyclic DFT matrices is proposed. Following the mathematical proof, it can be seen that using CRT index scheme proves the resulting DFT matrix in possession of cocyclic property. By exploiting the close relationship of successively lower order DFT matrices, a fast construction approach for general cocyclic DFT matrices is described in simple way. The proposed construction algorithm is presented for simplicity and clarity for it only minimally related to sparse matrices. The result indicates the presented fast algorithm performs quite well at decreasing the computation complexity.\",\"PeriodicalId\":236344,\"journal\":{\"name\":\"2010 International Conference on Science and Social Research (CSSR 2010)\",\"volume\":\"158 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Science and Social Research (CSSR 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSSR.2010.5773811\",\"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 Science and Social Research (CSSR 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSSR.2010.5773811","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

利用DFT矩阵的中国剩余定理(CRT)索引映射,提出了一种共环DFT矩阵表示法。通过数学证明可以看出,使用CRT索引方案证明了得到的DFT矩阵具有共环性质。利用连续低阶DFT矩阵之间的密切关系,给出了一种快速构造一般共环DFT矩阵的简单方法。该构造算法与稀疏矩阵的关系最小,构造简单明了。结果表明,所提出的快速算法在降低计算复杂度方面有较好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A combing method of cocyclic DFT matrices by the Chinese remainder theorem
Employing Chinese remainder theorem (CRT) index mapping for DFT matrices, a notation referred as cocyclic DFT matrices is proposed. Following the mathematical proof, it can be seen that using CRT index scheme proves the resulting DFT matrix in possession of cocyclic property. By exploiting the close relationship of successively lower order DFT matrices, a fast construction approach for general cocyclic DFT matrices is described in simple way. The proposed construction algorithm is presented for simplicity and clarity for it only minimally related to sparse matrices. The result indicates the presented fast algorithm performs quite well at decreasing the computation complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信