MIT Department of Electrical Engineering & Computer Science
Approximate Signal Processing
Hamid Nawab
Electrical and Computer Engineering, Boston University
Monday, October 28, 1996
4:00 PM (3:45 refreshments)
Edgerton Hall, Room 34-101
EECS Colloquium
Abstract
It is increasingly important to structure signal processing algorithms
and systems to allow trading off between the accuracy or optimality of
their results and their utilization of resources such as time, power,
bandwidth, and physical space. In any particular context, there are
typically a variety of heuristic approaches to managing these
tradeoffs. An objective of this talk is to suggest the development of
a more formal approach, which makes use of current research in
Computer Science on Approximate or Flexible Processing.
Previous work has led to several resource allocation strategies for
performing demanding tasks in dynamically evolving environments. These
strategies are particularly suited to applications in which algorithms
are available for performing incremental refinement of approximate
results. Our recent research indicates the enormous potential of
developing such algorithms for a variety of signal processing
functions -- transforms, filters, detectors, and coders. To argue this
point, several case studies from our research will be presented during
the talk. These results show progress toward the ultimate objective
of developing, within the context of signal processing and design, a
more general and rigorous framework for utilizing and expanding
approximate processing concepts and methodologies.
URL of this page:
http://www-eecs.mit.edu/AY96-97/events/10.html
Created: Oct 2, 1996
|
Modified: Jun 24, 1997
This announcement is from the MIT EECS 1996-97 archive.
|
Current events
To MIT EECS home page
|
Your comments
and inquiries are welcome.
