The reliability of sequential machines is an important factor in
their design and implementation. In this thesis, stochastic sequential
machine models are employed to investigate some of the problems concerning
the reliability of sequential machines. Two different methods
are used to find the reliability required of individual elements. The
first...
Quotient rings of Gaussian and Eisenstein-Jacobi(EJ) integers can be deployed to construct interconnection networks with good topological properties. In this thesis, we propose deadlock-free deterministic and partially adaptive routing algorithms for hexagonal networks, one special class of EJ networks. Then we discuss higher dimensional Gaussian networks as an alternative to...
This compilation of theses and dissertations (a part of the OSU Bibliographic Series) for the period 1970-1977 reflects this university's emphasis on research and graduate study. It may be viewed as an indicator of the contributions made to the state of Oregon through graduate study and research at Oregon State...
The arithmetic portions of almost all modern processor architectures are of very similar design. We use the term "traditional" to describe this design, the primary characteristics of which are native support for integer and floating-point number types and special disjoint instructions and hardware for each supported type. Decades of refinement...
Routing from a single source node to multiple destination nodes using node disjoint paths (NDP) has many important applications in parallel systems. For example, if a source node wants to send distinct messages to distinct destination nodes, then the one-to-many NDP routing is useful.
Unlike parallel systems with shared-memory, each...
This thesis investigates an implementation of speech recognition front-end. It is an application specific integrated circuit (ASIC) solution. A Mel Cepstrum algorithm is implemented for the feature extraction. We present a new mixed split-radix and radix-2 Fast Fourier Transform (FFT) algorithm, which can effectively minimize the number of complex multiplications...