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
Muhammad Momin Rahman
Development of a Signal Flow Graph-Based De-Embedding Framework for Broadband Passive Linear Multiport RF & Microwave Networks with Applications to Power SplittersWhen & Where:
Nichols Hall, Room 317 (Richard K. Moore Conference Room)
Committee Members:
Carl Leuschen, ChairKenneth Demarest
Fernando Rodriguez-Morales
Abstract
Discrete passive components, including resistors, capacitors, inductors, and transformers, are fundamental to broadband 75-Ω radio-frequency (RF) systems, particularly in cable television (CATV) and hybrid fiber-coaxial (HFC) networks. These components are incorporated into power splitters, couplers, power inserters, and amplifiers to achieve desired frequency responses, impedance matching, and signal transmission characteristics. However, their electrical behavior becomes increasingly complex at higher frequencies due to parasitic resistance, inductance, capacitance, electromagnetic coupling, and distributed transmission-line effects. Consequently, accurate broadband characterization is essential for predicting component behavior and developing representative RF circuit models for simulation purposes.
A significant challenge arises when characterizing passive components with limited or unavailable manufacturer specifications, particularly when existing component inventories must be evaluated for broadband applications. Conventional measurement instruments, including digital multimeters, LCR meters, oscilloscopes, and function generators, generally lack the frequency range required for comprehensive RF characterization from 5 MHz to 3 GHz. Vector network analyzers (VNAs) enable complex scattering-parameter measurements across this frequency range; however, the measured response includes contributions from test fixtures, interconnections, and parasitic discontinuities that must be distinguished from the intrinsic response of the device under test (DUT).
This project investigates the development of a signal flow graph (SFG)-based de-embedding framework for broadband passive linear multiport RF networks. The methodology incorporates series-through and shunt-through DUT (CPWG) fixture configurations, conventional Open-Short and Short-Open de-embedding techniques, followed by lumped-element and distributed transmission-line representations of fixture parasitics. Scattering-parameter and ABCD-parameter analysis are employed to characterize fixture responses, while signal flow graph derivations provide a mathematical basis for analyzing interconnected multiport networks. Particular attention is given to fixture asymmetry, impedance discontinuities, and multiple signal propagation paths that complicate the extension of conventional two-port characterization methods to higher-order networks.
Experimental validation is conducted through the characterization of passive components with published impedance and quality-factor characteristics, enabling comparisons between extracted measurements, equivalent-circuit models, and manufacturer reference data. The methodology is subsequently applied to broadband power splitter networks used in CATV/HFC systems to investigate the accuracy and applicability of the proposed multiport de-embedding framework. The project aims to establish a systematic approach to broadband passive component characterization that integrates fixture modeling, network theory, and experimental measurement while reducing dependence on proprietary characterization data.
Fairuz Shadmani Shishir
Efficient and Privacy-Preserving Biomedical AI: From Precision Therapeutics Design to Private Clinical PredictionWhen & Where:
Eaton Hall, Room 2001B
Committee Members:
Sumaiya Shomaji, ChairTamzidul Hoque
Cuncong Zhong
Bishnu Sarker
Michael Hageman
Abstract
Accurate protein characterization, precision therapeutics design, and privacy-preserving clinical modeling are important challenges in biomedical artificial intelligence (AI). Addressing these challenges requires computational frameworks that are not only accurate and scalable but also capable of supporting reliable decision-making. This dissertation develops efficient, scalable, and reliable computational frameworks across three areas: Computational characterization of proteins, precision therapeutics design, and privacy-aware clinical representation learning. The first part of this dissertation focuses on efficient protein characterization at both the sequence and residue levels. GPCR-SLM, a knowledge-distilled small protein language model, classifies G-protein-coupled receptors (GPCRs), a family targeted by approximately 35% of FDA-approved drugs. Across 86 families, GPCR-SLM achieves 99% accuracy, outperforming BLAST (86.4%) and HMMER (91%), with a 33.5-fold speedup over large protein language models. Extending characterization to the residue level, a protein-metal-ion binding site prediction framework evaluates five protein language models and incorporates positional encoding to capture long-range dependencies. Under 10-fold cross-validation, it achieves a Matthews correlation coefficient of 0.89, with precision, recall, and F1 scores exceeding 95% across six metal ions.
Building on these protein characterization methods, the second part advances precision therapeutics design through uncertainty quantification and generative learning for therapeutic antibodies. NbBayesLM combines protein language model embeddings and physicochemical descriptors in a Bayesian neural network to predict nanobody thermostability. Evaluated on 10,630 VHH sequences, it achieves a mean absolute error of 1.89C and an R2 of 0.67 while estimating epistemic and aleatoric uncertainty to support candidate prioritization. CIgFlow employs classifier-free guidance to generate de novo, antigen-conditioned antibody sequences without fixed scaffolds or paired structural data. Generated sequences achieve a median OASis humanness score of 0.90 and mean predicted local distance difference test (pLDDT) score of 85.0, demonstrating promising novelty and diversity. The third part addresses privacy-aware clinical modeling using electrocardiograms (ECGs), which encode diagnostic information and sensitive demographic attributes. A variational autoencoder with dual discriminators suppresses demographic information while preserving clinically relevant representations.
Collectively, this dissertation advances efficient protein representation learning, computational antibody design, and privacy-preserving clinical AI, contributing methodological foundations for trustworthy biomedical applications.
Arturo Solorio
Performance Analysis of Mismatched Filtering for Stochastic WaveformsWhen & Where:
Nichols Hall, Room 246 (Executive Conference Room)
Committee Members:
Patrick McCormick, ChairShannon Blunt
Charles Mohr
Abstract
Mismatched filtering (MMF) is a widely used pulse compression technique that reduces cross-correlation sidelobe levels at the cost of some loss in signal-to-noise ratio (SNR). Applying MMF to stochastically generated radar waveforms makes the filter's performance inherently random, which can be problematic if the variability is excessive. As well as the computational cost being relatively high, as per pulse, a new MMF optimization is required. In this thesis, the feasibility of a fixed MMF strategy for stochastic radar waveforms to reduce computational cost is investigated. Two MMF formulations were evaluated, the optimal MMF (Diagonal Loaded Filter) and a projection-based MMF. Both filters were designed to minimize sidelobe energy within specified regions of the Cross-Ambiguity Function (CAF) for Stochastic Waveform Generation (StoWGe) waveforms, and their performance was assessed across multiple time-bandwidth products and sidelobe-regions for two center frequencies, Fc = 30 Ghz and Fc = 3.5 Ghz. The MMF performance was characterized using SNR loss and sidelobe depth over hundreds of trails. It is observed that the variability in SNR and sidelobe depth decreases as the waveform time-bandwdith product and the sidelobe region targeted for minimization increase, although the Fc = 3.5 GHz cases exhibited a plateau in achievable sidelobe depth. Additional validation using 1000-trail histograms and loop-back testing confirmed the robustness for the fixed MMF approach for higher time-bandwidth product stochastic waveforms. Where, overall, the results demonstrate that a fixed MMF strategy is feasible for stochastic waveforms when the time-bandwdith product and sidelobe region are sufficiently large. Furthermore, the Projection-based MMF provides a suboptimal alternative to the optimal MMF as it achieves comparable MMF performance when constrained to similar SNR-loss and may be desirable when the size of the domination eigenvalues is small relative to the filter length and can be efficiency obtained.
Past Defense Notices
Victor Berger da Silva
Probabilistic graphical techniques for automated ice-bottom tracking and comparison between state-of-the-art solutionsWhen & Where:
317 Nichols Hall
Committee Members:
Carl Leuschen, ChairJohn Paden
Guanghui Wang
Abstract
Multichannel radar depth sounding systems are able to produce two-dimensional and three-dimensional imagery of the internal structure of polar ice sheets. One of the relevant features typically present in this imagery is the ice-bedrock interface, which is the boundary between the bottom of the ice-sheet and the bedrock underneath. Crucial information regarding the current state of the ice sheets, such as the thickness of the ice, can be derived if the location of the ice-bedrock interface is extracted from the imagery. Due to the large amount of data collected by the radar systems employed, we seek to automate the extraction of the ice-bedrock interface and allow for efficient manual corrections when errors occur in the automated method. We present improvements made to previously proposed solutions which pose feature extraction in polar radar imagery as an inference problem on a probabilistic graphical model. The improvements proposed here are in the form of novel image pre-processing steps and empirically-derived cost functions that allow for the integration of further domain-specific knowledge into the models employed. Along with an explanation of our modifications, we demonstrate the results obtained by our proposed models and algorithms, including significantly decreased mean error measurements such as a 47% reduction in average tracking error in the case of three-dimensional imagery. We also present the results obtained by several state-of-the-art ice-interface tracking solutions, and compare all automated results with manually-corrected ground-truth data. Furthermore, we perform a self-assessment of tracking results by analyzing the differences found between the automatically extracted ice-layers in cases where two separate radar measurements have been made at the same location.
Dain Vermaak
Visualizing, and Analyzing Student Progress on Learning MapsWhen & Where:
1 Eaton Hall, Dean's Conference Room
Committee Members:
James Miller, ChairMan Kong
Suzanne Shontz
Guanghui Wang
Bruce Frey
Abstract
A learning map is an unweighted directed graph containing relationships between discrete skills and concepts with edges defining the prerequisite hierarchy. They arose as a means of connecting student instruction directly to standards and curriculum and are designed to assist teachers in lesson planning and evaluating student response. As learning maps gain popularity there is an increasing need for teachers to quickly evaluate which nodes have been mastered by their students. Psychometrics is a field focused on measuring student performance and includes the development of processes used to link a student's response to multiple choice questions directly to their understanding of concepts. This dissertation focuses on developing modeling and visualization capabilities to enable efficient analysis of data pertaining to student understanding generated by psychometric techniques.
Such analysis naturally includes that done by classroom teachers. Visual solutions to this problem clearly indicate the current understanding of a student or classroom in such a way as to make suggestions that can guide future learning. In response to these requirements we present various experimental approaches which augment the original learning map design with targeted visual variables.
As well as looking forward, we also consider ways in which data visualization can be used to evaluate and improve existing teaching methods. We present several graphics based on modelling student progression as information flow. These methods rely on conservation of data to increase edge information, reducing the load carried by the nodes and encouraging path comparison.
In addition to visualization schemes and methods, we present contributions made to the field of Computer Science in the form of algorithms developed over the course of the research project in response to gaps in prior art. These include novel approaches to simulation of student response patterns, ranked layout of weighted directed graphs with variable edge widths, and enclosing certain groups of graph nodes in envelopes.
Finally, we present a final design which combines the features of key experimental approaches into a single visualization tool capable of meeting both predictive and validation requirements along with the methods used to measure the effectiveness and correctness of the final design.
Priyanka Saha
Complexity of Rule Sets Induced from Incomplete Data with Lost Values and Attribute-Concept ValuesWhen & Where:
2001 B Eaton Hall
Committee Members:
Jerzy Grzymala-Busse, ChairTaejoon Kim
Cuncong Zhong
Abstract
Data is a very rich source of knowledge and information. However, special techniques need to be implemented in order to extract interesting facts and discover patterns in large data sets. This is achieved using the technique called Data Mining. Data mining is an interdisciplinary subfield of computer science and statistics with an overall goal to extract information from a data set and transform the information into a comprehensible structure for further use. Rule induction is a Data Mining technique in which formal rules are extracted from a set of observations. The rules induced may represent a full scientific model of the data, or merely represent local patterns in the data.
The data sets, however, is not always complete and might contain missing values. Data mining also provides techniques to handle the missing values in a data set. In this project, we’ve implemented lost value and attribute-concept value interpretations of incomplete data. Experiments were conducted on 176 datasets using three types of approximations (lower, middle and upper) of the concept and Modified Learning from Examples Module, version 2 (MLEM2) rule induction algorithm was used to induce rule sets.
The goal of the project was to prove that the complexity of rule sets derived from datasets having missing attributes is better for attribute-concept value interpretation compared to the lost value interpretation. The size of the rule set was always smaller for the attribute-concept value interpretation. Also, as a secondary objective, we tried to explore what type of approximation provides the smallest size of the rule sets.
Mohanad Al-Ibadi
Array Processing Techniques for Estimating and Tracking of an Ice-Sheet BottomWhen & Where:
317 Nichols Hall
Committee Members:
Shannon Blunt, ChairJohn Paden
Christopher Allen
Erik Perrins
James Stiles
Abstract
Ice bottom topography layers are an important boundary condition required to model the flow dynamics of an ice sheet. In this work, using low frequency multichannel radar data, we locate the ice bottom using two types of automatic trackers.
First, we use the multiple signal classification (MUSIC) beamformer to determine the pseudo-spectrum of the targets at each range-bin. The result is passed into a sequential tree-reweighted message passing belief-propagation algorithm to track the bottom of the ice in the 3D image. This technique is successfully applied to process data collected over the Canadian Arctic Archipelago ice caps, and produce digital elevation models (DEMs) for 102 data frames. We perform crossover analysis to self-assess the generated DEMs, where flight paths cross over each other and two measurements are made at the same location. Also, the tracked results are compared before and after manual corrections. We found that there is a good match between the overlapping DEMs, where the mean error of the crossover DEMs is 38+7 m, which is small relative to the average ice-thickness, while the average absolute mean error of the automatically tracked ice-bottom, relative to the manually corrected ice-bottom, is 10 range-bins.
Second, a direction of arrival (DOA)-based tracker is used to estimate the DOA of the backscatter signals sequentially from range bin to range bin using two methods: a sequential maximum a posterior probability (S-MAP) estimator and one based on the particle filter (PF). A dynamic flat earth transition model is used to model the flow of information between range bins. A simulation study is performed to evaluate the performance of these two DOA trackers. The results show that the PF-based tracker can handle low-quality data better than S-MAP, but, unlike S-MAP, it saturates quickly with increasing numbers of snapshots. Also, S-MAP is successfully applied to track the ice-bottom of several data frames collected over Russell glacier, and the results are compared against those generated by the beamformer-based tracker. The results of the DOA-based techniques are the final tracked surfaces, so there is no need for an additional tracking stage as there is with the beamformer technique.
Jason Gevargizian
MSRR: Leveraging dynamic measurement for establishing trust in remote attestationWhen & Where:
246 Nichols Hall
Committee Members:
Prasad Kulkarni, ChairArvin Agah
Perry Alexander
Bo Luo
Kevin Leonard
Abstract
Measurers are critical to a remote attestation (RA) system to verify the integrity of a remote untrusted host. Runtime measurers in a dynamic RA system sample the dynamic program state of the host to form evidence in order to establish trust by a remote system (appraisal system). However, existing runtime measurers are tightly integrated with specific software. Such measurers need to be generated anew for each software, which is a manual process that is both challenging and tedious.
In this paper we present a novel approach to decouple application-specific measurement policies from the measurers tasked with performing the actual runtime measurement. We describe the MSRR (MeaSeReR) Measurement Suite, a system of tools designed with the primary goal of reducing the high degree of manual effort required to produce measurement solutions at a per application basis.
The MSRR suite prototypes a novel general-purpose measurement system, the MSRR Measurement System, that is agnostic of the target application. Furthermore, we describe a robust high-level measurement policy language, MSRR-PL, that can be used to write per application policies for the MSRR Measurer. Finally, we provide a tool to automatically generate MSRR-PL policies for target applications by leveraging state of the art static analysis tools.
In this work, we show how the MSRR suite can be used to significantly reduce the time and effort spent on designing measurers anew for each application. We describe MSRR's robust querying language, which allows the appraisal system to accurately specify the what, when, and how to measure. We describe the capabilities and the limitations of our measurement policy generation tool. We evaluate MSRR's overhead and demonstrate its functionality by employing real-world case studies. We show that MSRR has an acceptable overhead on a host of applications with various measurement workloads.
Surya Nimmakayala
Heuristics to predict and eagerly translate code in DBTsWhen & Where:
2001 B Eaton Hall
Committee Members:
Prasad Kulkarni, ChairPerry Alexander
Fengjun Li
Bo Luo
Shawn Keshmiri
Abstract
Dynamic Binary Translators(DBTs) have a variety of uses, like instrumentation,
profiling, security, portability, etc. In order for the desired application to run
with these enhanced additional features(not originally part of its design), it is to be run
under the control of Dynamic Binary Translator. The application can be thought of as the
guest application, to be run with in a controlled environment of the translator,
which would be the host application. That way, the intended application execution
flow can be enforced by the translator, thereby inducing the desired behavior in
the application on the host platform(combination of Operating System and Hardware).
However, there will be a run-time/execution-time overhead in the translator, when performing the
additional tasks to run the guest application in a controlled fashion. This run-time
overhead has been limiting the usage of DBT's on a large scale, where response times can be critical.
There is often a trade-off between the benefits of using a DBT against the overall application response
time. So, there is a need to research/explore ways to faster application execution through DBT's(given
their large code-base).
With the evolution of the multi-core and GPU hardware architectures, multilpe concurrent threads can get
more work done through parallelization. A proper design of parallel applications or parallelizing parts of existing
serial code, can lead to improved application run-time's through hardware architecture support.
We explore the possibility of improving the performance of a DBT named DynamoRIO. The basic idea is to improve
its performance by speeding-up the process of guest code translation, through multiple threads translating
multiple pieces of code concurrently. In an ideal case, all the required code blocks for application
execution are readily available ahead of time without any stalls. For efficient eager translation, there is
also a need for heuristics to better predict the next code block to be executed. That could potentially
bring down the less productive code translations at run-time. The goal is to get application speed-up through
eager translation and block prediction heuristics, with execution time close to native run.
FARHAD MAHMOOD
Modeling and Analysis of Energy Efficiency in Wireless Handset Transceiver SystemsWhen & Where:
Apollo Room, Nichols Hall
Committee Members:
Erik Perrins, ChairShannon Blunt
Victor Frost
Lingjia Liu
Bozenna Pasik-Duncan
Abstract
As wireless communication devices are taking a significant part in our daily life, research steps toward making these devices even faster and smarter are accelerating rapidly. The main limiting factors are energy and power consumption. Many techniques are utilized to increase the battery’s capacity (Ampere per Hour), but that comes with a cost of raising the safety concerns. The other way to increase the battery’s life is to decrease the energy consumption of the devices. In this work, we analyze energy-efficient communications for wireless devices based on an advanced energy consumption model that takes into account a broad range of parameters. The developed model captures relationships between transmission power, transceiver distance, modulation order, channel fading, power amplifier (PA) effects, power control, multiple antennas, as well as other circuit components in the radio frequency (RF) transceiver. Based the developed model, we are able to identify the optimal modulation order in terms of energy efficiency under different situations (e.g., different transceiver distance, different PA classes and efficiencies, different pulse shape, etc). Furthermore, we capture the impact of system level and the impact of network level on the PA energy via peak to average ratio (PAR) and power control. We are also able to identify the impact of multiple antennas at the handset on the energy consumption and the transmitted bit rate for few and many antennas (conventional multiple-input-multiple-output (MIMO) and massive MIMO) at the base station. This work provides an important framework for analyzing energy-efficient communications for different wireless systems ranging from cellular networks to wireless internet of things.
DANA HEMMINGSEN
Waveform Diverse Stretch ProcessingWhen & Where:
Apollo Room, Nichols Hall
Committee Members:
Shannon Blunt, ChairChristopher Allen
James Stiles
Abstract
Stretch processing with the use of a wideband LFM transmit waveform is a commonly used technique, and its popularity is in large part due to the large time-bandwidth product that provides fine range resolution capabilities for applications that require it. It allows pulse compression of echoes at a much lower sampling bandwidth without sacrificing any range resolution. Previously, this technique has been restrictive in terms of waveform diversity because the literature shows that the LFM is the only type of waveform that will result in a tone after stretch processing. However, there are also many examples in the literature that demonstrate an ability to compensate for distortions from an ideal LFM waveform structure caused by various hardware components in the transmitter and receiver. This idea of compensating for variations is borrowed here, and the use of nonlinear FM (NLFM) waveforms is proposed to facilitate more variety in wideband waveforms that are usable with stretch processing. A compensation transform that permits the use of these proposed NLFM waveforms replaces the final fast Fourier transform (FFT) stage of the stretch processing configuration, but the rest of the RF receive chain remains the same. This modification to the receive processing structure makes possible the use of waveform diversity for legacy radar systems that already employ stretch processing. Similarly, using the same concept of compensating for distortions to the LFM structure along with the notion that a Fourier transform is essentially the matched filter bank for an LFM waveform mixed with an LFM reference, a least-squares based mismatched filtering (MMF) scheme is proposed. This MMF could likewise be used to replace the final FFT stage, and can also facilitate the application of NLFM waveforms to legacy radar systems. The efficacy of these filtering approaches (compensation transform and least-squares based MMF) are demonstrated in simulation and experimentally using open-air measurements and are applied to different scenarios of NLFM waveform to assess the results and provide a means of comparison between the two techniques.
DANIEL GOMEZ GARCIA ALVESTEGUI
Scattering Analysis and Ultra-Wideband Radar for High-Throughput Phenotyping of Wheat CanopiesWhen & Where:
317 Nichols Hall
Committee Members:
Carl Leuschen, ChairChristopher Allen
Ron Hui
Fernando Rodriguez-Morales
David Braaten
Abstract
Rising the yield of wheat crops is essential to meet the projected future demands of consumption and it is expected that most yield increases will be associated to improvements in biomass accumulation. Cultivars with canopy architectures that focus the light interception where photosynthetic-capacity is greater achieve larger biomass accumulation rates. Identifying varieties with improved traits could be performed with modern breeding methods, such as genomic-selection, which depend on genotype-phenotype mappings. Developing a non-destructive sensor with the capability of efficiently phenotyping wheat-canopy architecture parameters, such as height and vertical distribution of projected-leaf-area-density, would be useful for developing architecture-related genotype-phenotype maps of wheat cultivars. In this presentation, new scattering analysis tools and a new 2-18 GHz radar system are presented for efficiently phenotyping the architecture of wheat canopies.
The radar system presented was designed with the objective to measure the RCS profile of wheat canopies at close range. The frequency range (2-18 GHz), topology (Frequency-modulated-continuous-wave) and other radar parameters were chosen to meet that goal. Phase noise of self-interference signals is the main source of coherent and incoherent noise in FMCW radars. A new comprehensive noise analysis is presented, which predicts the power-spectral-density of the noise at the output of FMCW radars,
including those related to phase noise. The new 2-18 GHz chirp generator is based on a phase-locked-loop that was designed with large loop bandwidth to suppress the phase noise of the chirp. Additionally, the radar RF front-end was designed to achieve low levels of LO-leakage and antenna feed-through, which are the main self-interference signals of FMCW radars.
In addition to the radar system, a new efficient radar simulator was developed to predict the RCS waveforms collected from wheat canopies over the 2-18 GHz frequency range. The coherent radar simulator is based on novel geometric and fully-polarimetric scattering models of wheat canopies. The scattering models of wheat canopies, leaves with arbitrary orientation and curvature, stems and heads were validated using a full-wave commercial simulator and measurements. The radar simulator was used to derive retrieval algorithms of canopy height and projected-leaf-area-density from RCS profiles, which were tested with field-collected measurements.
AISHWARYA BHATNAGAR
Autonomous surface detection and tracking for FMCW Snow Radar using field programmable gate arraysWhen & Where:
317 Nichols Hall
Committee Members:
Carl Leuschen, ChairChristopher Allen
Fernando Rodriguez-Morales
Abstract
Sea ice in polar regions is typically covered with a layer of snow. The thermal insulation properties and high albedo of the snow cover insulates the sea ice beneath it, maintaining low temperatures and limiting ice melt, and thus affecting sea ice thickness and growth rates. Remote sensing of snow cover thickness plays a major role in understanding the mass balance of sea ice, inter-annual variability of snow depth, and other factors which directly impact climate change. The Center for Remote Sensing of Ice Sheets (CReSIS) at the University of Kansas has developed an ultra-wide band FMCW Snow Radar used to measure snow thickness and map internal layers of polar firn. The radar’s deployment on high-endurance, fixed-wing aircraft makes it difficult to track the surface from these platforms, due to turbulence and a limited range window. In this thesis, an automated onboard real-time surface tracker for the snow radar is presented to detect the snow surface elevation from the aircraft and track changes in the surface elevation. For an FMCW radar to have a long-range (high altitude) capability, a reference chirp delaying ability is a necessity to maintain a relatively constant beat frequency. Currently, the radar uses a filter bank to bandpass the received IF signal and store the spectral power in each band by utilizing different Nyquist zones. During airborne missions in polar regions with the radar, the operator has to manually switch the filter banks one by one as the aircraft elevation from the surface increases. The work done in this thesis aims at eliminating the manual switching operation and providing the radar with surface detection, chirp delay, and a constant beat frequency feedback loop in order to enhance its long range capability and ensure autonomous operation.