Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, June 1990. / Thesis Advisor(s): Loomis, Herschel H. ; Yang, Chyan. "June 1990." Description based on title screen as viewed on March 23, 2010. DTIC Identifier(s): Pipelines, Computer Aided Design, Compiler, Theses, Multiplication, Digital Systems. Author(s) subject terms: Silicon Compiler, Pipeline, Digital Multiplier. Includes bibliographical references (p. 93). Also available in print.

Thesis (Ed. D.)--Graduate School of Education, Oral Roberts University, 2005. / Includes abstract and vita. Includes bibliographical references (leaves 86-94).

No description available.

Lehr (1991) proved that, if M(q, r) denotes the set of real numbers whose expansion in base-r is q-automatic i.e., is recognized by an automaton A = (Aq, Ar, ao, δ, φ) (or is the image under a letter to letter morphism of a fixed point of a substitution of constant length q) then M(q, r) is closed under addition and rational multiplication. Similarly if we let M(r) denote the set of real numbers α whose base-r digit expansion is ultimately primitive substitutive, i.e., contains a tail which is the image (under a letter to letter morphism) of a fixed point of a primitive substitution then in an attempt to generalize Lehr's result we show that the set M(r) is closed under multiplication by rational numbers. We also show that M(r) is not closed under addition.

La première partie de cette thèse est dévolue à l'étude d'une conjecture combinatoire dont la validité assure l'existence de familles infinies de fonctions booléennes dotées de propriétés cryptographiques intéressantes. Quoique particulièrement innocente au premier abord, la validité de cette conjecture reste un problème ouvert. Néanmoins, l'auteur espère que les résultats théoriques et expérimentaux présentés ici permettront au lecteur d'acquérir un tant soit peu de familiarité avec la conjecture. Dans la seconde partie de ce manuscrit, des liens entre fonctions (hyper-)courbes -- une classe particulière de fonctions booléennes --, sommes exponentielles et courbes (hyper)elliptiques sont présentés. Les fonctions (hyper-)courbes sont en effet particulièrement difficiles à classifier et à construire. L'étude des liens mentionnés ci-dessus permet de résoudre de façon élégante des problèmes d'ordre tout aussi bien théorique que pratique. La troisième et dernière partie pousse plus avant l'étude des courbes (hyper)elliptiques d'un point de vue sensiblement différent. De nombreuses constructions cryptographiques reposent en effet sur l'utilisation de classes particulières de telles courbes qui ne peuvent être construites en utilisant des méthodes classiques. Cependant, la méthode CM permet de donner une réponse positive à ce problème. Les polynômes de classes sont des objets fondamentaux de cette méthode. Habituellement, leur construction n'est envisagée que pour des ordres maximaux. La modeste contribution de l'auteur est d'expliciter comment une telle construction -- la méthode analytique complexe -- s'étend aux ordres non-maximaux.

The purpose of this study was to design games by referring to multiplication and division units, then through a pilot test and modification and integrating modified games in mathematics teaching for elementary third graders, so as to investigate the performance and learning attitude of students and to analyze the advantages and disadvantages in the teaching processes. Results indicated that the children made progress in multiplication and division computation and behaved positively on learning attitude. Meanwhile, the cooperation and team spirit were enhanced and a closed and warm relationship between teachers and students was established. In the end, regarding the curriculum and activities design, the researcher made some recommendations. They are: integration of life experience of children, blend into various characteristics of games, good control of classroom order and time. The above results yielded instructional implications for teachers who consider integrating games into mathematics instruction for elementary school children in future.

This thesis is devoted to efficient VHDL design of Systolic Array Architecture for Polynomial GF(2^m) multiplication. The hardware implements the Processor Elements(PE) and Systolic Array design for Progressive Product Reduction (PPR) method proposed by Gebali and Atef. The experiment first implements a simpler irreducible polynomials GF(2^5) based on the defined algorithms for PPR in order to confirm the functionality of the design and then tries the bigger value of m for GF(2^133) and GF(2^233), recommended by NIST. The thesis is comparing the three designs based on their power consumption, Maximum Data path delay and device utilization. It also looking in to the different optimization method for the designs and recommends a design optimization based on circuit modification. / Graduate / 0544 / alinia@uvic.ca

Doctor of Philosophy / The Hecke character of an abelian variety A/F is an isogeny invariant and the Galois action is such that A is isogenous to its Galois conjugate A^σ if and only if the corresponding Hecke character is fixed by σ. The quadratic twist of A by an extension L/F corresponds to multiplication of the associated Hecke characters. This leads us to investigate the Galois groups of families of quadratic extensions L/F with restricted ramification which are normal over a given subfield k of F. Our most detailed results are given for the case where k is the field of rational numbers and F is a field of definition for an elliptic curve with complex multiplication by K. In this case the groups which occur as Gal(L/K) are closely related to the 4-torsion of the class group of K. We analyze the structure of the local unit groups of quadratic fields to find conditions for the existence of curves with good reduction everywhere. After discussing the question of finding models for curves of a given Hecke character, we use twists by 3-torsion points to give an algorithm for constructing models of curves with known Hecke character and good reduction outside 3. The endomorphism algebra of the Weil restriction of an abelian variety A may be determined from the Grössencharacter of A. We describe the computation of these algebras and give examples in which A has dimension 1 or 2 and its Weil restriction has simple abelian subvarieties of dimension ranging between 2 and 24.

Doctor of Philosophy / The Hecke character of an abelian variety A/F is an isogeny invariant and the Galois action is such that A is isogenous to its Galois conjugate A^σ if and only if the corresponding Hecke character is fixed by σ. The quadratic twist of A by an extension L/F corresponds to multiplication of the associated Hecke characters. This leads us to investigate the Galois groups of families of quadratic extensions L/F with restricted ramification which are normal over a given subfield k of F. Our most detailed results are given for the case where k is the field of rational numbers and F is a field of definition for an elliptic curve with complex multiplication by K. In this case the groups which occur as Gal(L/K) are closely related to the 4-torsion of the class group of K. We analyze the structure of the local unit groups of quadratic fields to find conditions for the existence of curves with good reduction everywhere. After discussing the question of finding models for curves of a given Hecke character, we use twists by 3-torsion points to give an algorithm for constructing models of curves with known Hecke character and good reduction outside 3. The endomorphism algebra of the Weil restriction of an abelian variety A may be determined from the Grössencharacter of A. We describe the computation of these algebras and give examples in which A has dimension 1 or 2 and its Weil restriction has simple abelian subvarieties of dimension ranging between 2 and 24.

Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.