Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 23 for “"Circulant matrices"”.

  1. Properties of circulant matrices

    … a study of the properties of a special class of matrices called circulants. Four types of circulants will be investigated : regular, symmetric regular, symmetric, and skew circulants.</p> <p>Chapter 1 introduces and discusses regular circulants.</p> <p>Chapter 2 deals primarily with the …

    ut-knoxville Repository record for Properties of circulant matrices (opens in a new tab)

  2. Construction of the orthogonal groups of n x n circulant matrices over finite fields

    … p$ prime. Let ${\cal M}$ be the algebra of n x n circulant matrices over F. The set $O\sb{(n,q)}$ of orthogonal n x n circulant matrices is a subgroup of ${\cal M}\sp\times.$ The major purposes of the thesis are: (1) to explain K. A. Byrd and T. P. Vaughan's results stated in (8), about formulas …

    concordia Download PDF for Construction of the orthogonal groups of n x n circulant matrices over finite fields (opens in a new tab)

  3. On orthogonal matrices

    … thesis is to study and search for orthogonal matrices which have a certain kind of block structure. The most desirable class of matrices for our purpose are orthogonal designs constructible from 16 circulant matrices. In studying these matrices, we show that the OD (12;1,1,1,9) is the only …

    lethbridge Repository record for On orthogonal matrices (opens in a new tab)

  4. Affine equivalence and constructions of cryptographically strong Boolean functions

    … MRS Boolean functions and their relationship to circulant matrices over the binary field F2 and regular graphs. We first establish a relationship between generalized inverses of circulant matrices in F2 and their generating polynomials. We then apply the relationship to gain insight into …

    nps Repository record for Affine equivalence and constructions of cryptographically strong Boolean functions (opens in a new tab)

  5. Amicable T-matrices and applications

    Our main aim in this thesis is to produce new T-matrices from the set of existing T-matrices. In Theorem 4.3 a multiplication method is introduced to generate new T-matrices of order st, provided that there are some specially structured T-matrices of orders s and t. A class of properly amicable and …

    lethbridge Repository record for Amicable T-matrices and applications (opens in a new tab)

  6. Some Problems on Products of Random Matrices

    … concerned with weak convergence in stochastic matrices and circulant matrices, respectively, and the third is concerned with the numerical calculation of the Lyapunov exponent associated with some random Fibonacci sequences. Stochastic matrices are nonnegative matrices whose row sums are all …

    usf Repository record for Some Problems on Products of Random Matrices (opens in a new tab)

  7. Partial Desingularization Preserving Normal Crossings and Minimal Singularities in Low Dimension

    … in N are described using determinants of circulant matrices (coming from permutation matrices of cyclic groups). Key tools include splitting lemmas, cleaning sequences, and an algorithm for simplifying limits of singularities in neighbourhoods of points in circulant normal form. As a first …

    toronto-retro Repository record for Partial Desingularization Preserving Normal Crossings and Minimal Singularities in Low Dimension (opens in a new tab)

  8. Codes over Rings, Their Generic Decoding and Their Use in Code-Based Cryptography

    … as BIKE and HQC) address this by making use of circulant matrices. These matrices are determined by their first row and thus require much less memory than a random matrix of the same size. They also have convenient algebraic properties as circulant matrices of size $r$ over a field $\mathbb{F}$ …

    zurich

  9. Experimental and Numerical Investigations of Novel Architectures Applied to Compressive Imaging Systems

    … a novel sensing architecture that uses partial circulant matrices as sensing matrices, which results in a simplified, more robust imaging system. The results of these imaging experiments lead to questions about the performance and fundamental nature of sparse signal recovery with partial …

    rice Repository record for Experimental and Numerical Investigations of Novel Architectures Applied to Compressive Imaging Systems (opens in a new tab)

  10. Amicable matrices and orthogonal designs

    … we construct an infinite class of amicable T-matrices of order n=p^r+1 in association with negacirculant weighing matrices W(n,n-1). In particular, for p^r≡1 (mod 4) we construct amicable T-matrices of order n≡2 (mod 4) and application of these matrices allows us to generate infinite class of …

    lethbridge Repository record for Amicable matrices and orthogonal designs (opens in a new tab)

  11. Correlation Minimizing Frames

    … correlation minimizing (N,d)-frames, we consider circulant matrices which are also projections as the Grammian matrix of a uniform Parseval frame. We derive a relationship between these Grammian matrices and the Dirichelet kernel as well as the structure of quadratic residue. Utilizing these …

    houston Repository record for Correlation Minimizing Frames (opens in a new tab)

  12. Gravitation effects on centrifugal pendulum vibration absorbers linear analysis

    … analysis tools for symmetric systems, namely circulant matrices, to investigate the linearized version of the model. A mathematical model is developed using Lagrange’s equations for a disk rotating abouta fixed horizontal axis and N point masses cyclically arranged on the rotor that can move …

    msu Repository record for Gravitation effects on centrifugal pendulum vibration absorbers linear analysis (opens in a new tab)

  13. Co-Designing Model Compression Algorithms and Hardware Accelerators for Efficient Deep Learning

    … how low-precision quantization and structured matrices can improve the performance and energy efficiency of DNNs running on specialized accelerators. We co-design both the DNN compression algorithms and the accelerator architectures, enabling us to evaluate the impact of our ideas on real …

    cornell Repository record for Co-Designing Model Compression Algorithms and Hardware Accelerators for Efficient Deep Learning (opens in a new tab)

  14. Model predictive control for multiple cross-directional processes : analysis, tuning, and implementation

    … model can be effectively reduced by wavelet matrices based on a modified wavelet packet method. The reduced model captures the controllable spatial components of CD processes. After model reduction, MPC based on the reduced model is implemented in the wavelet domain. Meanwhile, the …

    ubc Repository record for Model predictive control for multiple cross-directional processes : analysis, tuning, and implementation (opens in a new tab) Download PDF for Model predictive control for multiple cross-directional processes : analysis, tuning, and implementation (opens in a new tab)

  15. Combinatorially Thin Trees and Spectrally Thin Trees in Structured Graphs

    … matrix where $\L_G$ and $\L_T$ are Laplacian matrices of $G$ and $T$. Additionally, we define $\theta_G$ to be the minimum value of $\theta_{G}(T)$ over all spanning trees $T$ of $G$. Similar to combinatorial thinness and connectivity, $\theta_{G}(T)$ can be lower bounded by the maximum …

    waterloo Repository record for Combinatorially Thin Trees and Spectrally Thin Trees in Structured Graphs (opens in a new tab)

  16. A Study Of Linear Error Correcting Codes

    … It is shown that by exploiting the structure of circulant matrices, the number of codewords required, to compute the minimum Hamming distance and the number of codewords of a given Hamming weight of binary double-circulant codes based on primes, may be reduced. A means of independently verifying …

    plymouth Repository record for A Study Of Linear Error Correcting Codes (opens in a new tab)

  17. A direct-adjoint framework for stability and sensitivity analyses of turbomachinery aeroacoustics

    … of isolated airfoils. The theory of block-circulant matrices is then detailed and exploited to achieve computationally efficient decompositions of the governing system matrices, and the previous global stability analysis reproduced with ten passages per period window. An increase in linear …

    oxford Repository record for A direct-adjoint framework for stability and sensitivity analyses of turbomachinery aeroacoustics (opens in a new tab)

  18. Square-Wave-Based Systems: Theory, Application and Implementation

    … which exploits the properties of the skew circulant matrices. A proof-of-concept version and a subsequent version which has been improved are presented. It considers the process variations that affect the precision of the irrational weights, and applies calibration techniques to alleviate …

    tamu Repository record for Square-Wave-Based Systems: Theory, Application and Implementation (opens in a new tab)

  19. Subspace approximation on the continuum

    … the individual eigenvalue estimates for Toeplitz matrices by circulant matrices; and (vi) analysis of the eigenvalue distribution of time-frequency limiting operators on locally compact abelian groups.

    colo-mines Repository record for Subspace approximation on the continuum (opens in a new tab)

Page 1 of 2