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 53 for “"Computer Arithmetic"”.

  1. Error-Correcting-Codes in Computer Arithmetic

    Made available in DSpace on 2014-12-10T19:07:08Z (GMT). No. of bitstreams: 1 7317303.pdf: 3230254 bytes, checksum: 0224024c93641180a5acace586589d07 (MD5) Previous issue date: 1972

    uiuc Repository record for Error-Correcting-Codes in Computer Arithmetic (opens in a new tab)

  2. Rounding errors in digital computer arithmetic subroutines.

    In this thesis we investigate arithmetic subroutines and round-off procedures. An error analysis of single operations in normalized floating point arithmetic leads us to the construction of an improved form of addition-subtraction subroutine. In addition the properties of several types of round-off …

    ubc Repository record for Rounding errors in digital computer arithmetic subroutines. (opens in a new tab) Download PDF for Rounding errors in digital computer arithmetic subroutines. (opens in a new tab)

  3. Low-cost duplication for separable error detection in computer arithmetic

    Low-cost arithmetic error detection will be necessary in the future to ensure correct and safe system operation. However, current error detection mechanisms for arithmetic either have high area and energy overheads or are complex and offer incomplete protection against errors. Full duplication is …

    texas Repository record for Low-cost duplication for separable error detection in computer arithmetic (opens in a new tab)

  4. An Implementation of the IEEE Standard for Binary Floating-Point Arithmetic for the Motorola 6809 Microprocessor

    … to be an effective system for reliable, accurate computer arithmetic. The standard is implemented as a set of procedures written in Motorola 6809 assembly language. Source listings of the procedures are contained in appendices.

    unt Repository record for An Implementation of the IEEE Standard for Binary Floating-Point Arithmetic for the Motorola 6809 Microprocessor (opens in a new tab)

  5. Digital filters with thinned numerators

    … of coefficient quantization and finite-precision computer arithmetic upon the thinned filter structure are also described. Examples of thinned narrowband, broadband, lowpass, and bandpass filters are given. Several of these thinned filters require fewer than one-third the number of multiplies …

    rice Repository record for Digital filters with thinned numerators (opens in a new tab)

  6. VHDL Implementation and Performance Analysis of two Division Algorithms

    Division is one of the most fundamental arithmetic operations and is used extensively in engineering, scientific, mathematical and cryptographic applications. The implementation of arithmetic operation such as division, is complex and expensive in hardware. Unlike addition and subtraction, division …

    uvic Repository record for VHDL Implementation and Performance Analysis of two Division Algorithms (opens in a new tab)

  7. The testability of regular logic structures

    … iterative logic arrays which are widely used in computer arithmetic hardware. The issues of design-for-testability, built-in self-test as well as automatic test generation for these circuits are discussed. The techniques developed are far more powerful and general than those conceived by previous …

    uiuc Repository record for The testability of regular logic structures (opens in a new tab)

  8. Design of an IEEE double precision floating-point adder/subtractor in GaAs technology

    … fundamental and the simplest operation in any computer arithmetic operation. According to the IEEE 754 Standard Format, the resulting architecture based on the addition/subtraction algorithm is mainly divided into two portions - the exponent and the mantissa. In logic design, there are three …

    adelaide Repository record for Design of an IEEE double precision floating-point adder/subtractor in GaAs technology (opens in a new tab)

  9. Numerical solutions of differential equations on FPGA-enhanced computers

    … (S&E) computation programs on general-purpose computers, one may elect to use faster CPUs, more memory, systems with more efficient (though complicated) architecture, better software compilers, or even coding with assembly languages. With the emergence of Field Programmable Gate Array (FPGA) …

    tamu Repository record for Numerical solutions of differential equations on FPGA-enhanced computers (opens in a new tab)

  10. Efficient VLSI architectures for matrix factorizations

    … the use of CORDIC (Coordinate Rotation Digital Computer) arithmetic for parallel computation of the SVD/eigenvalue decomposition of arbitrary complex/Hermitian matrices using Jacobi-like algorithms on processor arrays. The algorithms and architectures derive from extending the theory of …

    rice Repository record for Efficient VLSI architectures for matrix factorizations (opens in a new tab)

  11. Fused floating-point arithmetic for application specific processors

    Floating-point computer arithmetic units are used for modern-day computers for 2D/3D graphic and scientific applications due to their wider dynamic range than a fixed-point number system with the same word-length. However, the floating-point arithmetic unit has larger area, power consumption, and …

    texas Repository record for Fused floating-point arithmetic for application specific processors (opens in a new tab)

  12. Decimal Floating-point Fused Multiply Add with Redundant Number Systems

    The IEEE standard of decimal floating-point arithmetic was officially released in 2008. The new decimal floating-point (DFP) format and arithmetic can be applied to remedy the conversion error caused by representing decimal floating-point numbers in binary floating-point format and to improve the …

    sask Repository record for Decimal Floating-point Fused Multiply Add with Redundant Number Systems (opens in a new tab)

  13. Improved algorithms for non-restoring division and square root

    This dissertation focuses on improving the non-restoring division and square root algorithm. Although the non-restoring division algorithm is the fastest and has less complexity among other radix-2 digit recurrence division algorithms, there are some possibilities to enhance its performance. To …

    texas Repository record for Improved algorithms for non-restoring division and square root (opens in a new tab)

  14. Improving the Hardware Performance of Arithmetic Circuits using Approximate Computing

    … is especially well-suited for application in arithmetic computing hardware. In this thesis, novel approximate arithmetic architectures are proposed for three different operations, namely multiplication, division, and the multiply accumulate (MAC) operation. For all designs, accuracy is …

    sask Repository record for Improving the Hardware Performance of Arithmetic Circuits using Approximate Computing (opens in a new tab)

  15. A Stream-Based In-Line Allocatable Multiplier for Configurable Computing

    The growing demand for high-performance computing platforms has pushed the computing community to invent new architectures for processors. Recently, researchers have begun to solve the problem by the implementation of Field-Programming Gate Arrays (FPGAs). FPGAs make it possible to implement …

    vt Repository record for A Stream-Based In-Line Allocatable Multiplier for Configurable Computing (opens in a new tab)

  16. A model for minimizing numeric function generator complexity and delay

    … depend on the number of segments required, the arithmetic devices used to approximate the function, and the number of bits used to represent the numbers being calculated. This thesis develops an accurate method to quantify hardware utilization and propagation delay for various NFG configurations …

    nps Repository record for A model for minimizing numeric function generator complexity and delay (opens in a new tab)

Page 1 of 3