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

Andrew Riachi

An Investigation Into The Memory Consumption of Web Browsers and A Memory Profiling Tool Using Linux Smaps

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Prasad Kulkarni, Chair
Perry Alexander
Drew Davidson
Heechul Yun

Abstract

Web browsers are notorious for consuming large amounts of memory. Yet, they have become the dominant framework for writing GUIs because the web languages are ergonomic for programmers and have a cross-platform reach. These benefits are so enticing that even a large portion of mobile apps, which have to run on resource-constrained devices, are running a web browser under the hood. Therefore, it is important to keep the memory consumption of web browsers as low as practicable.

In this thesis, we investigate the memory consumption of web browsers, in particular, compared to applications written in native GUI frameworks. We introduce smaps-profiler, a tool to profile the overall memory consumption of Linux applications that can report memory usage other profilers simply do not measure. Using this tool, we conduct experiments which suggest that most of the extra memory usage compared to native applications could be due the size of the web browser program itself. We discuss our experiments and findings, and conclude that even more rigorous studies are needed to profile GUI applications.


Elizabeth Wyss

A New Frontier for Software Security: Diving Deep into npm

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Drew Davidson, Chair
Alex Bardas
Fengjun Li
Bo Luo
J. Walker

Abstract

Open-source package managers (e.g., npm for Node.js) have become an established component of modern software development. Rather than creating applications from scratch, developers may employ modular software dependencies and frameworks--called packages--to serve as building blocks for writing larger applications. Package managers make this process easy. With a simple command line directive, developers are able to quickly fetch and install packages across vast open-source repositories. npm--the largest of such repositories--alone hosts millions of unique packages and serves billions of package downloads each week. 

However, the widespread code sharing resulting from open-source package managers also presents novel security implications. Vulnerable or malicious code hiding deep within package dependency trees can be leveraged downstream to attack both software developers and the end-users of their applications. This downstream flow of software dependencies--dubbed the software supply chain--is critical to secure.

This research provides a deep dive into the npm-centric software supply chain, exploring distinctive phenomena that impact its overall security and usability. Such factors include (i) hidden code clones--which may stealthily propagate known vulnerabilities, (ii) install-time attacks enabled by unmediated installation scripts, (iii) hard-coded URLs residing in package code, (iv) the impacts of open-source development practices, (v) package compromise via malicious updates, (vi) spammers disseminating phishing links within package metadata, and (vii) abuse of cryptocurrency protocols designed to reward the creators of high-impact packages. For each facet, tooling is presented to identify and/or mitigate potential security impacts. Ultimately, it is our hope that this research fosters greater awareness, deeper understanding, and further efforts to forge a new frontier for the security of modern software supply chains. 


Alfred Fontes

Optimization and Trade-Space Analysis of Pulsed Radar-Communication Waveforms using Constant Envelope Modulations

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Patrick McCormick, Chair
Shannon Blunt
Jonathan Owen


Abstract

Dual function radar communications (DFRC) is a method of co-designing a single radio frequency system to perform simultaneous radar and communications service. DFRC is ultimately a compromise between radar sensing performance and communications data throughput due to the conflicting requirements between the sensing and information-bearing signals.

A novel waveform-based DFRC approach is phase attached radar communications (PARC), where a communications signal is embedded onto a radar pulse via the phase modulation between the two signals. The PARC framework is used here in a new waveform design technique that designs the radar component of a PARC signal to match the PARC DFRC waveform expected power spectral density (PSD) to a desired spectral template. This provides better control over the PARC signal spectrum, which mitigates the issue of PARC radar performance degradation from spectral growth due to the communications signal. 

The characteristics of optimized PARC waveforms are then analyzed to establish a trade-space between radar and communications performance within a PARC DFRC scenario. This is done by sampling the DFRC trade-space continuum with waveforms that contain a varying degree of communications bandwidth, from a pure radar waveform (no embedded communications) to a pure communications waveform (no radar component). Radar performance, which is degraded by range sidelobe modulation (RSM) from the communications signal randomness, is measured from the PARC signal variance across pulses; data throughput is established as the communications performance metric. Comparing the values of these two measures as a function of communications symbol rate explores the trade-offs in performance between radar and communications with optimized PARC waveforms.


Qua Nguyen

Hybrid Array and Privacy-Preserving Signaling Optimization for NextG Wireless Communications

When & Where:


Zoom Defense, please email jgrisafe@ku.edu for link.

Committee Members:

Erik Perrins, Chair
Morteza Hashemi
Zijun Yao
Taejoon Kim
KC Kong

Abstract

This PhD research tackles two critical challenges in NextG wireless networks: hybrid precoder design for wideband sub-Terahertz (sub-THz) massive multiple-input multiple-output (MIMO) communications and privacy-preserving federated learning (FL) over wireless networks.

In the first part, we propose a novel hybrid precoding framework that integrates true-time delay (TTD) devices and phase shifters (PS) to counteract the beam squint effect - a significant challenge in the wideband sub-THz massive MIMO systems that leads to considerable loss in array gain. Unlike previous methods that only designed TTD values while fixed PS values and assuming unbounded time delay values, our approach jointly optimizes TTD and PS values under realistic time delays constraint. We determine the minimum number of TTD devices required to achieve a target array gain using our proposed approach. Then, we extend the framework to multi-user wideband systems and formulate a hybrid array optimization problem aiming to maximize the minimum data rate across users. This problem is decomposed into two sub-problems: fair subarray allocation, solved via continuous domain relaxation, and subarray gain maximization, addressed via a phase-domain transformation.

The second part focuses on preserving privacy in FL over wireless networks. First, we design a differentially-private FL algorithm that applies time-varying noise variance perturbation. Taking advantage of existing wireless channel noise, we jointly design differential privacy (DP) noise variances and users transmit power to resolve the tradeoffs between privacy and learning utility. Next, we tackle two critical challenges within FL networks: (i) privacy risks arising from model updates and (ii) reduced learning utility due to quantization heterogeneity. Prior work typically addresses only one of these challenges because maintaining learning utility under both privacy risks and quantization heterogeneity is a non-trivial task. We approach to improve the learning utility of a privacy-preserving FL that allows clusters of devices with different quantization resolutions to participate in each FL round. Specifically, we introduce a novel stochastic quantizer (SQ) that ensures a DP guarantee and minimal quantization distortion. To address quantization heterogeneity, we introduce a cluster size optimization technique combined with a linear fusion approach to enhance model aggregation accuracy. Lastly, inspired by the information-theoretic rate-distortion framework, a privacy-distortion tradeoff problem is formulated to minimize privacy loss under a given maximum allowable quantization distortion. The optimal solution to this problem is identified, revealing that the privacy loss decreases as the maximum allowable quantization distortion increases, and vice versa.

This research advances hybrid array optimization for wideband sub-THz massive MIMO and introduces novel algorithms for privacy-preserving quantized FL with diverse precision. These contributions enable high-throughput wideband MIMO communication systems and privacy-preserving AI-native designs, aligning with the performance and privacy protection demands of NextG networks.


Arin Dutta

Performance Analysis of Distributed Raman Amplification with Different Pumping Configurations

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Rongqing Hui, Chair
Morteza Hashemi
Rachel Jarvis
Alessandro Salandrino
Hui Zhao

Abstract

As internet services like high-definition videos, cloud computing, and artificial intelligence keep growing, optical networks need to keep up with the demand for more capacity. Optical amplifiers play a crucial role in offsetting fiber loss and enabling long-distance wavelength division multiplexing (WDM) transmission in high-capacity systems. Various methods have been proposed to enhance the capacity and reach of fiber communication systems, including advanced modulation formats, dense wavelength division multiplexing (DWDM) over ultra-wide bands, space-division multiplexing, and high-performance digital signal processing (DSP) technologies. To maintain higher data rates along with maximizing the spectral efficiency of multi-level modulated signals, a higher Optical Signal-to-Noise Ratio (OSNR) is necessary. Despite advancements in coherent optical communication systems, the spectral efficiency of multi-level modulated signals is ultimately constrained by fiber nonlinearity. Raman amplification is an attractive solution for wide-band amplification with low noise figures in multi-band systems.

Distributed Raman Amplification (DRA) have been deployed in recent high-capacity transmission experiments to achieve a relatively flat signal power distribution along the optical path and offers the unique advantage of using conventional low-loss silica fibers as the gain medium, effectively transforming passive optical fibers into active or amplifying waveguides. Also, DRA provides gain at any wavelength by selecting the appropriate pump wavelength, enabling operation in signal bands outside the Erbium doped fiber amplifier (EDFA) bands. Forward (FW) Raman pumping configuration in DRA can be adopted to further improve the DRA performance as it is more efficient in OSNR improvement because the optical noise is generated near the beginning of the fiber span and attenuated along the fiber. Dual-order FW pumping scheme helps to reduce the non-linear effect of the optical signal and improves OSNR by more uniformly distributing the Raman gain along the transmission span.

The major concern with Forward Distributed Raman Amplification (FW DRA) is the fluctuation in pump power, known as relative intensity noise (RIN), which transfers from the pump laser to both the intensity and phase of the transmitted optical signal as they propagate in the same direction. Additionally, another concern of FW DRA is the rise in signal optical power near the start of the fiber span, leading to an increase in the non-linear phase shift of the signal. These factors, including RIN transfer-induced noise and non-linear noise, contribute to the degradation of system performance in FW DRA systems at the receiver.

As the performance of DRA with backward pumping is well understood with relatively low impact of RIN transfer, our research  is focused on the FW pumping configuration, and is intended to provide a comprehensive analysis on the system performance impact of dual order FW Raman pumping, including signal intensity and phase noise induced by the RINs of both 1st and the 2nd order pump lasers, as well as the impacts of linear and nonlinear noise. The efficiencies of pump RIN to signal intensity and phase noise transfer are theoretically analyzed and experimentally verified by applying a shallow intensity modulation to the pump laser to mimic the RIN. The results indicate that the efficiency of the 2nd order pump RIN to signal phase noise transfer can be more than 2 orders of magnitude higher than that from the 1st order pump. Then the performance of the dual order FW Raman configurations is compared with that of single order Raman pumping to understand trade-offs of system parameters. The nonlinear interference (NLI) noise is analyzed to study the overall OSNR improvement when employing a 2nd order Raman pump. Finally, a DWDM system with 16-QAM modulation is used as an example to investigate the benefit of DRA with dual order Raman pumping and with different pump RIN levels. We also consider a DRA system using a 1st order incoherent pump together with a 2nd order coherent pump. Although dual order FW pumping corresponds to a slight increase of linear amplified spontaneous emission (ASE) compared to using only a 1st order pump, its major advantage comes from the reduction of nonlinear interference noise in a DWDM system. Because the RIN of the 2nd order pump has much higher impact than that of the 1st order pump, there should be more stringent requirement on the RIN of the 2nd order pump laser when dual order FW pumping scheme is used for DRA for efficient fiber-optic communication. Also, the result of system performance analysis reveals that higher baud rate systems, like those operating at 100Gbaud, are less affected by pump laser RIN due to the low-pass characteristics of the transfer of pump RIN to signal phase noise.


Audrey Mockenhaupt

Using Dual Function Radar Communication Waveforms for Synthetic Aperture Radar Automatic Target Recognition

When & Where:


Nichols Hall, Room 246 (Executive Conference Room)

Committee Members:

Patrick McCormick, Chair
Shannon Blunt
Jon Owen


Abstract

Pending.


Rich Simeon

Delay-Doppler Channel Estimation for High-Speed Aeronautical Mobile Telemetry Applications

When & Where:


Eaton Hall, Room 2001B

Committee Members:

Erik Perrins, Chair
Shannon Blunt
Morteza Hashemi
Jim Stiles
Craig McLaughlin

Abstract

The next generation of digital communications systems aims to operate in high-Doppler environments such as high-speed trains and non-terrestrial networks that utilize satellites in low-Earth orbit. Current generation systems use Orthogonal Frequency Division Multiplexing modulation which is known to suffer from inter-carrier interference (ICI) when different channel paths have dissimilar Doppler shifts.

A new Orthogonal Time Frequency Space (OTFS) modulation (also known as Delay-Doppler modulation) is proposed as a candidate modulation for 6G networks that is resilient to ICI. To date, OTFS demodulation designs have focused on the use cases of popular urban terrestrial channel models where path delay spread is a fraction of the OTFS symbol duration. However, wireless wide-area networks that operate in the aeronautical mobile telemetry (AMT) space can have large path delay spreads due to reflections from distant geographic features. This presents problems for existing channel estimation techniques which assume a small maximum expected channel delay, since data transmission is paused to sound the channel by an amount equal to twice the maximum channel delay. The dropout in data contributes to a reduction in spectral efficiency.

Our research addresses OTFS limitations in the AMT use case. We start with an exemplary OTFS framework with parameters optimized for AMT. Following system design, we focus on two distinct areas to improve OTFS performance in the AMT environment. First we propose a new channel estimation technique using a pilot signal superimposed over data that can measure large delay spread channels with no penalty in spectral efficiency. A successive interference cancellation algorithm is used to iteratively improve channel estimates and jointly decode data. A second aspect of our research aims to equalize in delay-Doppler space. In the delay-Doppler paradigm, the rapid channel variations seen in the time-frequency domain is transformed into a sparse quasi-stationary channel in the delay-Doppler domain. We propose to use machine learning using Gaussian Process Regression to take advantage of the sparse and stationary channel and learn the channel parameters to compensate for the effects of fractional Doppler in which simpler channel estimation techniques cannot mitigate. Both areas of research can advance the robustness of OTFS across all communications systems.


Past Defense Notices

Dates

SREELAKSHMI PENMETSA

Design of 10bit Pipeline ADC

When & Where:


2001B Eaton Hall

Committee Members:

Yang Yi, Chair
Glenn Prescott
James Rowland


Abstract

A 10 bit pipeline ADC has been designed using three 4bit SAR stages in pipeline in IBM 180nm CMOS IC Technology using Cadence Spectre simulator. The ADC runs at 20Msamples/sec speed thereby handing signals up to 10MHz bandwidth. The 20Msamples/sec, 10bit ADC is a state of the art design in this class of ADCs at 180nm Technology node. SAR ADCs run at Nyquist rate and they consume lower power (~50fJ/conversion) compared to other popular ADCs – Delta Sigma ADCs(~90fJ/conversion) and Flash ADCs. Secondly SAR ADCs do not employ op-amp or any other block that can’t be easily scaled with technology and hence it is easily portable saving designer’s effort. It therefore becomes an ideal candidate for battery run mobile devices that require intermediate resolution (9-12 bits) and intermediate speed (10-50MS/s). Each SAR stage has a sampler, comparator, SAR logic, Capacitive DAC and synchronizer blocks. The pipeline ADC is built using three SAR stages in pipeline and Residue Amplifiers in between two successive SAR stages. This project goes through the design cycle of the complete ADC- Schematic design, Schematic simulations, Layout and Parasitic extracted simulations.


DAKOTA HENKE

Robust, Optimal, and Adaptive Pulse Compression for FM Waveforms

When & Where:


129 Nichols

Committee Members:

Shannon Blunt, Chair
Chris Allen
Jim Stiles


Abstract

The least-squares mismatched filter (LS MMF) is a pulse compression method used to suppress range sidelobes. Though initially derived for codes, this work provides a description of the adjustments needed such that the LS MMF can be applied to FM waveforms, a topic that had not previously been published (to the best of our knowledge). Additionally, the effects of range straddling and Doppler on the LS MMF are examined. The effects of straddling on mismatch loss is well known, what is less appreciated is the effect straddling has on the range sidelobes. This work outlines methods that alleviate some of the degradation in sidelobe levels due to straddling. Making the LS MMF more robust to Doppler is also investigated. Adaptive Pulse Compression (APC) is another pulse compression algorithm that has been adjusted to be applicable to FM waveforms. Although the derivation of these adjustments is not part of this work, the analysis via simulation and measured data are. The effects of straddling and Doppler on APC are also investigated, and improvements to APC are analyzed. Lastly, these pulse compression methods are applied to measured data, showing their viability for application in real FM-based systems. 


ZHENYU HU

Realizing Optical OFDM and Nyquist Pulse Modulation through Real-Time DSP

When & Where:


246 Nichols Hall

Committee Members:

Ron Hui, Chair
Chris Allen
Yang Yi


Abstract

Optical orthogonal frequency division multiplexing (OFDM) offers high spectral efficiency, resilience to fiber distortion, and simple equalization that make it a suitable technology for next generation optical communication systems. The suitability of optical OFDM to convey data and services in the next generation of optical networks has been extensively investigated for both direct and coherent detection. The key point of OFDM is that all sub-carriers in frequency domain are orthogonal to each other in order to completely eliminate the inter-channel interface (ICI). Nyquist pulse modulation is relatively new technique in optical communication, but the format is very similar to OFDM. It can be derived by simply interchanging time and frequency domain for orthogonal sub-carriers. Therefore, Nuquist pulse modulation could be referred an orthogonal time division multiplexing (OTDM) technique. 
In this project, we investigate the design of a field programmable gate array (FPGA) based optical OFDM modulation and Nyquist pulse modulation transmitters implementing digital signal processing. The transmitters were utilized to generate QAM-OFDM signals and QAM-Nyquist signals. We study the impact of different IFFT algorithms for OFDM and different FIR filter orders for Nyquist on the system performance. In addition to that, we make some comparisons between these two modulation techniques in terms of resource requirements on FPGA, spectral efficiency and peak-to-power ratio. 


ADITYA KALLURI

GUI Application Aiding the Design of Super-Heterodyne Receiver

When & Where:


2001B Eaton Hall

Committee Members:

Jim Stiles, Chair
Ron Hui
Glenn Prescott


Abstract

Super-Heterodyne receiver is still a predominant receiver architecture used today. In this receiver design one of the most important design trade-offs is the selection of IF frequency. The IF frequency should be low because at the higher (GHz) frequencies the signal processing circuits performs poorly and the cost goes higher. Selectivity of the receiver also affects the IF frequency as the bandwidth of the filter increases with the IF frequency so that the adjacent signals may not get enough attenuation. Another reason which makes selection of IF frequency more complicate is, it should be free from interference and we could achieve this by getting enough attenuation for Image and Murphy signals which creates mixer product terms exactly at the IF filter center frequency. 
In this project an application has been developed in the Mathematica environment which reduces the complexity in rejecting all the Murphy signals and in selecting the IF frequency. And selection of IF frequency using the application is discussed. An interface has been developed with the filter response with Image and all the Murphy signal bands positioned on it. Filter responses are shown for various filter types and orders, as well as Image and Murphy signal bands are shown for Low side, High side and Up conversion tuning solutions with the values of most problematic frequency signals in each band. 

 

 


MYUNG KANG

A Novel Security Mechanism to Protect Against Maliciously Programmed USB Devices

When & Where:


2001B Eaton Hall

Committee Members:

Hossein Saiedian, Chair
Fengjun Li
Bo Luo


Abstract

Universal Serial Bus (USB) is a popular choice of interfacing computer systems with peripherals. With the increasing support of modern operating systems, it is now truly plug-and-play for most USB devices. However, this great convenience comes with a risk which can allow a device to perform arbitrary actions at any time while it is connected. Researchers have confirmed that a simple USB device such as a mass storage device can be disguised to have an additional function such as a keyboard. An unauthorized keyboard attachment can compromise the security of the host by allowing arbitrary keystrokes to enter the host. This undetectable threat differs from traditional virus that spreads via USB devices due to the location it is stored and the way it behaves. Therefore, it is impossible for current file-level antivirus to be aware of such risk. Currently, there is no commercially available protection for USB devices other than mass storage devices. We propose a novel way to protect the host via a software/hardware solution we named a USBWall. USBWall uses BeagleBoard Black (BBB), a low-cost open-source computer, to act as a middleware to enumerate the devices on behalf of the host. We developed a program to assist the user to identify the risk of a device. We present a simulated USB device with malicious firmware to the USBWall. Based on the results, we confirm that using the USBWall to enumerate USB devices on behalf of the host eliminates risks to the hosts.


SIDDHARTHA BISWAS

MBProtector: Dynamic Memory Bandwidth Protection Tool

When & Where:


246 Nichols Hall

Committee Members:

Heechul Yun, Chair
Victor Frost
Prasad Kulkarni
Bo Luo

Abstract

Computer systems have moved from unicore platforms to multicore platforms in modern days as they offer higher performance and efficiency. However, when multiple programs are executed in parallel on different cores on a multicore platform, performance isolation among the programs is difficult to achieve because of contention in shared hardware resources. This is problematic for real-time applications where a certain performance guarantee must be provided. 

In this work, we first present a case study that depicts the difficulties faced by a memory intensive real-time application, WebRTC---an open source, plugin free communication framework that provides the capability of Real-Time Communications(RTC) to browsers and mobile applications---when running in a multi-core plat-form along with other memory intensive co-running applications. We then present a tool, MBProtector that dynamically protects the performance of memory intensive code sectors in real-time applications. MBProtector uses BWLOCK, a mechanism for memory bandwidth control, and Pin, a binary instrumentation framework, to automatically insert BWLOCKs in memory intensive code sections in program binary. Our evaluation shows that the tool achieves up to 60% performance improvement in WebRTC. 


MEENAKSHI MISHRA

Task Relationship Modeling in Lifelong Multitask Learning

When & Where:


246 Nichols Hall

Committee Members:

Luke Huan, Chair
Arvin Agah
Swapan Chakrabarti
Ron Hui
Zhou Wang

Abstract

Multitask Learning with task relationship modeling is a learning framework which identifies and shares training information among multiple related tasks to improve the generalization error of each task. The utilization of task relationships in static multitask learning framework, where all the tasks are known beforehand and all the data is present before the training, has been studied in considerable detail for past several years. However, in the case of lifelong multitask learning, where the tasks arrive in an online fashion and information about all the tasks is not known beforehand, modeling the task relationship is very challenging. The main contribution of this thesis is to propose a framework for modeling task relationships in lifelong multitask learning. The task relationship models in lifelong multitask learning needs to be flexible and dynamic such that it can be easily updated with each new task coming in. Also, a new task needs to readily learn its position in the existing task network using the task relationship model. Traditionally, task relationships are represented using fixed sized matrices, which describe the task network. These matrices are not capable of dynamically changing with each incoming task, and can be rather expensive to update. Here, we propose learning functions to represent the relationships between tasks. Learning functions is faster and computationally less expensive for depicting the task relationship models. The functions partition the task space such that the similar tasks remain in the same region and enforce similar tasks to depend on similar features. Learning both the task parameters and relationships is done in a supervised manner. In this thesis, we show that the algorithm we developed provides significantly better accuracy and is much faster than the state of the art lifelong learning algorithm. For some dataset, our algorithm provides a better accuracy than even the static multitask learning method.


ERIK HORNBERGER

Partially Constrained Adaptive Beamforming

When & Where:


246 Nichols Hall

Committee Members:

Shannon Blunt, Chair
Erik Perrins
James Stiles


Abstract

The ReIterative Super-Resolution (RISR) was developed based on an iterative implementation of the Minimum Mean Squared Error (MMSE) estimator. A novel approach to direction of arrival estimation, coined partially constrained beamforming is introduced by building from existing work on the RISR algorithm. First, RISR is rederived with the addition of a unit gain constraint, with the result dubbed Gain Constrained RISR (GC-RISR), but the outcome exhibits some loss in resolution, so middle ground is sought between GC-RISR and RISR. By taking advantage of the similarstructure of RISR and GC-RISR, they can be combined using a geometric mean, and a weighting term is added to form a partially constrained version of RISR, which wedenote as PC-RISR. Simulations are used to characterize PC-RISR’s performance, where it is shown that the geometric weighting term can be used to control convergence. It is also demonstrated that this weighting term enables increased super-resolution capability compared to RISR, improves robustness to low sample support for super-resolving signals with low SNR, and the ability to detect and super-resolve signals with an SNR as low as -10dB given higher sample support.


THERESA STUMPF

A Wideband Direction of Arrival Technique for Multibeam, Wide-Swath Imaging of Ice Sheet Basal Morphology

When & Where:


317 Nichols Hall

Committee Members:

Prasad Gogineni, Chair
Carl Leuschen
John Paden


Abstract

Multichannel, ice sounder data can be processed to three-dimensionally map ice sheet bed topography and basal reflectivity using tomographic imaging techniques. When ultra-wideband (UWB) signals are used to interrogate a glaciological target, fine resolution maps can be obtained. These data sets facilitate both process studies of ice sheet dynamics and also continental-scale ice sheet modeling needed to predict future sea level. The socioeconomic importance of these data as well as the cost and logistical challenge of procuring them justifies the need to image ice sheet basal morphology over a wider swath. Imaging wide swaths with UWB signals poses challenges for the array processing methods that have been used to localize scattering in the cross-track dimension. Both MUltiple SIgnal Classification (MUSIC) and the Maximum Likelihood Estimator (MLE) have been applied to the ice sheet tomography problem. These techniques are formulated assuming a narrowband model of the array that breaks down in wideband signal environments when the direction of arrival (DOA) increases further off nadir. 
The Center for Remote Sensing of Ice Sheets (CReSIS) developed a UWB multichannel SAR with a large cross-track array for sounding and imaging polar ice from a Basler BT-67 aircraft. In 2013, this sensor collected data in a multibeam mode over the West Antarctic Ice Sheet to demonstrate wide swath imaging. To reliably estimate the arrival angles of echoes from the edges of the swath, a parametric space-time direction of arrival estimator was developed that obtains an estimate of the DOA by fitting the observed space-time covariance structure to a model. This thesis focuses on the development and optimization of the algorithm and describes its predicted performance based on simulation. Its measured performance is analyzed with 3D tomographic basal maps of an ice stream in West Antarctica that were generated using the technique. 


AKSHATHA RAO

Fountain codes

When & Where:


250 Nichols Hall

Committee Members:

Erik Perrins, Chair
Shannon Blunt
Victor Frost
Jonathan Brumberg

Abstract

Fountain codes are forward-error correcting codes suitable for erasure channels. A binary erasure channel is a memoryless channel, in which the symbols are either transmitted correctly or they are erased. The advantage of fountain codes is that it requires few encoded symbols for decoding. The source symbols can be decoded using any set of encoded symbols. Since fountain codes are rateless, they can adapt to changing channel conditions. They are beneficial for broadcasting and multicasting applications where channels have different erasure probability. 
The project involves the implementation of two different fountain codes: LT code and Raptor code. 
The goal of the project is to measure the performance of the code based on how many encoded symbols are required for successful decoding. The encoders and decoders for the two codes are designed in Matlab. The number of encoded symbols required for decoding of the source symbols for different degree distributions are plotted.