Back to search

Georgia Institute of Technology

Fast Algorithms for Sampled Multiband Signals

Abstract

dc:description.abstract

Over the past several years, computational power has grown tremendously. This has led to two trends in signal processing. First, signal processing problems are now posed and solved using linear algebra, instead of traditional methods such as filtering and Fourier transforms. Second, problems are dealing with increasingly large amounts of data. Applying tools from linear algebra to large scale problems requires the problem to have some type of low-dimensional structure which can be exploited to perform the computations efficiently. One common type of signal with a low-dimensional structure is a multiband signal, which has a sparsely supported Fourier transform. Transferring this low-dimensional structure from the continuous-time signal to the discrete-time samples requires care. Naive approaches involve using the FFT, which suffers from spectral leakage. A more suitable method to exploit this low-dimensional structure involves using the Slepian basis vectors, which are useful in many problems due to their time-frequency localization properties. However, prior to this research, no fast algorithms for working with the Slepian basis had been developed. As such, practitioners often overlooked the Slepian basis vectors for more computationally efficient tools, such as the FFT, even in problems for which the Slepian basis vectors are a more appropriate tool. In this thesis, we first study the mathematical properties of the Slepian basis, as well as the closely related discrete prolate spheroidal sequences and prolate spheroidal wave functions. We then use these mathematical properties to develop fast algorithms for working with the Slepian basis, a fast algorithm for reconstructing a multiband signal from nonuniform measurements, and a fast algorithm for reconstructing a multiband signal from compressed measurements. The runtime and memory requirements for all of our fast algorithms scale roughly linearly with the number of samples of the signal.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Electrical and Computer Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2021

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Karnik, Santhosh
Advisor dc:contributor.advisor
  • Davenport, Mark A.
Committee members dc:contributor.committeemember
  • Romberg, Justin
  • McClellan, James
  • Heil, Christopher
  • Lacey, Michael

Subjects

dc:subject × 7

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/65108

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Karnik, Santhosh. Fast Algorithms for Sampled Multiband Signals. Doctoral thesis, Georgia Institute of Technology, 2021. http://hdl.handle.net/1853/65108