Search Constraints

Start Over
Filtering by: Creator Kirinicich, A. R. Remove constraint Creator: Kirinicich, A. R. Committee Member Nguyen, Thinh Remove constraint Committee Member: Nguyen, Thinh File Format application/pdf Remove constraint File Format: application/pdf

Search Results

  • Single-level dynamic register caching architecture for high-performance superscalar processors

    Creator:
    Liebert, John A.
    Abstract:
    The amount of instruction level parallelism (ILP) that can be exploited depends greatly on the size of the instruction window and the number of in-flight instructions the processor can support. However, this requires a register file with a large set of physical registers for renaming and multiple ports to provide...
    Resource Type:
    Masters Thesis
    Full Text:
    choose ready instructions to issue by way of a ‘request’ system, where instructions with both R bits

  • Asymmetric clustering using a register cache

    Creator:
    Morrison, Roger Allen
    Abstract:
    Conventional register files spread porting resources uniformly across all registers. This paper proposes a method called Asymmetric Clustering using a Register Cache (ACRC). ACRC utilizes a fast register cache that concentrates valuable register file ports to the most active registers thereby reducing the total register file area and power consumption....
    Resource Type:
    Masters Thesis
    Full Text:
    Computer Engineering presented on March 6, 2006. Title: Asymmetric Clustering Using a Register Cache

  • A channelized digital receiver design for UWB sytems in a multipath indoor environment

    Creator:
    Chang, Yuhao
    Abstract:
    This thesis presents a channelized digital receiver design for UWB sytems in a multipath indoor environment. The UWB technology has been used for commercial and military purposes due to a number of advantages such as low-power consumption, noise-like and carrier free. The energy of UWB signal is spread over a...
    Resource Type:
    Masters Thesis
    Full Text:
    A channelized digital receiver design.doc 1 AN ABSTRACT OF THE

  • Instruction fetching, scheduling, and forwarding in a dynamic multithreaded processor

    Creator:
    Browning, Adam W.
    Abstract:
    Dynamic multithreaded processors attempt to increase the performance of a single sequential program by dynamically extracting threads from sources such as loop iterations. The scheduling of instructions in such a processor plays a vital role in the amount of thread level parallelism that can be extracted and thus the overall...
    Resource Type:
    Masters Thesis
    Full Text:
    the current instruction. If the R-bit is cleared, then a speculative thread cannot use the value

  • A genetic algorithm for the vehicle routing problem with heterogeneous vehicles from multiple depots, allowing multiple visits

    Creator:
    Lim, Hyunpae
    Abstract:
    In the thesis, an application of a genetic algorithm (GA) is considered to solve the vehicle routing problem (VRP) which involves heterogeneous vehicles to serve known customer demands from multiple depots achieving the minimum delivery cost, where each customer must be satisfied by one or more visit(s), and each vehicle...
    Resource Type:
    Masters Thesis
    Full Text:
    called a binary tournament. A random number r is then generated between 0 and 1. If r < k, where k is a

  • Low-complexity high-speed VLSI design of low-density parity-check decoders

    Creator:
    Cui, Zhiqiang
    Abstract:
    Low-Density Parity-check (LDPC) codes have attracted considerable attention due to their capacity approaching performance over AWGN channel and highly parallelizable decoding schemes. They have been considered in a variety of industry standards for the next generation communication systems. In general, LDPC codes achieve outstanding performance with large codeword lengths (e.g.,...
    Resource Type:
    Dissertation
    Full Text:
    schemes. They have been considered in a variety of industry standards for the next generation

  • Network coding in relay networks

    Creator:
    Alban, Eduardo
    Abstract:
    Transmission over wireless networks presents multiple technical challenges due to noise, interference, fading, power constraints and bandwidth limitation. Different solutions have been propposed to overcome these issues and some of them are treated here. Cooperative diversity has been proposed as an implementation for networks where terminals are restricted to using...
    Resource Type:
    Masters Thesis
    Full Text:
    (as,rXs + Zr)) ∗} = E{β2|as,r| 2x2s + βas,rxsz ∗ r +βa∗s,rx ∗ szr + β 2z2r )} = β2|as,r| 2E{x2

  • Channel estimation and data detection for mobile MIMO OFDM systems

    Creator:
    Gao, Jie
    Abstract:
    Designing spectral efficient, high-speed wireless links that offer high quality- of-service and range capability has been a critical research and engineering challenge. In this thesis, we mainly address the complexity and performance issues of channel estimation and data detection in multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over...
    Resource Type:
    Dissertation
    Full Text:
    efficient, high-speed wireless links that offer high quality- of-service and range capability has been a

  • Power reduction of MPEG video decoding for mobile multimedia systems

    Creator:
    Lewis, James M.
    Abstract:
    The purpose of this thesis is to explore methods which can reduce the power dissipation of a mobile system while decoding MPEG video. MPEG decoding is a microprocessor intensive process that makes heavy use of both the L1 and L2 caches as well as main memory. The heavy load placed...
    Resource Type:
    Masters Thesis
    Full Text:
    dissipation of a mobile system while decoding MPEG video. MPEG decoding is a microprocessor intensive

  • Gray codes and their applications

    Creator:
    Anantha, Madhusudhanan
    Abstract:
    An n-bit Gray code is an ordered set of all 2n binary strings of length n. The special property of this listing is that Hamming distance between consecutive vectors is exactly 1. If the last and first codeword also have a Hamming distance 1 then the code is said to...
    Resource Type:
    Dissertation
    Full Text:
    ) Minimum 62 60 60 58 56 56 56 54 52 52 50 48 48 . . . Value of ν(C ′r−2) = 64 − A TABLE 3.2: Possible