• Title/Summary/Keyword: Hangul Character Coding

Search Result 10, Processing Time 0.027 seconds

Analysis of Korean Language to Optimize the Hangul Character Coding for Information Processing and Communication (한글의 정보처리 및 통신용 부호 최적화를 위한 한국어 분석)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.3
    • /
    • pp.375-380
    • /
    • 2015
  • This paper is studied the Korean language to optimize the Hangul character coding for information processing in information terminal device and transmission in network. The paper analyzed Hangul character in Korean language and use frequency of each character. The paper also compared the analysis result to Hangul characters which are coded in standard in Korean character and Unicode. This study referred "Modern Korean Use Frequency Rate Survey Result" issued by The National Institute of the Korean Language. There are total 58,437 Korean words in the report. As a result of this paper, the Korean word 58,437ea are consisted of Hangul character total 1,540ea. The highest use frequency character is "다" and its use frequency to total use frequency rate is 15%. The lowest use character is "휫"and its use frequency to total use frequency rate is 0.00003%. The number of analyzed Hangul character 1,540 is less 7.2 times and 1.5 times than Korean and Unicode standard respectively.

7bits Hangul Jamo Coding system to consider of HDB-3 Data transmission processing efficiency (HDB-3 데이터전송처리 효율을 고려한 7비트 한글 자모 부호체계)

  • Hong, Wan-Pyo
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.6
    • /
    • pp.1044-1051
    • /
    • 2012
  • This paper proposed a new Hangul Jeongum Jamo coding system. To do it, the current Hangul Jeongum coding system was analyzed with the source coding rule of character. As a result of the study, the current Hangul Jeongum coding system should be changed because there are many violated codes in the coding system. When the proposed coding system for Hangul Jeongum coding system is applied, the datacommunication efficiency could be increased to 19.78%.

PARALLEL DYNAMIC CODING METHOD OF HANGUL TEXT

  • Min, Yong-Sik
    • Journal of applied mathematics & informatics
    • /
    • v.3 no.2
    • /
    • pp.157-168
    • /
    • 1996
  • This paper describes an efficient coding method for Ko-rean characters (alphabet) using a three-state transition graph. Par-allel hangul Dynamic Coding Method (PHDCM) compresses about 3.5 bits per Korean character compared with other coding techinques. When we ran the method on a MasPar machine it achieved a 49.314-fold speedup with 64 processors having 10 million orean characters

A Study on Effective Processing of Hangul for JBIG2 Coding (JBIG2 부호화에서의 한글의 효율적 처리에 관한 연구)

  • 강병택;김현민;고형화
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.6B
    • /
    • pp.1050-1059
    • /
    • 2000
  • In this paper, we propose a method to improve JBIG2 compression ratio which can be applied to Hangul text. Hangul character is composed of a few symbols which is called JASO, which needs inevitable increase of position information to be transmitted. To reduce this disadvantage, we have proposed an algorithm that generate aggregated symbol in combination of JASO symbols. Proposed algorithm shows better performance in Huffman coding than in arithmetic coding. In lossless coding, proposed algorithm showed 4.5∼16.7(%) improvement for Huffman coding and 2.9∼10.4(%) improvement for arithmetic coding. In lossy coding, proposed algorithm showed 3.7∼17.0(%) improvement for Huffman coding and 2.1∼10.5(%) improvement for arithmetic coding.

  • PDF

Considering the scrambling code of the line Study on the New Korea joint protection Standard Hangul character (회선부호의 스크램블링을 고려한 새로운 한국표준 한글글자마디부호에 관한 연구)

  • Park, Yo-Seph;Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.12
    • /
    • pp.1345-1354
    • /
    • 2015
  • This paper, information communication code standard($KS{\times}1001$, confirmation in 2004), as definded in Hangul Character Code Hangul AMI/HDB-3 the code set for the new system Hangul consonant and vowel tables presented. The result of the existing system and the code set ($4{\times}4$) bit source coding rules for comparing the frequency of use Hangul consonant and vowel tables(The National Institute of The Korea Language) and statistices showed that 44% of the data processing efficiency is improved.

A Study on the Hangul Character Code System for KS X 1001 Information Interchange considering AMI/HDB-3 Line Encoding and HDLC Flag (AMI/HDB-3 회선부호화 및 HDLC FLAG를 고려한 KS X 1001 정보교환용 한글낱자 부호체계 개선연구)

  • Woo, Je-Teak;Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.1
    • /
    • pp.65-72
    • /
    • 2015
  • AMI / HDB-3 method used a scrambling technique is used primarily for long distance data transmission line encoding. In this paper, information communication code standard (KS X 1001; 2014 confirmation), as defined in Hangul Character Code HDLC Flag bit or character stuffing at the data link layer and physical layer with respect to the code set for Hangul AMI / HDB-3 the code set for the new system to increase the data transmission efficiency Hangul consonant and vowel tables presented in terms of scrambling. The result of the existing system and the code set ($4{\times}4$) bit source coding rules for comparing the frequency of use Hangul consonant and vowel tables and statistics showed that about 22.01% of the data processing efficiency is improved.

PHDCM : Efficient Compression of Hangul Text in Parallel (PHDCM : 병렬 컴퓨터에서 한글 텍스트의 효율적인 축약)

  • Min, Yong-Sㅑk
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.2E
    • /
    • pp.50-56
    • /
    • 1995
  • This paper describes an efficient coding method for Korean characters using a three-state transition graph. To our knowledge, this is the first achievement of its kind. This new method, called the Paralle Hangul Dynamic Coding Method(PHDCM), compresses about 3.5 bits per a Korean character, which is more than 1 bit shorter than the conventional codes introduced thus far to achieve extensive code compression. When we ran the method on a MasPar machine, which is on SIMD SM (EFEW-PRAM)., it achieved a 49.314-fold speedup with 64 processors having 10 million Korean characters.

  • PDF

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

  • Min, Yong-Sik
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.1
    • /
    • pp.191-200
    • /
    • 1998
  • 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.

The Study on Lossy and Lossless Compression of Binary Hangul Textual Images by Pattern Matching (패턴매칭에 의한 이진 한글문서의 유.무손실 압축에 관한 연구)

  • 김영태;고형화
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.726-736
    • /
    • 1997
  • The textual image compression by pattern matching is a coding scheme that exploits the correlations between patterns. When we compress the Hangul (Korean character) text by patern matching, the collerations between patterns may decrease due to randoem contacts between phonemes. Therefore in this paper we separate connected phonemes to exploit effectively the corrlation between patterns by inducting the amtch. In the process of sequation, we decide whether the patterns have vowel component or not, and then vowels connected with consonant ae separated. When we compare the proposed algorithm with the existing algorith, the compression ratio is increased by 1.3%-3.0% than PMS[5] in lossy mode, by 3.4%-9.1% in lossless mode than that of SPM[7] which is submitted to standard committe for second generation binary compression algorithm.

  • PDF

Comparisons of Recognition Rates for the Off-line Handwritten Hangul using Learning Codes based on Neural Network (신경망 학습 코드에 따른 오프라인 필기체 한글 인식률 비교)

  • Kim, Mi-Young;Cho, Yong-Beom
    • Journal of IKEEE
    • /
    • v.2 no.1 s.2
    • /
    • pp.150-159
    • /
    • 1998
  • This paper described the recognition of the Off-line handwritten Hangul based on neural network using a feature extraction method. Features of Hangul can be extracted by a $5{\times}5$ window method which is the modified $3{\times}3$ mask method. These features are coded to binary patterns in order to use neural network's inputs efficiently. Hangul character is recognized by the consonant, the vertical vowel, and the horizontal vowel, separately. In order to verify the recognition rate, three different coding methods were used for neural networks. Three methods were the fixed-code method, the learned-code I method, and the learned-code II method. The result was shown that the learned-code II method was the best among three methods. The result of the learned-code II method was shown 100% recognition rate for the vertical vowel, 100% for the horizontal vowel, and 98.33% for the learned consonants and 93.75% for the new consonants.

  • PDF