
NSF Org: |
CCF Division of Computing and Communication Foundations |
Recipient: |
|
Initial Amendment Date: | July 13, 1995 |
Latest Amendment Date: | July 13, 1995 |
Award Number: | 9501977 |
Award Instrument: | Standard Grant |
Program Manager: |
John Cozzens
CCF Division of Computing and Communication Foundations CSE Directorate for Computer and Information Science and Engineering |
Start Date: | July 15, 1995 |
End Date: | June 30, 1999 (Estimated) |
Total Intended Award Amount: | $134,628.00 |
Total Awarded Amount to Date: | $134,628.00 |
Funds Obligated to Date: |
|
History of Investigator: |
|
Recipient Sponsored Research Office: |
1200 E CALIFORNIA BLVD PASADENA CA US 91125-0001 (626)395-6219 |
Sponsor Congressional District: |
|
Primary Place of Performance: |
1200 E CALIFORNIA BLVD PASADENA CA US 91125-0001 |
Primary Place of
Performance Congressional District: |
|
Unique Entity Identifier (UEI): |
|
Parent UEI: |
|
NSF Program(s): |
CISE Research Resources, DES AUTO FOR MICRO & NANO SYS, COMPUTER SYSTEMS ARCHITECTURE, SIGNAL PROCESSING SYS PROGRAM |
Primary Program Source: |
|
Program Reference Code(s): |
|
Program Element Code(s): |
|
Award Agency Code: | 4900 |
Fund Agency Code: | 4900 |
Assistance Listing Number(s): | 47.070 |
ABSTRACT
The goal of this project is to develop reasonable complexity, source independent coding algorithms. Source independent algorithms are crucial to the design of robust systems for applications such as image coding and mobile communications. In applications of this type, the statistics of the source and channel in operation are typically unknown a priori, and the performance of the strategy employed is sensitive to those unknown statistics. The approach taken is the two-stage approach developed in the source coding literature. Given a space of possible sources and a particular coding strategy (e.g., VQ, DCT-based transform codes, etc.), for each source in the space there exists an optimal code. Designing a single code is equivalent to quantizing the space of possible codes to 0 bits; the entire space of optimal codes is approximated by a single code that does well on average across the data. The two-stage coding literature demonstrates that in general we should quantize the space of possible codes more finely. Some of the rate should be spent on describing which code, in a family of codes, should be used on the source in operation. Specific projects being completed in this research include the development of a universal DCT code compatible with existing JPEG and MPEG image and video coding standards, a universal KLT code, a universal wavelet packet code, and a universal channel code. The main objectives of the education plan are to develop and maintain an exciting atmosphere of active learning for undergraduate and graduate students. This objective is being accomplished through innovative programs geared at helping students to participate fully in their own education and by developing an atmosphere that encourages the maximum possible exchange between students, faculty, and members of local industry.
Please report errors in award information by writing to: awardsearch@nsf.gov.