{"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}
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.