DocumentCode :
915893
Title :
Simple data compression by redundancy replacement (Corresp.)
Author :
Wilson, James ; Henry, W.
Volume :
17
Issue :
4
fYear :
1971
fDate :
7/1/1971 12:00:00 AM
Firstpage :
500
Lastpage :
503
Abstract :
A redundancy replacement system is described. Whenever m bits of an n -bit word are identical with corresponding bits in the preceding word, these bits are replaced by m bits from a second source. An extra bit is added to each word to signal the substitution. If words with m redundant bits occur with probability P(m) , one gains an extra channel of average capacity mP(m) -- 1 . The system is analyzed as a data compressor that enhances the source entropy by replacing redundancies. An effective data compression of 2.11 is obtained for typical voice sources.
Keywords :
Data compression; Source coding; Bismuth; Data compression; Error correction; Indium tin oxide; Pattern recognition; Probability; Redundancy; Riccati equations; Signal processing; Testing;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1971.1054653
Filename :
1054653
Link To Document :
بازگشت