{"title":"基于离散余弦和正弦变换的循环厄米矩阵反演方法","authors":"D. Guevorkian, K. Rounioja, J. Takala","doi":"10.1109/SiPS.2012.52","DOIUrl":null,"url":null,"abstract":"A novel fast method for finding the inverse of a circulant Hermitian matrix is proposed. Inversion of such matrices is one of the most computationally complicated steps in many algorithms of communication technologies, signal processing, and other fields. The proposed method is based on using Discrete Cosine (DCT-1) and Discrete Sine (DST-1) transforms of Type 1. It reduces the number of operations approximately by a factor of four compared to conventional Fast Fourier Transform (FFT) based method.","PeriodicalId":286060,"journal":{"name":"2012 IEEE Workshop on Signal Processing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Circulant Hermitian Matrix Inversion Method Based on Discrete Cosine and Sine Transforms\",\"authors\":\"D. Guevorkian, K. Rounioja, J. Takala\",\"doi\":\"10.1109/SiPS.2012.52\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel fast method for finding the inverse of a circulant Hermitian matrix is proposed. Inversion of such matrices is one of the most computationally complicated steps in many algorithms of communication technologies, signal processing, and other fields. The proposed method is based on using Discrete Cosine (DCT-1) and Discrete Sine (DST-1) transforms of Type 1. It reduces the number of operations approximately by a factor of four compared to conventional Fast Fourier Transform (FFT) based method.\",\"PeriodicalId\":286060,\"journal\":{\"name\":\"2012 IEEE Workshop on Signal Processing Systems\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Workshop on Signal Processing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SiPS.2012.52\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Workshop on Signal Processing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SiPS.2012.52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Circulant Hermitian Matrix Inversion Method Based on Discrete Cosine and Sine Transforms
A novel fast method for finding the inverse of a circulant Hermitian matrix is proposed. Inversion of such matrices is one of the most computationally complicated steps in many algorithms of communication technologies, signal processing, and other fields. The proposed method is based on using Discrete Cosine (DCT-1) and Discrete Sine (DST-1) transforms of Type 1. It reduces the number of operations approximately by a factor of four compared to conventional Fast Fourier Transform (FFT) based method.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
