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 546 for “"Multiplication"”.

  1. Frequency Multiplication Circuits

    Made available in DSpace on 2014-12-04T21:03:11Z (GMT). No. of bitstreams: 1 6000242.pdf: 8347134 bytes, checksum: 7d350070c7b9afc32ad5e05aa2f55587 (MD5) Previous issue date: 1959

    uiuc Repository record for Frequency Multiplication Circuits (opens in a new tab)

  2. FPGA Based Matrix Multiplication Accelerator

    The demand for fast matrix multiplication continues to increase due to recent advances in image processing, graphics processing, digital signal processing, and communication over the wireless network. Therefore, the development of a hardware-based matrix multiplication is essential, which is …

    texas-state Repository record for FPGA Based Matrix Multiplication Accelerator (opens in a new tab)

  3. On Multiplication Groups of Quasigroups

    … in a group-like fashion. We then focus on the multiplication groups of quasigroups, which have first appeared in the work of A. A. Albert. These permutation groups allow us to study quasigroups using group theory. We also explore how certain natural operations on quasigroups affect the …

    claremont Repository record for On Multiplication Groups of Quasigroups (opens in a new tab)

  4. Dirichlet Multiplication in Lattice-Point Problems

    Made available in DSpace on 2014-12-05T21:50:08Z (GMT). No. of bitstreams: 1 0023398.pdf: 1969440 bytes, checksum: 07c3467d9c565f75e5a274fd75a7aa9f (MD5) Previous issue date: 1957

    uiuc Repository record for Dirichlet Multiplication in Lattice-Point Problems (opens in a new tab)

  5. Secondary Electron Multiplication in Microwave Field

    Made available in DSpace on 2014-12-04T21:03:08Z (GMT). No. of bitstreams: 1 5904508.pdf: 3943748 bytes, checksum: f4e0e3ce8238eb913d3c9046730729ea (MD5) Previous issue date: 1959

    uiuc Repository record for Secondary Electron Multiplication in Microwave Field (opens in a new tab)

  6. Sparse matrix-vector multiplication by specialization

    … numerical procedure of sparse matrix-vector multiplication, in the case where a single matrix is to be multiplied by many vectors, is explored. The main objective is the evaluation of the speed-ups that can be obtained with program specialization without considering the overheads of the code …

    uiuc Repository record for Sparse matrix-vector multiplication by specialization (opens in a new tab)

  7. Matrix multiplication with Asynchronous Logic Automata

    … achieve performance. In this thesis I use matrix multiplication as a case study to investigate how numerical computation can be performed in this substrate, and how the potential benefits play out in terms of hardware performance estimates. First we take a brief tour of supercomputing today, and …

    mit Repository record for Matrix multiplication with Asynchronous Logic Automata (opens in a new tab)

  8. Techniques for low jitter clock multiplication

    Phase realigning clock multipliers, such as Multiplying Delay-Locked Loops (MDLL), offer significantly reduced random jitter compared to typical Phase-Locked Loops (PLL). This is achieved by introducing the reference signal directly into their voltage controlled oscillators (VCO) to realign the …

    mit Repository record for Techniques for low jitter clock multiplication (opens in a new tab)

  9. On The Parallelization Of Integer Polynomial Multiplication

    … overheads in the implementations. Polynomial multiplication is at the core of many algorithms in symbolic computation such as real root isolation which will be our main application for now. In this thesis, we first investigate the multiplication of dense univariate polynomials with integer …

    uwo Repository record for On The Parallelization Of Integer Polynomial Multiplication (opens in a new tab)

  10. Modular multiplication in the residue number system

    … and hardware architectures for the modular multiplication Z = A × B mod M. This operation is the basis of many public-key cryptosystems including RSA and Elliptic Curve Cryptography. The Residue Number System (RNS) is used to speed up long word length modular multiplication because this …

    adelaide Repository record for Modular multiplication in the residue number system (opens in a new tab)

  11. Generalized and restricted multiplication tables of integers

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2010-06-11T20:10:14Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Koukoulopoulos_Dimitrios.tex: 150989 bytes, checksum: 0478d1ce3b482241f0d7d6d6daf5dde5 (MD5) Koukoulopoulos_Dimitrios.pdf: …

    uiuc Repository record for Generalized and restricted multiplication tables of integers (opens in a new tab)

  12. Autotuning divide-and-conquer matrix-vector multiplication

    … [14] on serial divide-and-conquer matrix-vector multiplication. We implemented Ztune to autotune serial divide-and-conquer matrix-vector multiplication on machines with different hardware configurations, and found that Ztuneoptimized codes ran 1%-5% faster than the hand-optimized counterparts. We …

    mit Repository record for Autotuning divide-and-conquer matrix-vector multiplication (opens in a new tab)

  13. Efficient Binary Field Multiplication on a VLIW DSP

    … cryptography relies extensively on modular multiplication with long operands. We investigate the opportunities to optimize this operation in a heterogeneous multiprocessing platform such as TI OMAP3530. By migrating the long operand modular multiplication from a general-purpose ARM Cortex A8 …

    vt Repository record for Efficient Binary Field Multiplication on a VLIW DSP (opens in a new tab)

  14. Second-generation polyalgorithms for parallel dense-matrix multiplication

    … Anthony Skjellum, includes fourteen dense matrix multiplication algorithms mapped onto two-dimensional process grids using the Message Passing Interface (MPI). This thesis' goal is to achieve optimized performance of parallel, dense linear algebra algorithms by varying the algorithm as a function …

    utc Repository record for Second-generation polyalgorithms for parallel dense-matrix multiplication (opens in a new tab)

  15. Elliptic curves with complex multiplication and {u039B}-structures

    … between elliptic curves with complex multiplication and Lambda structures. Our main result is to show that the moduli stack of elliptic curves with complex multiplication, and the universal elliptic curve with complex multiplication over it, both admit Lambda structures and that the …

    aus-cath Repository record for Elliptic curves with complex multiplication and {u039B}-structures (opens in a new tab)

  16. Elliptic curves with complex multiplication and {u039B}-structures

    … between elliptic curves with complex multiplication and Lambda structures. Our main result is to show that the moduli stack of elliptic curves with complex multiplication, and the universal elliptic curve with complex multiplication over it, both admit Lambda structures and that the …

    anu Repository record for Elliptic curves with complex multiplication and {u039B}-structures (opens in a new tab)

Page 1 of 28