2 Turbo Compression

Abstract – Turbo codes which performs very close to channel capacity in channel coding can be also used to obtain very efficient source coding schemes. In this paper lossless turbo compression algorithm has been presented. Turbo source coding can be very efficiently used in combination with channel coding applying the concept of incremental and decremental redundancy algorithm. Performance of turbo compression can be analyzed by modified ten Brick’s EXIT charts. I. INTRODUCTION AND BACKGROUND The theory of data compression was first formulated by Claude E. Shannon in his monumental work “A Mathematical Theory of Communication”, in 1948. He, as a first, stated the basics of source coding and established a fundamental limit to lossless data compression. This limit is called entropy rate and it is defined by the statistical distribution of information source. Since the time of invention o