To compress or not to compress?
- Resource Type
- Conference
- Authors
- Buch, G.; Burkert, F.; Hagenauer, J.; Kukla, B.
- Source
- Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference GLOBAL internet'96 Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity. :198-203 1996
- Subject
- Communication, Networking and Broadcast Technologies
Computing and Processing
Components, Circuits, Devices and Systems
Aerospace
Decoding
Redundancy
Forward error correction
Image coding
Automatic repeat request
Data engineering
Viterbi algorithm
Image storage
Channel coding
Entropy
- Language
For practical communications which transmit finite blocks of source data over noisy channels, we question the common practice to compress (C) the source and then to add redundancy for error control. Rather we exploit the redundancy of the non-compressed source (NC) at the channel decoder by source-controlled channel-decoding. For a simple binary Markov source and a Rayleigh fading channel we simulated in a fair comparison the 2 systems (C and NC) using an ARQ/FEC scheme with rate-compatible punctured convolutional (RCPC) codes, Lempel-Ziv compression and a modified Viterbi decoder. We indicate parameter regions where it is better not to compress.