scholarly journals On the Spectrum and Spectral Norms of r-Circulant Matrices with Generalized k-Horadam Numbers Entries

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Lele Liu
Keyword(s):  
Explicit Formula ◽  
Circulant Matrix ◽  
Circulant Matrices ◽  
Sufficient Condition ◽  
Abel Transformation

This work is concerned with the spectrum and spectral norms of r-circulant matrices with generalized k-Horadam numbers entries. By using Abel transformation and some identities we obtain an explicit formula for the eigenvalues of them. In addition, a sufficient condition for an r-circulant matrix to be normal is presented. Based on the results we obtain the precise value for spectral norms of normal r-circulant matrix with generalized k-Horadam numbers, which generalize and improve the known results.

scholarly journals DIVERSITY AES IN MIXCOLUMNS STEP WITH 8X8 CIRCULANT MATRIX

2021 ◽  
Vol 8 (9) ◽  
pp. 19-35
Author(s):  
Yan-Wen Chen ◽  
Jeng-Jung Wang ◽  
Yan-Haw Chen ◽  
Chong-Dao Lee
Keyword(s):  
Embedded Systems ◽  
Efficient Method ◽  
Matrix Multiplication ◽  
Circulant Matrix ◽  
Circulant Matrices ◽  
Matrix Operation ◽  
Branch Number ◽  
Involutory Matrix ◽  
Software Implementations ◽  
Encryption Decryption

In AES MixColumns operation, the branch number of circulant matrix is raised from 5 to 9 with 8´8 circulant matrices that can be enhancing the diffusion power. An efficient method to compute the circulant matrices in AES MixColumns transformation for speeding encryption is presented. Utilizing 8´8 involutory matrix multiplication is required 64 multiplications and 56 additions in in AES Mix-Columns transformation. We proposed the method with diversity 8´8 circulant matrices is only needed 19 multiplications and 57 additions. It is not only to encryption operations but also to decryption operations. Therefore, 8´8 circlant matrix operation with AES key sizes of 128bits, 192bits, and 256 bits are above 29.1%, 29.3%, and 29.8% faster than using 4´4 involutory matrix operation (16 multiplications, 12 additions), respectively. 8´8 circulant matrix encryption/decryption speed is above 78% faster than 8´8 involutory matrix operation. Ultimately, the proposed method for evaluating matrix multiplication can be made regular, simple and suitable for software implementations on embedded systems.

scholarly journals Accelerating Deep Neural Networks by Combining Block-Circulant Matrices and Low-Precision Weights

Electronics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 78 ◽  
Author(s):  
Zidi Qin ◽  
Di Zhu ◽  
Xingwei Zhu ◽  
Xuan Chen ◽  
Yinghuan Shi ◽  
...  
Keyword(s):  
Neural Networks ◽  
Deep Neural Networks ◽  
Circulant Matrix ◽  
Circulant Matrices ◽  
Matrix Vector Multiplication ◽  
Processing Power ◽  
Measurement Results ◽  
Block Circulant Matrix ◽  
Storage Complexity ◽  
Fully Connected

As a key ingredient of deep neural networks (DNNs), fully-connected (FC) layers are widely used in various artificial intelligence applications. However, there are many parameters in FC layers, so the efficient process of FC layers is restricted by memory bandwidth. In this paper, we propose a compression approach combining block-circulant matrix-based weight representation and power-of-two quantization. Applying block-circulant matrices in FC layers can reduce the storage complexity from O ( k 2 ) to O ( k ) . By quantizing the weights into integer powers of two, the multiplications in the reference can be replaced by shift and add operations. The memory usages of models for MNIST, CIFAR-10 and ImageNet can be compressed by 171 × , 2731 × and 128 × with minimal accuracy loss, respectively. A configurable parallel hardware architecture is then proposed for processing the compressed FC layers efficiently. Without multipliers, a block matrix-vector multiplication module (B-MV) is used as the computing kernel. The architecture is flexible to support FC layers of various compression ratios with small footprint. Simultaneously, the memory access can be significantly reduced by using the configurable architecture. Measurement results show that the accelerator has a processing power of 409.6 GOPS, and achieves 5.3 TOPS/W energy efficiency at 800 MHz.

On the Structure of G(H, k)

2014 ◽  
Vol 21 (02) ◽  
pp. 317-330 ◽  
Author(s):  
Guixin Deng ◽  
Pingzhi Yuan
Keyword(s):  
Abelian Group ◽  
Positive Integer ◽  
Explicit Formula ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Directed Edge ◽  
Necessary And Sufficient

Let H be an abelian group written additively and k be a positive integer. Let G(H, k) denote the digraph whose set of vertices is just H, and there exists a directed edge from a vertex a to a vertex b if b = ka. In this paper we give a necessary and sufficient condition for G(H, k1) ≃ G(H, k2). We also discuss the problem when G(H1, k) is isomorphic to G(H2, k) for a given k. Moreover, we give an explicit formula of G(H, k) when H is a p-group and gcd (p, k)=1.

scholarly journals The Determinants, Inverses, Norm, and Spread of Skew Circulant Type Matrices Involving Any Continuous Lucas Numbers

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Jin-jiang Yao ◽  
Zhao-lin Jiang
Keyword(s):  
Circulant Matrix ◽  
Circulant Matrices ◽  
Lucas Numbers ◽  
Transformation Matrices ◽  
Skew Circulant ◽  
The Relationship

We consider the skew circulant and skew left circulant matrices with any continuous Lucas numbers. Firstly, we discuss the invertibility of the skew circulant matrices and present the determinant and the inverse matrices by constructing the transformation matrices. Furthermore, the invertibility of the skew left circulant matrices is also discussed. We obtain the determinants and the inverse matrices of the skew left circulant matrices by utilizing the relationship between skew left circulant matrices and skew circulant matrix, respectively. Finally, the four kinds of norms and bounds for the spread of these matrices are given, respectively.

scholarly journals A New Method of Matrix Decomposition to Get the Determinants and Inverses of r -Circulant Matrices with Fibonacci and Lucas Numbers

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Jiangming Ma ◽  
Tao Qiu ◽  
Chengyuan He
Keyword(s):  
Fibonacci Numbers ◽  
Matrix Decomposition ◽  
Circulant Matrix ◽  
New Method ◽  
Circulant Matrices ◽  
Computational Time ◽  
Lucas Numbers ◽  
Fibonacci And Lucas Numbers

We use a new method of matrix decomposition for r -circulant matrix to get the determinants of A n = Circ r F 1 , F 2 , … , F n and B n = Circ r L 1 , L 2 , … , L n , where F n is the Fibonacci numbers and L n is the Lucas numbers. Based on these determinants and the nonsingular conditions, inverse matrices are derived. The expressions of the determinants and inverse matrices are represented by Fibonacci and Lucas Numbers. In this study, the formulas of determinants and inverse matrices are much simpler and concise for programming and reduce the computational time.

scholarly journals On the circulant matrices with Ducci sequences and Fibonacci numbers

Filomat ◽  
2018 ◽  
Vol 32 (15) ◽  
pp. 5501-5508
Author(s):  
Süleyman Solak ◽  
Mustafa Bahşi ◽  
Osman Kan
Keyword(s):  
Fibonacci Numbers ◽  
Circulant Matrix ◽  
Circulant Matrices

A Ducci sequence generated by A = (a1,a2,...,an)? Zn is the sequence {A,DA,D2A,...} where the Ducci map D : Zn ? Zn is defined by D(A) = D(a1, a2,...,an) = (|a2-a1|, |a3-a2|,..., |an-an-1|, |an-a1|). In this study, we examine some properties of the matrices Cn, DCn, D2Cn; where Cn =Circ(c0,c1,..., cn-1) is a circulant matrix whose entries consist of Fibonacci numbers.

A Study of Binary Minimum-Energy Shortly Supported Wavelet Frames Associated with a Scaling Function

2011 ◽  
Vol 219-220 ◽  
pp. 500-503
Author(s):  
Qing Jiang Chen ◽  
Gai Hu
Keyword(s):  
Explicit Formula ◽  
Multiresolution Analysis ◽  
Scaling Function ◽  
Minimum Energy ◽  
Research Field ◽  
Sufficient Condition ◽  
Wavelet Frames ◽  
Existence Criterion ◽  
Generalized Multiresolution Analysis ◽  
Active Research

Frames have become the focus of active research field, both in theory and in applications. In the article, the binary minimum-energy wavelet frames and frame multiresolution resolution are introduced. A precise existence criterion for minimum-energy frames in terms of an ineqity conditi- -on on the Laurent poly-nomial symbols of the filter functions is provided. An explicit formula for designing minimum-energy frames is also established. The sufficient condition for the existence of affine pseudoframes is obtained by virtue of a generalized multiresolution analysis. The pyramid de -composition scheme is established based on such a generalized multiresolution structure.

scholarly journals Isomorphic Operators and Functional Equations for the Skew-Circulant Algebra

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Zhaolin Jiang ◽  
Tingting Xu ◽  
Fuliang Lu
Keyword(s):  
Differential Equations ◽  
Vector Space ◽  
Ordinary Differential Equations ◽  
Cyclic Group ◽  
Functional Equations ◽  
Circulant Matrix ◽  
Circulant Matrices ◽  
Linear Vector ◽  
Skew Circulant ◽  
Linear Vector Space

The skew-circulant matrix has been used in solving ordinary differential equations. We prove that the set of skew-circulants with complex entries has an idempotent basis. On that basis, a skew-cyclic group of automorphisms and functional equations on the skew-circulant algebra is introduced. And different operators on linear vector space that are isomorphic to the algebra ofn×ncomplex skew-circulant matrices are displayed in this paper.

The Research of Bivariate Minimum-Energy Wavelet Frames and Pseudoframes

2010 ◽  
Vol 159 ◽  
pp. 1-6
Author(s):  
Ping An Wang
Keyword(s):  
Explicit Formula ◽  
Multiresolution Analysis ◽  
Minimum Energy ◽  
Laurent Polynomial ◽  
Sufficient Condition ◽  
Wavelet Frames ◽  
Decomposition Scheme ◽  
Existence Criterion ◽  
Generalized Multiresolution Analysis ◽  
Active Research

Frames have become the focus of active research, both in theory and in applications. In the article, the notion of bivariate minimum-energy wavelet frames is introduced. A precise existence criterion for minimum-energy frames in terms of an inequality condition on the Laurent polynomial symbols of the filter functions is provided. An explicit formula for designing minimum-energy frames is also establish- ed. The sufficient condition for the existence of a class of affine pseudoframes with filter banks is obtained by virtue of a generalized multiresolution analysis. The pyramid decomposition scheme is established based on such a generalized multiresol- -ution structure.

scholarly journals New self-dual codes from $ 2 \times 2 $ block circulant matrices, group rings and neighbours of neighbours

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Joe Gildea ◽  
Abidin Kaya ◽  
Adam Michael Roberts ◽  
Rhian Taylor ◽  
Alexander Tylyshchak
Keyword(s):  
Circulant Matrix ◽  
Circulant Matrices ◽  
Group Rings ◽  
Unique Combination ◽  
Dual Codes ◽  
Construction Of Self ◽  
New Construction

<p style='text-indent:20px;'>In this paper, we construct new self-dual codes from a construction that involves a unique combination; <inline-formula><tex-math id="M1">\begin{document}$ 2 \times 2 $\end{document}</tex-math></inline-formula> block circulant matrices, group rings and a reverse circulant matrix. There are certain conditions, specified in this paper, where this new construction yields self-dual codes. The theory is supported by the construction of self-dual codes over the rings <inline-formula><tex-math id="M2">\begin{document}$ \mathbb{F}_2 $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M3">\begin{document}$ \mathbb{F}_2+u \mathbb{F}_2 $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M4">\begin{document}$ \mathbb{F}_4+u \mathbb{F}_4 $\end{document}</tex-math></inline-formula>. Using extensions and neighbours of codes, we construct <inline-formula><tex-math id="M5">\begin{document}$ 32 $\end{document}</tex-math></inline-formula> new self-dual codes of length <inline-formula><tex-math id="M6">\begin{document}$ 68 $\end{document}</tex-math></inline-formula>. We construct 48 new best known singly-even self-dual codes of length 96.</p>

Sign in / Sign up

Export Citation Format

Share Document