Circulant Hermitian Matrix Inversion Method Based on Discrete Cosine and Sine Transforms

D. Guevorkian, K. Rounioja, J. Takala
{"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}
引用次数: 0

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.
基于离散余弦和正弦变换的循环厄米矩阵反演方法
提出了一种快速求循环厄米矩阵逆的新方法。在通信技术、信号处理和其他领域的许多算法中,这种矩阵的反演是计算最复杂的步骤之一。所提出的方法是基于使用类型1的离散余弦(DCT-1)和离散正弦(DST-1)变换。与传统的基于快速傅里叶变换(FFT)的方法相比,它减少了大约四倍的运算次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信