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

Author

Guevorkian, D. ; Rounioja, K. ; Takala, Jarmo

Author_Institution

Dept. of Comput. Syst., Tampere Univ. of Technol., Tampere, Finland

fYear

2012

fDate

17-19 Oct. 2012

Firstpage

306

Lastpage

311

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.

Keywords

Hermitian matrices; computational complexity; discrete cosine transforms; fast Fourier transforms; matrix inversion; DCT; DST; FFT; circulant Hermitian matrix inversion method; communication technology; complexity; discrete cosine transform; discrete sine transform; fast Fourier transform; signal processing; Approximation algorithms; Complexity theory; Discrete Fourier transforms; Signal processing algorithms; Symmetric matrices; Vectors; Circulant Hermitian matrix; discrete cosine or sine transform; inverse matrix;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Systems (SiPS), 2012 IEEE Workshop on

Conference_Location

Quebec City, QC

ISSN

2162-3562

Print_ISBN

978-1-4673-2986-6

Type

conf

DOI

10.1109/SiPS.2012.52

Filename

6363273