Identifier

etd-04282011-065004

Degree

Master of Science in Electrical Engineering (MSEE)

Department

Electrical and Computer Engineering

Document Type

Thesis

Abstract

In this thesis we study the implementation details of the MU-Decoders, a recently proposed hardware module that has been theoretically shown to be superior to other methods for generating subsets of large sets. Our study confirms this advantage. Specifically, we compare the performance of implementations of the LUT-Decoder (the most common configurable decoder) to the MU-Decoder. We show that for while the LUT-Decoder is slightly better than the MU-Decoder for arbitrary (and artificial) inputs, for a large class of inputs called totally ordered subsets, that have practical significance, the MU-Decoder is vastly superior in area to the LUT-Decoder. In terms of delay and power too, the MU-Decoder performs better than the LUT-Decoder. This work is based on a series of time-optimized and area-optimized implementations of key building blocks of the MU-Decoder that help construct models for both the LUT-Decoder and the MU-Decoder. These models serve to predict the delay, area and power of these decoders at sizes that may not be practical to implement in an academic setting. As a part of the work, multiplexers, one-hot decoders, multicast hard-wiring, and memory modules are implemented and modeled. These are all commonly used elements of digital systems. Therefore this work may also be of independent interest, beyond MU-Decoders.

Date

2011

Document Availability at the Time of Submission

Release the entire work immediately for access worldwide.

Committee Chair

Vaidyanathan, Ramachandran

Share

COinS