Type of Document Master's Thesis Author Agarwal, Utsav Author's Email Address email@example.com URN etd-02072017-185004 Title Improved Subset Generation For The MU-Decoder Degree Master of Science in Electrical Engineering (M.S.E.E.) Department Electrical & Computer Engineering Advisory Committee
Advisor Name Title Vaidyanathan, Ramachandran Committee Chair Busch, Konstantin (Costas) Committee Member Trahan, Jerry Committee Member Keywords
- totally ordered
- subset generation
- MU Decoder
Date of Defense 2017-01-19 Availability unrestricted AbstractThe MU-Decoder is a hardware subset generator that finds use in partial reconfiguration
of FPGAs and in numerous other applications. It is capable of generating a set S of subsets
of a large set Z_n with n elements. If the subsets in S satisfy the “isomorphic totally-
ordered property”, then the MU-Decoder works very efficiently to produce a set of u subsets in O(log n) time and Θ(n √u log n) gate cost. In contrast, a vain approach requires Θ(un)
gate cost. We show that this low cost for the MU-Decoder can be achieved without the isomorphism constraint, thereby allowing S to include a much wider range of subsets. We also show that if additional constraints on the relative sizes of the subsets in S can be placed, then u subsets can be generated with Θ(n √u) cost. This uses a new hardware enhancement proposed in this thesis. Finally, we show that by properly selecting S and by using some elements of traditional methods, a set of Θ (un^log( log (n/log n))) subsets can be produced with Θ(n √u) cost.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access Agarwal_thesis.pdf 944.89 Kb 00:04:22 00:02:14 00:01:58 00:00:59 00:00:05
If you have questions or technical problems, please Contact LSU-ETD Support.