Electrical and Computer Engineering Commons^™

A New Approach To The Optimal Filtering Of Differential Phase Measurements Of Gps Signal In The Precision Survey, Shengan Wang

Dissertations and Theses

The Global Positioning System (GPS) has become popular research and application interests in surveying and many other areas. Nowadays, the accuracy of the Differential GPS can easily reach the order of a few meters. Yet, there are still many ways to exploit the GPS system signal carrier to improve the accuracy to less than meter level. In this thesis, a new approach to improve the accuracy to less than meter level is presented while the observer is in the dynamic situation. In order to reach the sub-meter accuracy, we measure on the carrier phase difference (The L1 carrier frequency is …

Detection And Location Of Pipe Damage By Artificial-Neural-Netprocessed Moire Error Maps, Barry G. Grossman, Frank S. Gonzalez, Joel H. Blatt, Scott Christian Cahall

Electrical Engineering and Computer Science Faculty Publications

A novel automated inspection technique to recognize, locate, and quantify damage is developed. This technique is based on two already existing technologies: video moire metrology and artificial neural networks. Contour maps generated by video moire techniques provide an accurate description of surface structure that can then be automated by means of neutral networks. Artificial neural networks offer an attractive solution to the automated interpretation problem because they can generalize from the learned samples and provide an intelligent response for similar patterns having missing or noisy data. Two dimensional video moire images of pipes with dents of different depths, at several …

Designing And Simulating A Multistage Sampling Rate Conversion System Using A Set Of Pc Programs, David Joseph Hagerty

Dissertations and Theses

The thesis covers a series of PC programs that we have written that will enable users to easily design FIR linear phase lowpass digital filters and multistage sampling rate conversion systems. The first program is a rewrite of the McClellan-Parks computer program with some slight modifications. The second program uses an algorithm proposed by Rabiner that determines the length of a lowpass digital filter. Rabiner used a formula proposed by Herrmann et al. to initially estimate the filter length in his algorithm. The formula, however, assumes unity gain. We present a modification to the formula so that the gain of …

Minimum Separation For Single-Layer Channel Routing, Ronald I. Greenberg, F. Miller Maley

Computer Science: Faculty Publications and Other Works

We present a linear-time algorithm for determining the minimum height of a single-layer routing channel. The algorithm handles single-sided connections and multiterminal nets. It yields a simple routability test for single-layer switchboxes, correcting an error in the literature.

Practical Constraints Pertinent To The Design Of Neural Networks, Said Sadek Abdallah, Rufus H. Cofer

Electrical Engineering and Computer Science Faculty Publications

in designing a feedforward neural network for numerical computation using the backpropagation algorithm it is essential to know that the resulting network has a practical global minimum, meaning that convergence to a stationary solution can be achieved in reasonable time and using a network of reasonable size. This is in contrast to theoretical results indicating that any square-integrable (L2) function can be computed assuming that an unlimited number of neurons are available. A class of problems is discussed that does not fit into this category. Although these problems are conceptually simple, it is shown that in practice convergence to a …

Comparing Techniques Of Mapping Pyramid Algorithms Onto The Hypercube : A Case Study For The Connection Machine, Muhammad Ali Siddiqui

Theses

The pyramid structure is most widely used for low-level and intermediate-level image processing and computer vision because of its efficient support of both local and global operations. However, the cost of pyramid computers (PC) may be very high. They also do not support the efficient implementation of the majority of the scientific algorithms. In contrast, the hypercube network has widely been used in the field of parallel processing because it offers a high degree of fault tolerance, a small diameter and rich interconnection structure that permits fast communication at a reasonable cost. Thus, several algorithms have been developed for the …

Hybrid Clamping In Ntsc Digital Video Equipment, Norman R. Cox, Douglas William Irwin

Electrical and Computer Engineering Faculty Research & Creative Works

Two algorithms that are suitable for deriving the blanking level of a National Television Systems Committee (NTSC) composite video signal are described. One method consists of averaging digitized color-burst samples taken from successive scan lines. A second method involves processing a group of samples taken from a single burst interval. Either algorithm used in a hybrid clamping arrangement results in automatic drift compensation and the ability to tie the back porch or sync tip to a predetermined digital output code. This aids in matching the analog signal to the input of the analog-to-signal (A/D) converter for maximum signal-to-noise ratio (SNR). …

Performance Analysis Of Doa Estimation Algorithms Using Physical Parameters, Hui Liu

Dissertations and Theses

Analytical performance analysis on Direction-Of-Arrival (DOA) estimation algorithms has attracted much excellent research in recent years, various statistical properties have been revealed. However, in most of these analyses, insights of the performance were masked because of the involvement of singular values and singular vectors which depend on the character of the algorithms and data structures in a complex and nonlinear manner.

Realization Of High-Speed Carry Propagation For Addition And Multiplication Using The Redundant Binary System On The Mesh And Hypercube Connected Structures, Anil Rana

Theses

The extensive development of large-scale digital computers has naturally been accompanied by a corresponding development of techniques for fast arithmetic operations. Addition is the basis for the majority of the other arithmetic operations and most of the required time is due to carry propagation delay. Various algorithms have been proposed for fast addition and multiplication. The algorithms proposed here use the redundant binary system and are designed for the mesh structure. The algorithms are very efficient for the addition and multiplication of long operands. The algorithms can also be implemented on the hypercube. The n-dimensional hypercube is a highly concurrent …

Fast Arithmetic Operations On The Hypercube Using Conditional Sum Addition And Modified Booth's Algorithm, Umar Bin Iftikhar

Theses

Algorithms for fast arithmetic operations (i.e., addition and multiplication) on the hypercube computer are presented. The hypercube network of dimension d interconnects N = 2^d processors in such a way that each processor is directly connected to d neighboring processors; m order to communicate between processors, the maximum length of the path is d. The addition algorithm is based on the conditional sum technique. The computational time using this algorithm is O(log₂ N+q) where q is the number of the bits per processor in the hypercube of N processors. Operands of size N*q are distributed among the hypercube …

An Alternative Algorithm For Discrete-Time Filtering, Frederick H. Zeitz Iii

Theses and Dissertations

The discrete-time Kalman filter is a conditional mean estimator of the states of a linear stochastic process, conditioned on the previous state and current measurements. It assumes that the states and noise inputs can be represented as jointly Gaussian random variables. The influence diagram is a decision analysis tool. Under certain conditions, it can represent continuous, jointly Gaussian random variables. The conditioning order of the random variables may be changed (using Bayes' rule) so that any random variable can be conditioned on any other subset of random variables in the diagram. Under these conditions, an influence diagram can represent the …

The Theory Of Bootstrapped Algorithms And Their Applications To Cross Polarization Interference Cancelation, Abdulkadir Dinc

Dissertations

Dual-polarized transmission has become an important method for frequency re-use, particularly in satellite and microwave radio communication. Nevertheless, cross-polarization interference, which is inherent to this method, may cause degradation in system performance.

Different canceler [sic] structures have been proposed to mitigate the effect of cross-polarization. Among these are the diagonalizer, the least mean square (LMS) canceler [sic] and the bootstrapped cancelers [sic]. Bootstrapped canceler [sic] schemes have been proposed and implemented in different applications, such as satellites, tactical communications, and quadrature amplitude madulation [sic] (QAM) dual polarized microwave radio. Nevertheless, no attempt was made in the past to quantify the …

An Effective Cube Comparison Method For Discrete Spectral Transformations Of Logic Functions, Ingo SchäFer

Dissertations and Theses

Spectral methods have been used for many applications in digital logic design, digital signal processing and telecommunications. In digital logic design they are implemented for testing of logical networks, multiplexer-based logic synthesis, signal processing, image processing and pattern analysis. New developments of more efficient algorithms for spectral transformations (Rademacher-Walsh, Generalized Reed-Muller, Adding, Arithmetic, multiple-valued Walsh and multiple-valued Generalized Reed- Muller) their implementation and applications will be described.

Investigation Of Techniques For High Speed Cmos Arbitrary Waveform Generation, Albert Henry Nehl

Dissertations and Theses

Today a growing number of applications in design engineering, production and environmental testing, and system service require specific analog waveforms and digital patterns. Such requirements are neither satisfactorily nor easily met by the use of standard function or single purpose, custom generators.

Traditional methods of waveform generation suffer from undesirable complexity or mediocre performance and are otherwise limited. For the majority of arbitrary waveform generation applications, including medical engineering, modal analysis and electronic engineering, direct digital synthesis techniques are satisfactory. Direct digital synthesis, based generally on periodic retrieval of predetermined amplitude values, may be used to generate such waveforms. Within …

Endless State-Of-Polarization Control For Coherent Optical Communication Systems Using Nematic Liquid Crystal, Scott H. Rumbaugh

Dissertations and Theses

One of the obstacles to coherent fiber-optic communications is the unpredictable polarization drift which necessitates the use of an active polarization controlling system to match the polarizations of the signal and local oscillator. The polarization match must be maintained during the reset of any of the finite range components to prevent loss of data. We present a novel and practical system which uses three liquid crystal devices for the polarization matching process. Also, the required reset control algorithm and its derivation are described in detail.

Evaluation Of Sorting Algorithm Performance On Single Instruction Multiple Data Machines, Dong Kuen Yang

Theses

Partitioning an application program into several tasks and executing them via parallel processing is one way to increase computation throughput and performance. But with a uniprocessor system, the performance increase will be minimal. Computer scientists have developed several multiprocessor systems to gain more speed in computation.

There are several computer architectures, such as pipeline machines, array processors and multiprocessor systems. They provide a parallel execution environment to increase the execution speed. But as the system becomes more complex, the communication traffic density between several processors increases more heavily. It has to provide some kind of control algorithm or routing function …

Effects Of N>M Clos Networks On Edge Coloring And Matrix Decomposition Algorithms, Ming-Hsing Lin

Theses

Considered in this thesis are n > m Clos networks on edge coloring and matrix decomposition algorithms. This work uses a two-fold approach to examine the effects of n > m Clos networks on edge coloring and matrix decomposition algorithms. First, edge coloring and matching on bipartite multigraphs are applied to routing on Clos networks. It is demonstrated that edge coloring algorithms which find a minimum edge coloring set up the routing for n > m Clos networks with redundancy. The results presented here indicate that the Euler coloring algorithm has applications on n > m Clos networks because it has fast time complexity …

Invariant Pattern Recognition Algorithm Using The Hough Transform, Duwang Li

Dissertations and Theses

A new algorithm is proposed which uses the Hough Transform to recognize two dimensional objects independent of their orientations, sizes and locations. The binary image of an object is represented by a set of straight lines. Features of the straight lines, namely the lengths and the angles of their normals, their lengths and the end point positions are extracted using the Hough Transform. A data structure for the extracted lines is constructed so that it is efficient to match the features of the lines of one object to those of another object, and determine if one object is a rotated …

Performance Modeling And Enhancement For The Atamm Data Flow Architecture, Sukhamoy Som

Electrical & Computer Engineering Theses & Dissertations

Algorithm To Architecture Mapping Model (ATAMM) is a new marked graph model from which the rules for data and control flow in a homogeneous, multicomputer, data flow architecture may be defined. This research is concerned with performance modeling and performance enhancement for periodic execution of large-grain, decision-free algorithms in such an ATAMM defined architecture. Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of computing element requirements. Operating strategies are developed for optimum time performance and for sub-optimum time performance under limited availability of computing elements. An ATAMM simulator is used to test …

Implementing Ray Tracing Algorithm In Parallel Environment, Tjah Jadi

Dissertations and Theses

Ray tracing is a very popular rendering algorithm in the field of computer graphics because it can generate highly-realistic images from three-dimensional models. Unfortunately, the computational cost is very expensive. To speed up the rendering process we present both static and dynamic scheduling (balancing) strategies for a multiprocessor system. Hence, the load balancing among the processors is the most important problem in parallel processing. The implementation of the algorithm is based on a modified octree structure.

A New General Purpose Systolic Array For Matrix Computations, Hai Van Dinh Le

Dissertations and Theses

In this thesis, we propose a new systolic architecture which is based on the Faddeev's algorithm. Because Faddeev's algorithm is inherently general purpose, our architecture is able to perform a wide class of matrix computations. And since the architecture is systolic based, it brings massive parallelism to all of its computations. As a result, many matrix operations including addition, multiplication, inversion, LU-decomposition, transpose, and solutions to linear systems of equations can now be performed extremely fast. In addition, our design introduces several concepts which are new to systolic architectures:

- It can be re-configured during run time to perform different …

Implementation And Performance Analysis Of Numerical Algorithms On The Mpp, Flex/32, And Cray/2, Raad A. Fatoohi

Electrical & Computer Engineering Theses & Dissertations

This dissertation presents the results of the implementation of a number of numerical algorithms on three parallel/vector computers. The object of this research is to determine how well, or poorly, a number of numerical algorithms would map onto three different architectures and to analyze the performance of these architectures using these algorithms. These algorithms are: a relaxation scheme for the solution of the Cauchy-Riemann equations, an ADI method for the solution of the diffusion equation, and a compact difference scheme for the solution of two-dimensional Navier-Stokes equations. The computers were chosen so as to encompass a variety of architectures. They …

Realization And Implementation Of A Recursive Digital Convolution Algorithm In Cmos, Lik Tang Cheng

Theses

This thesis describes the implementation of a digital convolver. A recursive digital convolution algorithm was realised and implemented by using CMOS circuitry. This thesis also gives a technical overview of current CMOS processing technologies as well as various novel CMOS logic circuit techniques.

Two New Parallel Processors For Real Time Classification Of 3-D Moving Objects And Quad Tree Generation, Farjam Majd

Dissertations and Theses

Two related image processing problems are addressed in this thesis. First, the problem of identification of 3-D objects in real time is explored. An algorithm to solve this problem and a hardware system for parallel implementation of this algorithm are proposed. The classification scheme is based on the "Invariant Numerical Shape Modeling" (INSM) algorithm originally developed for 2-D pattern recognition such as alphanumeric characters. This algorithm is then extended to 3-D and is used for general 3-D object identification. The hardware system is an SIMD parallel processor, designed in bit slice fashion for expandability. It consists of a library of …

Algorithms For The Solution Of Systems Of Coupled Second-Order Ordinary Differential Equations, Brendan O'Shea

Articles

Several step-by-step methods for the computer solution systems of coupled second-order ordinary differential equations, are examined from the point of view of efficiency “time-wise” and “storage-wise”. Particular reference is made to a system arising in the close-coupling approximation of the Schroedinger equation. The stability of the solution is also considered.

An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim

Electrical & Computer Engineering Theses & Dissertations

The matrix transformation relating the sequency and frequency domains is derived. It is shown that these­ frequency-to-frequency conversion can be performed via a computationally efficient sparse matrix algorithm. The sequency-to-frequency algorithm can be used with a fast Hadamard transform to implement a discrete Fourier trans­ form. The efficiencies of this combined algorithm and a radix-two fast Fourier transform are compared.

The algorithm is applied to the sequency domain de­ sign of a Wiener digital filter. Improved computational efficiencies are achieved relative to the procedure de­veloped by Kahveci and Hall (9).

Application Of Numerical Analysis To Root Locus Design Of Feedback Control Systems, Steve William Justice

Dissertations and Theses

Many practical problems in the field of engineering become so complex that they may be effectively solved only with the aid of a computer. An effective solution depends on the use of an efficient algorithm. Plotting root locus diagrams is such a problem. This thesis presents such an algorithm.

Root locus design of feedback control systems is a very powerful tool. Stability of systems under the influence of variables can be easily determined from the root locus diagram. For even moderately complex systems of the type found in practical applications, determination of the locus is extremely difficult if accuracy is …