• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.3-10
• /
• 2014

In this paper we review the typical Toeplitz matrices and block circulant matrices, and propose the a circulant Hadamard matrix which is consisted of +1 and -1, but its structure is different from typical Hadamard matrix. The proposed circulant Hadamard matrix decreases computational complexities to $Nlog_2N$ additions through high speed algorithm compare to original one. This matrix is able to be applied to Massive MIMO channel estimation, FIR filter design, amd signal processing.

• Kyungpook Mathematical Journal
• /
• v.28 no.1
• /
• pp.45-50
• /
• 1988

Circulant and multiblock circulant matrices have many important applications, and therefore their inverses are of considerable interest. A simple recursive algorithm is presented to compute the inverse of a multiblock circulant matrix. The algorithm only uses complex variables, roots of unity and normal matrix/vector operations.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.81-96
• /
• 2004

The level-m scaled circulant factor matrix over the complex number field is introduced. Its diagonalization and spectral decomposition and representation are discussed. An explicit formula for the entries of the inverse of a level-m scaled circulant factor matrix is presented. Finally, an algorithm for finding the inverse of such matrices over the quaternion division algebra is given.

• Honam Mathematical Journal
• /
• v.38 no.4
• /
• pp.725-738
• /
• 2016

In this paper, the explicit determinants of the circulant and negacyclic matrix involving Tetranacci sequence $M_n$ and Companion-Tetranacci sequence $K_n$ are expressed by using only Tetranacci sequence $M_n$ and Companion-Tetranacci sequence $K_n$. Also euclidean norms and spectral norms of circulant and negacyclic matrices have been obtained.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.3
• /
• pp.437-447
• /
• 2003

We propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization (CMF). Circulant matrix factorization is also very powerful tool used fur spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. Schur algorithm is the method for a fast Cholesky factorization of Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR Inter and for the case of the IIR filter are included, and performance of our method check by comparing of our method and another methods (polynomial root finding and cepstral deconvolution).

• Communications of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.695-704
• /
• 2018

In this paper, firstly we compute the spectral norm of g-circulant matrices $C_{n,g}=g-Circ(c_0,c_1,{\cdots},c{_{n-1}})$, where $c_i{\geq}0$ or $c_i{\leq}0$ (equivalently $c_i{\cdot}c_j{\geq}0$). After, we compute the spectral norms, determinants and inverses of the g-circulant matrices with the Fibonacci and Lucas numbers.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.45-57
• /
• 2005

An efficient algorithm for finding the inverse and the group inverse of the FLS $\gamma-circulant$ matrix is presented by Euclidean algorithm. Extension is made to compute the inverse of the FLS $\gamma-retrocirculant$ matrix by using the relationship between an FLS $\gamma-circulant$ matrix and an FLS $\gamma-retrocirculant$ matrix. Finally, some examples are given.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.1
• /
• pp.35-44
• /
• 2004

We Propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization (CMF). Circulant matrix factorization is also very powerful tool used for spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. Schur algorithm is the method for a fast Cholesky factorization of Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR filter and for the case of the In filter are included, and performance of our method check by comparing of our method and another methods (polynomial root finding and cepstral deconvolution).

• Journal of applied mathematics & informatics
• /
• v.38 no.1_2
• /
• pp.99-112
• /
• 2020

The study is about the bounds of the spectral norms of r-circulant and geometric circulant matrices with the sequences called biperiodic Jacobsthal numbers. Then we give bounds for the spectral norms of Kronecker and Hadamard products of these r-circulant matrices and geometric circulant matrices. The eigenvalues and determinant of r-circulant matrices with the bi-periodic Jacobsthal numbers are obtained.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.313-316
• /
• 1997

Two different issues, design of reduced-order robust model predictive control and input signal design for identification of a MIMO system, are addressed and design techniques based on singular value decomposition(SVD) of the pulse response circulant matrix(PRCM) are proposed. For this, we investigate the properties of the PRCM, which is a periodic approximation of a linear discrete-time system, and show its SVD represents the directional as well as the frequency decomposition of the system. Usefulness of the PRCM and effectiveness of the proposed design techniques are demonstrated through numerical examples.