Search Constraints

Start Over
Filtering by: Creator Ramos, V. A. Remove constraint Creator: Ramos, V. A. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella Rights Statement Copyright Not Evaluated Remove constraint Rights Statement: Copyright Not Evaluated

Search Results

  • A pipelined baseband digital predistortion architecture for RF amplifier linearization

    Creator:
    Xu, Xiangqing
    Abstract:
    This thesis describes the design of a baseband digital predistortion architecture for radio frequency (RF) amplifier linearization. Existing amplifier linearization techniques are first examined. The nonlinearity of an amplifier can be characterized as amplitude-to-amplitude distortion and amplitude-to-phase distortion. The distortion can be corrected by providing a predistorted driver signal (both...
    Resource Type:
    Masters Thesis
    Full Text:
    A pipelined baseband digital predistortion architecture for RF

  • LacEDAemon : a programming environment for the multiparadigm language leda

    Creator:
    Pandey, Rajeev K.
    Abstract:
    Multiparadigm programming languages are a recent development in the realm of programming languages. A multiparadigm programming language allows the use of multiple, differing programming paradigms without departing from a single, unified linguistic framework. Multiparadigm programming languages are claimed to have benefits to both pedagogy and complex application creation. The beneficial...
    Resource Type:
    Dissertation
    Full Text:
    Doctor of Philosophy in Computer Science presented on August 28, 1998. Title: LacEDAemon: A Programming

  • Electra : integrating constraints, condition-based dispatching, and features exclusion into the multiparadigm language Leda

    Creator:
    Zamel, Nabil M.
    Abstract:
    Multiparadigm languages are languages that are designed to support more than one style of programming. Leda is a strongly-typed multiparadigm programming language that supports imperative, functional, object-oriented, and logic programming. The constraint programming paradigm is a declarative style of programming where the programmer is able to state relationships among some...
    Resource Type:
    Dissertation
    Full Text:
    (CLP). A constraint-satisfaction problem can be described as a 3-tuple (V, D, C). Where V is a set

  • Cluster partitioning approaches to parallel Monte Carlo simulation on multiprocessors

    Creator:
    Ranawake, Udaya A.
    Abstract:
    We consider the parallelization of Monte Carlo algorithms for analyzing numerical models of charge transport used in semiconductor device physics. Parallel algorithms for the standard k-space Monte Carlo simulation of a three band model of bulk GaAs on hypercube multicomputers are first presented. This Monte Carlo model includes scattering due...
    Resource Type:
    Dissertation
    Full Text:
    represented by a task graph G(V, E) an undirected graph whose vertices, V = {0, 1, . . . , N 1}, represent

  • A multiprocessor node for communication and control

    Creator:
    Atluri, Venkata Ram
    Abstract:
    This paper describes the design and implementation of "A multiprocessor node for communication and control" (MPCC). MPCC is a high speed, high performance local area network capable of performing real time control tasks. This is achieved by the concurrent operation of two 8051 microcontrollers, a dual port RAM and the...
    Resource Type:
    Masters Thesis
    Full Text:
    A multiprocessor node for communication and control AN

  • A study of model-based average reward reinforcement learning

    Creator:
    Ok, DoKyeong
    Abstract:
    Reinforcement Learning (RL) is the study of learning agents that improve their performance from rewards and punishments. Most reinforcement learning methods optimize the discounted total reward received by an agent, while, in many domains, the natural criterion is to optimize the average reward per time step. In this thesis, we...
    Resource Type:
    Dissertation
    Full Text:
    A study of model-based average reward reinforcement learning

  • A programmable system scheduler for control oriented local area networks (COLAN)

    Creator:
    Lim, Choo-chiang
    Abstract:
    The Control-Oriented Local Area Network (COLAN) is a distributed control system for a series of networked microcontrollers, which has been under development at Oregon State University since 1986. A reliable master controller, functioning both as a task scheduler and as a network controller, is required to allow users to perform...
    Resource Type:
    Masters Thesis
    Full Text:
    [THYE 88], and COLAN V [KUMA 89]. Each of these systems utilizes a different approach to the

  • A programmable network interface unit for hybrid meshnet local area networks

    Creator:
    Merchant, Shashank C.
    Abstract:
    A Hybrid Meshnet LAN, a new local area network architecture, has been proposed by Dr. Cheoul-Shin Kang and Dr. James Herzog. It provides for distributed control hybrid architecture which is good for effective load sharing under various local area network environments. Hybrid Meshnet has a dual channel structure, a token...
    Resource Type:
    Masters Thesis
    Full Text:
    A programmable network interface unit for hybrid meshnet

  • Task partitioning and scheduling on arbitrary parallel processing systems

    Creator:
    El-Rewini, Hesham
    Abstract:
    Parallel programming is the major stumbling block preventing the parallel processing industry from quickly satisfying the demand for parallel computer software. This research is aimed at solving some of the problems of software development for parallel computers. ELGDF is a graphical language for designing parallel programs. The goal of ELGDF...
    Resource Type:
    Dissertation
    Full Text:
    software development for parallel computers. ELGDF is a graphical language for designing parallel

  • Scheduling system of affine recurrence equations by means of piecewise affine timing functions

    Creator:
    Mui, Lap K.
    Abstract:
    Many systematic methods exist for mapping algorithms to processor arrays. The algorithm is usually specified as a set of recurrence equations, and the processor arrays are synthesized by finding timing and allocation functions which transform index points in the recurrences into points in a space-time domain. The problem of scheduling...
    Resource Type:
    Masters Thesis
    Full Text:
    Affine Recurrence Equations (SARE) is a set of recurrence equations of the form: U(z) = f[V(I(z