MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Doctoral Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Doctoral Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Functional composition and decomposition for signal processing

Author(s)
Demirtas, Sefa
Thumbnail
DownloadFull printable version (12.63Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Alan V. Oppenheim.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Functional composition, the application of one function to the results of another function, has a long history in the mathematics community, particularly in the context of polynomials and rational functions. This thesis articulates and explores a general framework for the use of functional composition in the context of signal processing. Its many potential applications to signal processing include utilization of the composition of simpler or lower order subfunctions to exactly or approximately represent a given function or data sequence. Although functional composition currently appears implicitly in a number of established signal processing algorithms, it is shown how the more general context developed and exploited in this thesis leads to significantly improved results for several important classes of functions that are ubiquitous in signal processing such as polynomials, frequency responses and discrete multivariate functions. Specifically, the functional composition framework is exploited in analyzing, designing and extending modular filters, separating marginalization computations into more manageable subcomputations and representing discrete sequences with fewer degrees of freedom than their length and region of support with implications for sparsity and efficiency.
Description
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (pages 175-180).
 
Date issued
2014
URI
http://hdl.handle.net/1721.1/89989
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Doctoral Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.