text-only page produced automatically by Usablenet Assistive Skip all navigation and go to page content Skip top navigation and go to directorate navigation Skip top navigation and go to page navigation
National Science Foundation
Awards
design element
Search Awards
Recent Awards
Presidential and Honorary Awards
About Awards
Grant Policy Manual
Grant General Conditions
Cooperative Agreement Conditions
Special Conditions
Federal Demonstration Partnership
Policy Office Website



Award Abstract #1318093

CIF: Small: Collaborative Research: Combinatorial Joint Source-Channel Coding

NSF Org: CCF
Division of Computing and Communication Foundations
divider line
Initial Amendment Date: June 26, 2013
divider line
Latest Amendment Date: February 18, 2015
divider line
Award Number: 1318093
divider line
Award Instrument: Standard Grant
divider line
Program Manager: Richard Brown
CCF Division of Computing and Communication Foundations
CSE Direct For Computer & Info Scie & Enginr
divider line
Start Date: July 1, 2013
divider line
End Date: December 31, 2017 (Estimated)
divider line
Awarded Amount to Date: $257,975.00
divider line
Investigator(s): Arya Mazumdar arya@cs.umass.edu (Principal Investigator)
divider line
Sponsor: University of Minnesota-Twin Cities
200 OAK ST SE
Minneapolis, MN 55455-2070 (612)624-5599
divider line
NSF Program(s): COMM & INFORMATION THEORY,
COMM & INFORMATION FOUNDATIONS
divider line
Program Reference Code(s): 7923, 7937, 7935, 9251
divider line
Program Element Code(s): 7935, 7797

ABSTRACT

Algorithms for lossy/lossless compression and error-correcting codes have been at the core of the digital revolution. This project focuses on the particular set of applications in which both lossy compression and noise resilience are required. Examples include storage of high resolution imagery on non-perfect semiconductor (flash) memory and real-time video surveillance over jammed or noisy channels.

The state-of-the art solution is "separation": serial concatenation of an off-the-shelf compression algorithm with an off-the-shelf error-correcting code. However, as shown recently by the investigators, for worst-case guarantees the separated solution is far from being (even asymptotically) optimal. This provides the principal motivation for a multifaceted investigation of the combinatorial, geometric, algebraic and information theoretic aspects of the joint source-channel coding problem.

The breadth of mathematics will be appealing to young researchers with a wide variety of backgrounds, and will help attract new talent to the field. Creation of sophisticated source-channel codes with dependable guarantees is expected to have technological impact in military, space exploration, natural science, and consumer applications.

 

Please report errors in award information by writing to: awardsearch@nsf.gov.

 

 

Print this page
Back to Top of page
  FUNDING   AWARDS   DISCOVERIES   NEWS   PUBLICATIONS   STATISTICS   ABOUT NSF   FASTLANE  
Research.gov  |  USA.gov  |  National Science Board  |  Recovery Act  |  Budget and Performance  |  Annual Financial Report
Web Policies and Important Links  |  Privacy  |  FOIA  |  NO FEAR Act  |  Inspector General  |  Webmaster Contact  |  Site Map
National Science Foundation Logo
The National Science Foundation, 4201 Wilson Boulevard, Arlington, Virginia 22230, USA
Tel: (703) 292-5111, FIRS: (800) 877-8339 | TDD: (800) 281-8749
  Text Only Version