This proposal concerns an extention of the lossless Lempel-Ziv data compression algorithm to lossy algorithm using a rate- distortion type of fidelity criterion. The project will focus on three problems first, all related to data compression algorithm and estimation algorithms based on log convex functions: Identificattion of Log-Convex Parameters. Extension of Rissanen's Approach to the Estimation Problem. An Extimation Algorithm Motivated by the Lempel-Ziv Data Compression Algorithm. If possible, other work on data compression algorithms based on the Lempel-Ziv algorithm and modifications will be extended.//

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9003106
Program Officer
Aubrey M. Bush
Project Start
Project End
Budget Start
1990-09-15
Budget End
1994-08-31
Support Year
Fiscal Year
1990
Total Cost
$266,393
Indirect Cost
Name
University of Minnesota Twin Cities
Department
Type
DUNS #
City
Minneapolis
State
MN
Country
United States
Zip Code
55455