Search Constraints

Start Over
Filtering by: Creator Cullen, J. J. Remove constraint Creator: Cullen, J. J. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella Resource Type Masters Thesis Remove constraint Resource Type: Masters Thesis

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

  • Porting GCC to X32V architecture

    Creator:
    Venkatachalapathy, Savithri H.
    Abstract:
    This thesis work evaluates the need for a re-configurable cross compiler for the X32V processor architecture and discusses the process of developing a cross compiler for X32V. X32V is a new processor intended at the embedded applications domain whose instruction set is designed based on the widely used MIPS processor....
    Resource Type:
    Masters Thesis

  • 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:
    . [EXAMPLE 1] Consider the SARE: f(i, j) = h(i, i) for i = j f(i, j) = f(i, j 1) for i < j (1.2) 3 f(i

  • Adiabatic Markov Decision Process : convergence of value iteration algorithm

    Creator:
    Duong, Thai
    Abstract:
    Markov Decision Process (MDP) is a well-known framework for devising the optimal decision making strategies under uncertainty. Typically, the decision maker assumes a stationary environment which is characterized by a time-invariant transition probability matrix. However, in many real-world scenarios, this assumption is not justified, thus the optimal strategy might not...
    Resource Type:
    Masters Thesis
    Full Text:
    ) ≤ δdsp(v) where: δd = 1 − mins,u∈S×S ∑ j∈S min{Pd( j|s),Pd( j|u)} Pd is the transition matrix

  • Coordinating secondary-user behaviors for inelastic traffic reward maximization in large-scale DSA networks

    Creator:
    NoroozOliaee, MohammadJavad
    Abstract:
    We develop efficient coordination techniques that support inelastic traffic in large-scale distributed dynamic spectrum access DSA networks. By means of any learning algorithm, the proposed techniques enable DSA users to locate and exploit spectrum opportunities effectively, thereby increasing their achieved throughput (or "rewards" to be more general). Basically, learning algorithms...
    Resource Type:
    Masters Thesis
    Full Text:
    and Sj/Q = 4 for all j = 1, 2, . . . ,m. . . . . . . . 6 2.2 Per-agent average a hieved reward r̄(t

  • Optimizing the advanced encryption standard on Intel's SIMD architecture

    Creator:
    Godbole, Pankaj
    Abstract:
    The Advanced Encryption Standard (AES) is the new standard for cryptography and has gained wide support as a means to secure digital data. Hence, it is beneficial to develop an implementation of AES that has a high throughput. SIMD technology is very effective in increasing the performance of some cryptographic...
    Resource Type:
    Masters Thesis
    Full Text:
    are cyclically shifted over different offsets. This is shown in Figure 3.4. A byte at position j in

  • On error bounds for linear feature extraction

    Creator:
    Thangavelu, Madan Kumar
    Abstract:
    Linear transformation for dimension reduction is a well established problem in the field of machine learning. Due to the numerous observability of parameters and data, processing of the data in its raw form is computationally complex and difficult to visualize. Dimension reduction by means of feature extraction offers a strong...
    Resource Type:
    Masters Thesis
    Full Text:
    Covariance of class i δµij Difference in mean between class i and j 3.2. Linear transformation for

  • Efficient, secure and covert channel capacity bounded protocols for multilevel security cross-domain environments - an experimental system

    Creator:
    Nandakumar Thampi, Archana
    Abstract:
    The communication in MLS cross-domain environments faces many challenges. The three most important challenges are efficient key management, privacy preserving and covert channel. We propose an Efficient, Secure and Covert Channel Capacity Bounded Protocol which has three algorithms that addresses these challenges: The Efficient Attribute-based Fine-Grained Authentication (EAFA) algorithm, Anonymous...
    Resource Type:
    Masters Thesis
    Full Text:
    the product of each pair equals D(N). The key pair can be written in a generalized form as dn− j,d j

  • Cross-layer aware routing approach for lifetime maximization in wireless sensor networks with multiple sinks

    Creator:
    Hamid, Arwa Zakaria
    Abstract:
    In wireless sensor networks (WSNs) nodes are battery powered. Therefore, the available energy resources of sensor nodes should be managed efficiently in order to increase the network lifetime. As a result, researchers have proposed routing schemes in order to maximize network lifetime. Even though these schemes increase the network lifetime,...
    Resource Type:
    Masters Thesis
    Full Text:
    distinct transmitter node and a receiver node (i, j) such that j is within i′s transmission range, (i.e.,j

  • Customizable Visual Traces for Program Explanations

    Creator:
    Bajaj, Divya
    Abstract:
    Correctness and efficiency are important properties of programs. However, to support maintenance and debugging, the programs should also be understandable. Program explanations also play a vital role in educational settings, enhancing the understanding of programs among students. Proof trees provide a sound basis for generating dynamic explanations of programs. But...
    Resource Type:
    Masters Thesis
    Full Text:
    trees (Jν). . . . . . . . . . . . . . . . . . . . . 20 4.2 Proof tree for let sqr=\x->x*x in sqr 5