AN EFFICIENT CODING METHODS FOR THE TWO COMPOSITION TYPES OF THE KOREAN ALPHABET ON A MASPAR MACHINE

  • Min, Yong-Sik (Department of Computer Science Hoseo University)
  • Published : 1998.03.01

Abstract

There are two types of composition systems for the Korean alphabet: a combined system and a composite system. This paper decribes an efficient coding method for both of these two types. Using this coding method with the combined system yields about 10.5% code-length savings per a Korean character while it yields about 45% savings with the composite system. In other words the coding method produces a better result(i.e. 34.5% better) with the composite system than with the combined system. The simulation has been performed on a MasPar machine having 64 processors. The results show that the combined system achieved a 45.851-fold speedup while the composite system achieved a 47.274-fold speedup.

Keywords

References

  1. Journal of Algorithm v.6 no.2 Dynamic Huffman Coding Knuth,Donald E.
  2. Information Theory and Coding Abramson;Roman
  3. Parallel Sorting Algorithm Akl, Selim G.
  4. Proceedings of Data Compression Is Huffman Coding Dead Bookstein,A;Klein,S.T.
  5. Journal of KCI v.9 no.3 A Study on the Composition of Compact Code using OCM Kim,K.T.;Min,Y.S.
  6. Journal of KCI v.14 no.6 A Study on an Efficient Coding of Hangul Kim,K.T.;Min,Y.S.
  7. Coding and Information Theory S.Roman
  8. Journal of The Acoustical Society of Korea v.14 no.1 PDOCM: Fast Text Compression on MasPar Machine Min,Y.S.
  9. Journal of The Acoustical Society of Korea v.14 no.1E PHDCM:Efficient Compression of Hangul Text in Parallel Min,Y.S.
  10. Journal of Distributed and Parallel Computing v.4 Parallel Sorting by Regular Sampling Shi. Hanmao;Schaffer;Jonathm