Defense Notices
All students and faculty are welcome to attend the final defense of EECS graduate students completing their M.S. or Ph.D. degrees. Defense notices for M.S./Ph.D. presentations for this year and several previous years are listed below in reverse chronological order.
Students who are nearing the completion of their M.S./Ph.D. research should schedule their final defenses through the EECS graduate office at least THREE WEEKS PRIOR to their presentation date so that there is time to complete the degree requirements check, and post the presentation announcement online.
Upcoming Defense Notices
Luke Staudacher
Enabling Versal-Based Signal Processing Through a Development Framework and User GuideWhen & Where:
Nichols Hall, Room 246 (Executive Conference Room)
Committee Members:
Jonathan Owen, ChairShannon Blunt
Carl Leuschen
Erik Perrins
Abstract
AMD’s latest generation of adaptive system-on-chip (SoC) devices, the Versal product family, offers enhanced processing capabilities that are attractive to researchers and system designers. However, these capabilities introduce a significant knowledge barrier, limiting the practical benefits of Versal devices compared to more mature platforms from AMD, Intel, and other industry vendors. This project addresses this challenge through two primary deliverables: a software framework and a comprehensive user manual targeting Versal development. The software framework, named RSL Versal Core, provides a framework for users unfamiliar with Versal devices by selectively abstracting away more complex design components. Using a small set of commands, users can synthesize a programmable logic (PL) design, compile a Linux operating system for the onboard Arm processor with PL communication support, and program supported development boards. Following initial setup, the framework also supports extended software and firmware development for specific project needs. The accompanying user manual documents both RSL Versal Core and broader Versal development concepts. It guides users through reproducing and customizing the framework outputs manually and introduces key architectural and design principles useful for effective Versal-based system development. Together, these deliverables enable new developers to rapidly gain proficiency with Versal platforms and enable implementation of digital signal processing (DSP) concepts.
William Powers
Implementation and Analysis of Robust System-Informed Waveform DesignWhen & Where:
Nichols Hall, Room 246 (Executive Conference Room)
Committee Members:
Jonathan Owen, ChairShannon Blunt
Carl Leuschen
Abstract
Due to rapid advances in high-speed analog-to-digital conversion and software-defined architectures, modern radar systems increasingly shift signal generation and conditioning into the digital domain. These architectures enable high-fidelity signal capture and provide substantial flexibility in waveform synthesis and signal processing that was previously impractical in analog implementations. Despite these advances, however, achievable radar performance remains fundamentally constrained by the physical transmit hardware through which the signal is ultimately realized. Nonlinear amplification, finite bandwidth, and memory effects introduce distortion that creates a significant gap between idealized waveform design and the waveform that is physically radiated.
To address this limitation, this work proposes a system-aware radar waveform design framework that couples data-driven system identification with deterministic optimization to generate waveforms tailored to the underlying transmit hardware. A complex baseband memory polynomial model is developed to characterize nonlinear transmit-chain behavior using loopback measurements, where $\ell_1$-regularized LASSO estimation is employed to improve robustness against ill-conditioning and feature redundancy. Under this architecture, a generalized integrated sidelobe level (GISL) objective is reformulated using logarithmic scalarization to produce a numerically stable and Pareto-tunable optimization criterion capable of balancing output energy and sidelobe suppression. Additionally, efficient vectorized gradient expressions are derived using Wirtinger calculus and implemented using gradient-based descent and the limited-memory BFGS algorithm for practical high-dimensional waveform synthesis.
To validate the framework, a comprehensive hardware-in-the-loop testbench was developed supporting direct model identification and experimental evaluation of optimized waveform performance. Simulation and experimental results demonstrate that continuous-phase FM waveforms exhibit strong inherent robustness to nonlinear distortion, while phase-coded waveforms with large instantaneous phase discontinuities show significantly greater sensitivity to transmit-chain impairments. Across both waveform classes, the proposed framework achieves substantial improvements in output power efficiency and pulse compression performance relative to system-agnostic waveform design. These results demonstrate that transmitter constraints must be treated as fundamental design variables rather than secondary effects and establish system-aware optimization as a practical framework for next-generation radar waveform synthesis.
Cody Gish
Real-time GPU Based Arbitrary Waveform Generation Utilizing a Software-Defined Radar PlatformWhen & Where:
Nichols Hall, Room 246 (Executive Conference Room)
Committee Members:
Jonathan Owen, ChairShannon Blunt
Patrick McCormick
Abstract
Due to the ever-growing demand for access to the finite resources of the electromagnetic spectrum, significant effort has been directed toward improving spectrum utilization. This has become a particular challenge in radar transmission design, where waveform diversity techniques have emerged as a promising solution despite the accompanying implementation complexity. Diverse signals are inherently non-repeating and pose unique challenges in comparison to traditional radar waveforms. Software defined radios (SDRs) allow for traditional RF components and signal processing to be implemented and controlled in software rather than hardware, providing a platform for testing experimental radar algorithms. This thesis presents a real-time parallel implementation of five previously developed distinct waveform-diverse radar signals for use in a coherent SDR system. The implemented waveforms include stochastic waveform generation (StoWGe), multi-user radar communication (MURC), phase-attached radar communication (PARC), pseudo-random optimized frequency modulation (PRO-FM), and waveform recycling. To enable real-time generation at maximum SDR data rates, these waveforms are implemented using digital synthesis techniques via GPU parallel processing. This approach alleviates CPU resource limitations by offloading computationally intensive waveform generation tasks to the GPU, enabling continuous high-throughput operation. A custom asynchronous transmit and receive architecture is developed to integrate these GPU-accelerated waveforms with UHD-based SDR hardware. The system leverages a multithreaded framework approach that can sustain coherent and synchronized radar operation. To validate the system, a series of loopback testing across all waveforms and a variety of parameters is completed to confirm the execution of the generate-transmit-receive chain.
David Felton
Optimization and Evaluation of Physical Complementary Radar WaveformsWhen & Where:
Nichols Hall, Room 129 (Apollo Auditorium)
Committee Members:
Shannon Blunt, ChairRachel Jarvis
Patrick McCormick
James Stiles
Zsolt Talata
Abstract
The RF spectrum is a precious, finite resource with ever-increasing demand. Consequently, the mandate to be a "good spectral neighbor" is in direct conflict with the requirements for high-performance sensing where correlation error is fundamentally limited. As such, matched-filter radar performance is often sidelobe-limited with estimation error being constrained by the time-bandwidth (TB) of the collective emission. The methods developed here seek to bridge this gap between idealized radar performance and practical utility via waveform design.
Estimation error becomes more complex when employing pulse-agility. In doing so, range-sidelobe modulation (RSM) spreads energy across Doppler, rendering traditional methods ineffective. To address this, the gradient-based complementary-FM framework was developed to produce complementary sidelobe cancellation (CSC) after coherently combining subsets within a pulse-agile emission. In contrast to the majority of complementary signals, explored via phase-coding, these Comp-FM waveform subsets achieve CSC while preserving hardware-compatibility since they are FM (though design distortion is never completely avoided). Although Comp-FM addressed practicality via hardware amenability, CSC was localized to zero-Doppler. This work expands the Comp-FM notion to a Doppler-generalized (DG) framework, extending the cancellation condition to an arbitrary span. The same framework can likewise be employed to jointly optimize an entire coherent processing interval (CPI) to minimize RSM within the radar point-spread-function (PSF), thereby generalizing the notion of complementarity and introducing the potential for cognitive operation if sufficient scattering knowledge is available a-priori.
Sensing with a single emitter is limited by self-inflicted error alone (e.g., clutter, sidelobes), while MIMO systems must additionally contend with the cross-responses from emitters operating concurrently (e.g., simultaneously, spatially proximate, in a shared spectrum), further degrading radar sensitivity. Now, total correlation error is dictated by the overlapping TB (i.e., how coincident are the signals) and number of operating emitters, compounding difficulty to estimate if left unaddressed. As such, the determination of "orthogonal waveforms" comprises a large portion of MIMO literature, though remains a phenomenological misnomer for pulsed emissions. Here, the notion of complementary-FM is applied to a multi-emitter context in which transmitter-amenable quasi-orthogonal subsets, occupying the same spectral band, are produced via a similar gradient-based approach. To further practicalize these MIMO-Comp-FM waveform subsets, the same "DG" approach described above, addressing the otherwise-default Doppler-induced degradation of complementary signals, is applied. In doing so, Doppler-independent separability and complementarity greatly improves estimation sensitivity for multi-emitter systems.
This MIMO-Comp-FM framework is developed for standard matched filter processing. Coupling this framework with a "DG" form of the previously explored MIMO-MiCRFt is also investigated, illustrating the added benefit of pairing optimized subsets with similarly calibrated processing.
Each of these methods is developed to address unique and increasingly complex sources of estimation error. All approaches are initially developed and evaluated via simulated analysis where ground-truth is known. Then, despite hardware-induced distortion being unavoidable, the MIMO-Comp-FM framework is confirmed via loopback measurements to preserve the majority of CSC that was observed in simulation. Finally, open-air demonstration of each approach validates practical utility on a radar system.
Hao Xuan
Toward an Integrated Computational Framework for Metagenomics: From Sequence Alignment to Automated Knowledge DiscoveryWhen & Where:
Nichols Hall, Room 246 (Executive Conference Room)
Committee Members:
Cuncong Zhong, ChairFengjun Li
Suzanne Shontz
Hongyang Sun
Liang Xu
Abstract
Metagenomic sequencing has become a central paradigm for studying complex microbial communities and their interactions with the host, with emerging applications in clinical prediction and disease modeling. In this work, we first investigate two representative application scenarios: predicting immune checkpoint inhibitor response in non-small cell lung cancer using gut microbial signatures, and characterizing host–microbiome interactions in neonatal systems. The proposed reference-free neural network captures both compositional and functional signals without reliance on reference genomes, while the neonatal study demonstrates how environmental and genetic factors reshape microbial communities and how probiotic intervention can mitigate pathogen-induced immune activation.
These studies highlight both the promise and the inherent difficulty of metagenomic analysis: transforming raw sequencing data into clinically actionable insights remains an algorithmically fragmented and computationally intensive process. This challenge arises from two key limitations: the lack of a unified algorithmic foundation for sequence alignment and the absence of systematic approaches for selecting and organizing analytical tools. Motivated by these challenges, we present a unified computational framework for metagenomic analysis that integrates complementary algorithmic and systems-level solutions.
First, to resolve fragmentation at the alignment level, we develop the Versatile Alignment Toolkit (VAT), a unified algorithmic system for biological sequence alignment across diverse applications. VAT introduces an asymmetric multi-view k-mer indexing scheme that integrates multiple seeding strategies within a single architecture and enables dynamic seed-length adjustment via longest common prefix (LCP)–based inference without re-indexing. A flexible seed-chaining mechanism further supports diverse alignment scenarios, including collinear, rearranged, and split alignments. Combined with a hardware-efficient in-register bitonic sorting algorithm and dynamic index-loading strategy, VAT achieves high efficiency and broad applicability across read mapping, homology search, and whole-genome alignment. Second, to address the challenge of tool selection and pipeline construction, we develop SNAIL, a natural language processing system for automated recognition of bioinformatics tools from large-scale and rapidly growing scientific literature. By integrating XGBoost and Transformer-based models such as SciBERT, SNAIL enables structured extraction of analytical tools and supports automated, reproducible pipeline construction.
Together, this work establishes a unified framework that is grounded in real-world applications and addresses key bottlenecks in metagenomic analysis, enabling more efficient, scalable, and clinically actionable workflows.
Past Defense Notices
KEERTHI GANTA
TCP Illinois Protocol Implementation in ns-3When & Where:
250 Nichols Hall
Committee Members:
James Sterbenz, ChairVictor Frost
Bo Luo
Abstract
The choice of congestion control algorithm has an impact on the performance of a network. The congestion control algorithm should be selected and implemented based on the network scenario in order to achieve better results. Congestion control in high speed networks and networks with large BDP is proved to be more critical due to the high amount of data at risk. There are problems in achieving better throughput with conventional TCP in the above mentioned scenario. Over the years conventional TCP is modified to pave way for TCP variants that could address the issues in high speed networks. TCP Illinois is one such protocol for high speed networks. It is a hybrid version of a congestion control algorithm as it uses both packet loss and delay information to decide on the window size. The packet loss information is used to decide on whether to increase or decrease the congestion window and delay information is used to assess the amount of increase or decrease that has to be made.
ADITYA RAVIKANTI
sheets-db: Database powered by Google SpreadsheetsWhen & Where:
2001B Eaton Hall
Committee Members:
Andy Gill, ChairPerry Alexander
Prasad Kulkarni
Abstract
The sheets-db library is a Haskell binding to Google Sheets API. sheets-db allows Haskell users to utilize google spread sheets as a light weight database. It provides various functions to create, read, update and delete rows in spreadsheets along with a way to construct simple structured queries.
NIRANJAN PURA VEDAMURTHY
Testing the Accuracy of Erlang Delay Formula for Smaller Number of TCP FlowsWhen & Where:
246 Nichols Hall
Committee Members:
Victor Frost, ChairGary Minden
Glenn Prescott
Abstract
The Erlang delay formula for dimensioning different networks is used to calculate the probability of congestion. Testing the accuracy of a probability of congestion found using the Erlang formula against the simulation for probability of packet loss is demonstrated in this project. The simulations are done when TCP traffic is applied through one bottleneck node. Three different source traffic models having small number of flows is considered. Simulations results for three different source traffic models is shown in terms of probability of packet loss and load supplied to the topology. Various traffic parameters are varied in order to show the impact on the probability of packet loss and to compare with the Erlang prediction for probability of congestion.
MAHMOOD HAMEED
Nonlinear Mixing in Optical Multicarrier SystemsWhen & Where:
246 Nichols Hall
Committee Members:
Ron Hui, ChairShannon Blunt
Erik Perrins
Alessandro Salandrino
Carey Johnson
Abstract
Efficient use of the vast spectrum offered by fiber-optic links by an end user with relatively small bandwidth requirement is possible by partitioning a high speed signal in a wavelength channel into multiple low-rate subcarriers. Multicarrier systems not only ensure efficient use of optical and electrical components, but also tolerate transmission impairments. The purpose of this research is to experimentally understand and minimize the impact of mixing among subcarriers in Radio-Over-Fiber (RoF) and direct detection systems, involving a nonlinear component such as a semiconductor optical amplifier. We also analyze impact of clipping and quantization on multicarrier signals and compare electrical bandwidth utilization of two popular multiplexing techniques in orthogonal frequency division multiplexing (OFDM) and Nyquist modulation.
For an OFDM-RoF system, we present a novel technique that minimizes the RF domain signal-signal beat interference (SSBI), relaxes the phase noise requirement on the RF carrier, realizes the full potential of the optical heterodyne technique, and increases the performance-to-cost ratio of RoF systems. We demonstrate a RoF network that shares the same RF carrier for both downlink and uplink, avoiding the need of an additional RF oscillator in the customer unit.
For direct detection systems, we first experimentally compare performance degradations of coherent optical OFDM and single carrier Nyquist pulse modulated systems in a nonlinear environment. We then experimentally evaluate the performance of signal-signal beat interference (SSBI) compensation technique in the presence of semiconductor optical amplifier (SOA) induced nonlinearities for a multicarrier optical system with direct detection. We show that SSBI contamination can be removed from the data signal to a large extent when the optical system operates in the linear region, especially when the carrier-to-signal power ratio is low.
SUSOBHAN DAS
Tunable Nano-photonic DevicesWhen & Where:
246 Nichols Hall
Committee Members:
Ron Hui, ChairAlessandro Salandrino
Chris Allen
Jim Stiles
Judy Wu
Abstract
In nano-photonics, the control of optical signals is based on tuning of the material optical properties in which the electromagnetic field propagates, and thus the choice of materials and of the physical modulation mechanism plays a crucial role. Several materials such as graphene, Indium Tin Oxide (ITO), and vanadium di-oxide (VO2) investigated here have attracted a great deal of attention in the nanophotonic community because of their remarkable tunability. This dissertation will include both theoretical modeling and experimental characterization of functional electro-optic materials and their applications in guided-wave photonic structures.
We have characterized the complex index of graphene in near infrared (NIR) wavelength through the reflectivity measurement on a SiO2/Si substrate. The measured complex indices as the function of the applied gate electric voltage agreed with the prediction of the Kubo formula.
We have performed the mathematical modeling of permittivity of ITO based on the Drude Model. Results show that ITO can be used as a plasmonic material and performs better than noble metals for applications in NIR wavelength region. Additionally, the permittivity of ITO can be tuned by carrier density change through applied voltage. An electro-optic modulator (EOM) based on plasmonically enhanced graphene has been proposed and modeled. We show that the tuning of graphene chemical potential through electrical gating is able to switch on and off the ITO plasmonic resonance. This mechanism enables dramatically increased electro-absorption efficiency.
Another novel photonic structure we are investigating is a multimode EOM based on the electrically tuned optical absorption of ITO in NIR wavelengths. The capability of mode-multiplexing increases the functionality per area in a nanophotonic chip. Proper design of ITO structure based on the profiles of y-polarized TE11 and TE21 modes allows the modulation of both modes simultaneously and differentially.
We have experimentally demonstrated the ultrafast changes of optical properties associated with dielectric-to-metal phase transition of VO2. This measurement is based on a fiber-optic pump-probe setup in NIR wavelength. Instantaneous optical phase modulation of the probe was demonstrated during pump pulse leading edge, which could be converted into an intensity modulation of the probe through an optical frequency discriminator
NIHARIKA DIVEKAR
Feature Extraction for Alias ResolutionWhen & Where:
2001B Eaton Hall
Committee Members:
Joseph Evans, ChairGary Minden
Benjamin Ewy
Abstract
Alias resolution or disambiguation is the process of determining which IP addresses belong to the same router. The focus of this project is the feature extraction aspect of the AliasCluster alias resolution technique. This technique uses five features extracted from traceroutes and uses a Naive Bayesian approach to resolve router aliases. The features extracted are the common subnet, percentage out-degree match for hop count ≤ 3, percentage out-degree match for hop count ≤ 4, percentage hop-count match for hop count ≤ 3, and percentage hop-count match for hop count ≤ 4. Using traceroutes from publicly available databases, the common subnet feature is determined by finding the number of bits common to two addresses, and the out-degree match is found by checking the number of interfaces in the downpath that appear in common to two addresses. The hop-count match is determined in a approach similar to the out-degree match, with an additional condition that the common interfaces must appear at the same hop count. In this project, algorithms to extract these features are implemented in Python and the feature distributions are compared to those described in the original AliasCluster work.
HAO CHEN
Mutual Information Accumulation over Wireless Networks: Fundamentals, Applications, and ImplementationWhen & Where:
246 Nichols Hall
Committee Members:
Lingjia Liu, ChairShannon Blunt
Victor Frost
Erik Perrins
Zsolt Talata
Abstract
Future wireless networks will face a compound challenge of supporting large traffic volumes, providing ultra-reliable and low latency connections to ultra-dense mobile devices. To meet this challenge, various new technologies have been introduced among which mutual-information accumulation (MIA), an advanced physical (PHY) layer coding technique, has been shown to significantly improve the network performance. Since the PHY layer is the fundamental layer, MIA could potentially impact various network layers of a wireless network. Accordingly, the understanding of improving network design based on MIA is far from being fully developed. In the proposed research, we target to 1) apply MIA techniques to various wireless networks such as cognitive radio networks, device-to-device networks, etc; 2) mathematically characterize the performance of such networks employing MIA; 3) use hardware to demonstrate the performance of MIA for a simple wireless network using the Universal Software Radio Peripherals (USRPs).
BHARATH ELLURU
Measuring Firmware of An Embedded DeviceWhen & Where:
2001B Eaton Hall
Committee Members:
Perry Alexander, ChairJerzy Grzymala-Busse
Prasad Kulkarni
Abstract
System Security has been one of the primary focus areas for embedded devices in recent times. The pervasion of embedded devices over a wide range of applications ranging from routers to RFID badge controls emphasizes the need for System Security. Any security compromise may result in manipulation, damage or loss of crucial data leading to unwarranted results. A conventional approach towards system security is the use of static analysis tools on source code. However, very few of these tools operate at the system level. This project envisions measuring (Looking at a given device and analyzing what is present)firmware of Gumstix, an embedded device running poky version of Linux and build a model that serves as an input to Action Notation Modelling Language (ANML) planner. An ANML planner can be later on used to generate a check list of vulnerabilities, which is out of scope for this project.
PENG SENG TAN
Addressing Spectrum Congestion by Spectrally-Cognizant Radar DesignWhen & Where:
250 Nichols Hall
Committee Members:
Jim Stiles, ChairShannon Blunt
Chris Allen
Lingjia Liu
Tyrone Duncan
Abstract
Due to the need for greater Radio Frequency (RF) spectrum by wireless communication industries such as mobile telephony, cable/satellite and wireless internet as a result of growing consumer base and demands, it has led to the issue of spectrum congestion as radar systems have traditionally maintain the largest share of the RF spectrum. To resolve the spectrum congestion problem, it has become even necessary for users from both types of systems to coexist within a finite spectrum allocation. However, this then leads to other problems such as the increased likelihood of mutual interference experienced by all users that are coexisting within the finite spectrum.
In this dissertation, we propose to address the problem of spectrum congestion via two independent approaches. The first approach involves designing an intelligent scheme to perform spectrum reallocation to radar systems such that the range resolution performance can be maintained with a smaller resulting bandwidth but at a cost of degraded sidelobe performance. The second approach involves designing a radar waveform that possesses good spectral containment property by utilizing the framework of Poly-phased coded Frequency Modulated (PCFM) waveforms such that the waveform will mitigate the issue of interference experienced by other users coexisting within the same band.
LEI YANG
Design and Analysis of Low-Latency Anonymous Communications for Big Data ApplicationsWhen & Where:
246 Nichols Hall
Committee Members:
Fengjun Li, ChairLuke Huan
Prasad Kulkarni
James Sterbenz
Yong Zeng
Abstract
Although the Internet tremendously facilitates online interaction and information exchange beyond geographic boundaries, it also enlarges attack surface for adversaries to sniff users’ privacy such as who you are, who you are talking to, and what you are saying from their communication activities over the open networks. The goal of anonymous communication networks is to protect the identity and location of a communication participant from being learned by the other participant or any third party. Tor is a most popular low-latency anonymity network. While Tor provides good privacy protection to millions of users on a daily basis, its performance and security issues are widely recognized. We anticipate that big data applications, such as anonymous video conferencing, will pose a large amount of extra traffic to Tor. The performance problem becomes a biggest obstacle impeding Tor’s further expansion, which will be aggravated in the big data era. On the other hand, it is well known that Tor is vulnerable to traffic analysis attacks, especially the end-to-end traffic confirmation attack.
In this proposal, we target the problems discussed above and propose a solution suite to address them correspondingly. We first explore the utilization of resources and find that a large portion of low-bandwidth relays are under-utilized. Therefore, we propose a multipath routing scheme to use idle resources to support bandwidth-intensive applications, which are the efforts that we make to solve the performance problems in general Tor services. To further improve the performance, we propose to enable differentiated services in Tor. The current Tor system treats clients’ requests equally and provides the same level of protection, neglecting the heterogeneity in individuals’ anonymity needs. To address this problem, we propose a learning-based solution that can automatically recognize users’ different anonymity needs for different applications and integrates it into the currently multipath Tor design to support dynamic, self-configurable anonymous communication. Then, we propose a multipath-routing based architecture for Tor hidden services to enhance the resistance of Tor hidden services against traffic analysis attacks.