• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 12
  • 3
  • Tagged with
  • 18
  • 18
  • 4
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Structural properties of Hadamard designs /

Merchant, Eric, January 2005 (has links)
Thesis (Ph. D.)--University of Oregon, 2005. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 58-59). Also available for download via the World Wide Web; free to University of Oregon users.

On the construction of Hadamard matrices

Unknown Date (has links)
"The present paper comprises a survey of investigations undertaken to determine possible values of n for which a Hadamard matrix of order n may be constructed"--Introduction. / "August, 1960." / Typescript. / "Submitted to the Graduate School of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." / Advisor: M. F. Tinsley, Professor Directing Paper. / Includes bibliographical references (leaf 33).

Generating 2f orthogonal arrays.

January 1990 (has links)
by Yuen Wong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1990. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter Chapter 2 --- Basic Results --- p.5 / Chapter §2.1 --- General Results --- p.5 / Chapter §2.2 --- Williamson's Method --- p.8 / Chapter Chapter 3 --- Algorithms And Subroutines --- p.15 / Chapter §3.1 --- Introduction --- p.15 / Chapter §3.2 --- Increasing Determinant Method --- p.15 / Chapter §3.3 --- Williamson's Method - Direct Computation --- p.21 / Chapter §3.4 --- Williamson's Method - Increasing Determinant --- p.26 / Chapter Chapter 4 --- Comparisons And Recommendations On Algorithms --- p.32 / Chapter §4.1 --- Introduction --- p.32 / Chapter §4.2 --- Comparisons And Recommendations On IMPROV(N) --- p.32 / Chapter §4.3 --- Comparisons And Recommendations On GENHA(N) --- p.34 / Chapter §4.4 --- Comparisons And Recommendations On VTID(N) --- p.35 / Chapter §4.5 --- Summary --- p.37 / Chapter Chapter 5 --- Applications Of Hadamard Matrices --- p.38 / Chapter §5.1 --- Hadamard Matrices And Balanced Incomplete Block Designs' --- p.38 / Chapter §5.2 --- Hadamard Matrices And Optimal Weighing Designs --- p.43 / Chapter Chapter 6 --- Conclusion --- p.51 / References --- p.52 / Appendices --- p.53

Finding Hadamard and (epsilon,delta)-Quasi-Hadamard Matrices with Optimization Techniques

Buteau, Samuel January 2016 (has links)
Existence problems (proving that a set is nonempty) abound in mathematics, so we look for generally applicable solutions (such as optimization techniques). To test and improve these techniques, we apply them to the Hadamard Conjecture (proving that Hadamard matrices exist in dimensions divisible by 4), which is a good example to study since Hadamard matrices have interesting applications (communication theory, quantum information theory, experiment design, etc.), are challenging to find, are easily distinguished from other matrices, are known to exist for many dimensions, etc.. In this thesis we study optimization algorithms (Exhaustive search, Hill Climbing, Metropolis, Gradient methods, generalizations thereof, etc.), improve their performance (when using a Graphical Processing Unit), and use them to attempt to find Hadamard matrices (real, and complex). Finally, we give an algorithm to prove non-trivial lower bounds on the Hamming distance between any given matrix with elements in {+1,-1} and the set of Hadamard matrices, then we use this algorithm to study matrices with similar properties to Hadamard matrices, but which are far away (with respect to the Hamming distance) from them.

On orthogonal matrices

Behbahani, Majid, University of Lethbridge. Faculty of Arts and Science January 2004 (has links)
Our main aim in this 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 orthogonal design constructible from 16 circulant matrices of type OD (4n;1,1,1,4n-3), whenever n > 1 is an odd integer. We then use an exhaustive search to show that the only orthogonal design constructible from 16 circulant matrices of order 12 on 4 variables is the OD (12;1,1,1,9). It is known that by using of T-matrices and orthogonal designs constructible from 16 circulant matrices one can produce an infinite family of orthogonal designs. To complement our studies we reproduce and important recent construction of T-matrices by Xia and Xia. We then turn our attention to the applications of orthogonal matices. In some recent works productive regular Hadamard matrices are used to construct many new infinite families of symmetric designs. We show that for each integer n for which 4n is the order of a Hadamard matrix and 8n2 - 1 is a prime, there is a productive regular Hadamard matrix of order 16n2(82-1)2. As a corollary, we get many new infinite classes of symmetric designs whenever either of 4n(8n2-1)-1,4n(82-1) +1 is a prime power. We also review some other constructions of productive regular Hadamard matrices which are related to our work. / iv, 64 leaves : ill., map ; 29 cm.

Cyclic menon difference sets, circulant hadamard matrices and barker sequences

吳堉榕, Ng, Yuk-yung. January 1993 (has links)
published_or_final_version / Mathematics / Master / Master of Philosophy

Amicable T-matrices and applications

Gholamiangonabadi, Hamed January 2012 (has links)
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 double disjoint T-matrices are introduced. A number of properly amicable T-matrices are constructed which includes 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 18, 22. To keep the new matrices disjoint an extra condition is imposed on one set of T-matrices and named double disjoint T-matrices. It is shown that there are some T-matrices that are both double disjoint and properly amicable. Using these matrices an infinite family of new T-matrices are constructed. We then turn our attention to the application of T-matrices to construct orthogonal designs and complex Hadamard matrices. Using T-matrices some orthogonal designs constructed from 16 circulant matrices are constructed. It is known that having T-matrices of order t and orthogonal designs constructible from 16 circulant matrices lead to an infinite family of orthogonal designs. Using amicable T-matrices some complex Hadamard matrices are shown to exist. / iii, 49 leaves ; 29 cm

Cyclic menon difference sets, circulant hadamard matrices and barker sequences /

Ng, Yuk-yung. January 1993 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1994. / Includes bibliographical references (leaves 35-36).

On a construction for menon designs using affine designs

Andreou, Christiana January 2013 (has links)
No description available.

Doppler processing of phase encoded underwater acoustic signals

Eldred, Randy Michael. January 1990 (has links) (PDF)
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, September 1990. / Thesis Advisor(s): Miller, James H. Second Reader: Tummala, Murali. "September 1990." Description based on title screen as viewed on December 17, 2009. DTIC Identifier(s): Acoustic tomography, inverse problems, Fast Hadamard Transforms, theses. Author(s) subject terms: Acoustic tomography, Fast Hadamard Transform, maximal-length sequences, Doppler processing. Includes bibliographical references (p. 95-96). Also available in print.

Page generated in 0.0731 seconds