From: johnson@ucsco.ucsc.edu (Tim Johnson)
Newsgroups: ba.seminars
Subject: Data Compression and Arithmetic Coding
Date: 22 Jul 1992 16:41:06 GMT
Organization: University of California, Santa Cruz
Distribution: ba
NNTP-Posting-Host: ucsco.ucsc.edu


===================================================
              UC Santa Cruz Extension

               is pleased to announce 

             a Three-day Seminar entitled
         Data Compression and Arithmetic Coding

            Monday-Wednesday, July 27-29.
                 9:00 AM to 5:00 PM

            on campus at the UC Santa Cruz
             (Merrill College, Room 102) 

===================================================

This course is intended for individuals interested 
in data compression systems and algorithms, who 
want a modern background in the key compression 
system components of data context modeling by 
application, adaptive statistics gathering, and 
encoding (decoding) events according to their own 
relative frequencies.  Particular emphasis is 
placed on high speed adaptive binary arithmetic 
codes suitable for any compression application.  
Such a technique is employed in the IBM 3490 tape 
drive control unit.

OVERVIEW
Arithmetic coding is a relatively new approach to 
encoding information for compression purposes.  
Arithmetic coding techniques have been developed to 
make it easy to adapt to the statistics of the file 
being compressed.  Techniques to model data for 
ordinary 8-bit data files, black-white images, and 
grey-scale images are discussed.

COURSE OUTLINE

MONDAY
-Introduction: data compression systems; 
applications, purposes, and components
-Theoretical aspects:  entropy of a source, 
stationary sources, dependent sources, and the 
advantages of context dependence;  
Relationship of information theoretical 
aspects to the engineering of practical data 
compression systems
-Coding:  prefix codes, Huffman codes, 
arithmetic codes, variable-to-fixed codes, 
run-length codes, and Golomb code;  
Comparisons of strengths and weaknesses
-FIFO arithmetic coding: general alphabets 
versus binary alphabets
-Encoding multi-symbol alphabets with binary 
codes.

TUESDAY
-Modeling versus coding:  two important 
requirements for achieving data compression; 
the data class, determining events, and useful 
context; converting the input data to 
statistical events for coding purposes
-The statistical aspects:  techniques for 
estimation of symbol frequencies; estimation 
compromises for coding purposes;  adaptation 
to symbol frequencies under stationary versus 
non-stationary assumptions; adapting in 
context-dependent environment; deceptively 
simple dynamic adaptation techniques for non-
stationary binary sources, and the adaptive Q-
Coder
-Example:  discrete domain; data compression of 
text documents and messages composed of 
strings of words; Huffman-based approach; Ziv-
Lempel coding; mixed-order Markov models;  
dictionary-based models; hybrid schemes; the 
DAFC algorithm and data compression for the 
IBM 3490 tape control unit

WEDNESDAY
-Example:  analog domain; pulse code 
modulation; information models; lossy versus 
lossless
-Compressing binary image data:  CCITT Group IV 
compression algorithm for facsimile; example 
of lossy compression of scanned documents by 
symbol-matching techniques; compression of bi-
level images by a simple model and one-pass 
adaptive binary arithmetic code
-Compressing grey-level images:  effect of 
transform approaches; an example information 
lossless approach using adaptive arithmetic 
coding; speech compression example by 
companding and lossless model with arithmetic 
coding
-Putting it together:  context model (data 
dependent), gathering data (independent of 
application) for statistics, and finally 
applying arithmetic coding for compressing out 
statistical redundancies

INSTRUCTOR

GLEN G. LANGDON, JR., Ph.D., is a professor of 
computer engineering at the University of 
California, Santa Cruz, and a former research staff 
member from the IBM Research Division's Almaden 
Research Center in San Jose, California.  He joined 
IBM in 1963 at the Endicott Development Laboratory, 
and received his Ph.D. from Syracuse University on 
an IBM Resident Study Fellowship.  His professional 
interests span logic design, computer design, 
computer architecture, image processing, arithmetic 
coding and hardware-implementable data compression 
techniques.  He is the author of the ACM Monograph 
Logic Design: A Review of Theory and Practice 
(Academic Press) and the textbook Computer Design 
(Computeach Press).  He holds thirteen patents, 
primarily in the area of computer design, 
arithmetic coding, and data compression.  He 
received, together with Jorma Rissanen, an IBM 
Outstanding Innovation Award for their 
contributions to arithmetic coding techniques.  He 
is a Fellow of the IEEE, is an active volunteer 
with the IEEE Computer Society, and is an evaluator 
for ABET for accrediting undergraduate programs in 
computer and electrical engineering.

FEE: $895 (EDP 921089).

LOCATION: University of California, Santa Cruz, 
Merrill College, Room 102. Call 408/472-6631 to 
receive a map and information about parking on 
campus.

DATES & TIMES: Monday-Wednesday, July 27-29.

ENROLLMENT/RESERVATIONS: To enroll by phone, to 
make a reservation, or to obtain any other 
information about this program, please (408) 
408/472-6631, or e-mail a message to 
shorba1@ucsco.ucsc.edu.