• Title/Summary/Keyword: Hangul Code

Search Result 72, Processing Time 0.028 seconds

An Analysis on the Korean Language for Optimum Transmission of Hangul Code (한글 부호의 최적화 전송을 위한 한국어 낱자 분석)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.1
    • /
    • pp.33-38
    • /
    • 2015
  • The goal of this paper is to propose the Hangul Jamo to make a optimum transmission code of Hangul consonant and vowel(Jamo). The Hangul Jamo was analyzed by three kinds of Hangul Jamo. First one is the basic Hangul Jamo which is consisted by 24ea Jamo. Second one is a two combination keyboard which has 28ea Jamo. Third one is 54 Jamo set which is added the double Jamo to the second one. Use frequency of Hangul-Jamo is analyzed based on the Hangul in "Modern Korean Use Frequency Rate Survey Result" issued by The National Institute of the Korean Language". Total 58,437 Korean words are contained in the report and the words are composed with Hangul 1,540ea. The results of this study are as follows, In the Jamo are that in the first Jamo set case, the highest use frequency consonant is "ㅇ" and the lowest one is "ㅋ", and in the vowel case, the highest use frequency one is "ㅏ" and the lowest one is "ㅑ". In the second case, the highest use frequency consonant is same as first case and the highest vowel is "ㅏ" and the lowest one is "ㅒ". In the third case, the highest consonant is "ㅏ" and the lowest one is "ㅞ". the highest vowel is "ㄱ" and the lowest one is "ㄽ".

Scrambling Occurrence Frequency in HDB-3 in UTF-8 Coding of UNICODE Hangul Jamo (Unicode 한글낱자의 UTF-8 부호화에 따른 HDB-3 스크램블링 발생빈도)

  • Hong, Wan-Pyo
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.2
    • /
    • pp.153-160
    • /
    • 2015
  • This paper has studied about the scrambling occurrence frequency in UTF-8 coding system for Unicode Hangul Jamo codes. The scrambling methode applied in the study is HDB-3 in AMI line coding that is international transmission standard. In the study, the source coding rule was applied to analysis the scrambling occurrence. The quantity of the scrambling occurrence was calculated by the number of times and frequency rate of the scrambling occurrence in Hangul Jamo and Compatibity Hangul Jamo. In the case of Hangul Jamo, the number of times and frequency rate in Unicode and UTF-8 were 24times, 52% and 148times, 228% respectively. In the case of Compatibility Hangul Jamo, that were 10times, 14% and 83times, 131% respectively. As a result, when Hangul Jamo and Compatibility Hangul Jamo in UNICODE were transformed to UTF-8, the scrambling frequency rates were increased 340% and 851% respectively.

An Implementation of Web-based Client/Server Architecture using Distributed Objects (분산 객체를 이용한 웹기반 클라이언트 / 서버 구조의 구현)

  • 박희창;이태공
    • Journal of the military operations research society of Korea
    • /
    • v.23 no.2
    • /
    • pp.25-44
    • /
    • 1997
  • Internet users been rapidly increased due to the convenient GUI environment. Current Web-based HTTP/CGI client/server architecture has several problems such as the CGI bottleneck, no maintaince of state, and no load balancing. However, with Java and CORBA technologies called“Object Web technology”, we can solve them because Java is not only a mobile code but also a platform-independent code, and CORBA has ability to build distributed object and language-independent object model. The goal of “Object Web technology”is to create multivendor, multiOS, multilanguage“legoware”using objects. This paper implement“Book Search System”which is Web-based client/server architecture using distributed objects. Environments of this implementation are Hangul Windows NT(included IIS) server, Hangul Windows 95 client, Visigenic's VisiBroker for Java 1.2 which is a product of CORBA 2.0, HTTP protocol on TCP-IP-based, Sybase SQL Anywhere 5.0 database server, and the interface between application server and database is JDBC-ODBC bridge middleware.

  • PDF

Compatibility of UTF-8 Encoding System to HDB-3 Scrambling Method (Unicode의 UTF-8 부호화 방식의 HDB-3 스크램블링 방식과의 적합성)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.2
    • /
    • pp.227-240
    • /
    • 2013
  • This paper studied how much influence UTF coded data is given to HDB-3 operation efficiency. This paper applied the Hangul Jamo and Compatability Hangul Jamo in Unicode to compare to its UTF-8 coded data. As a result of study, When Unicode is reformatted to UTF-8 code, the data code run counter to the source coding rule was very much increased.

Study on the Hangul typeface of the decentralized density through the horizontal disposition of phoneme. (Hangul typeface for New Hangul Code) (음소의 가로선형 배열을 통한 밀도 분산형 한글꼴연구 ( 새로운 음소형 코드체계를 위한 한글꼴 ))

  • Moon, Souk-Bae
    • Annual Conference on Human and Language Technology
    • /
    • 1994.11a
    • /
    • pp.223-230
    • /
    • 1994
  • 본 한글꼴은 음절 및 음소의 가시성을 높이고자 한글 음소의 이중 가로선형 배열을 통한 밀도 분산형 한글꼴과 음소 나열형 한글꼴 등의 새로운 한글꼴의 다양한 표현의 실험 연구이다. 일도 분산형 한글꼴은 새로운 음소형 한글코드(닿소리, 홑소리, 받침 조합형)와 서로 대응하드록 일원화 한글꼴로 한글 및 옛 한글의 음소 조합형의 입.출력이 가능하다. 이러한 시도는 1바이트 이내에서 현대한글 및 옛한글을 구현하며, 이는 한글의 구현원리에 따른 음소형 코드체계의 실현 가능성으로 한글 코드체계의 최적화에 대한 새로운 가설을 제시 한다.

  • PDF

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

A Study on 1-D Bit-Serial Array Processor Design for Code-String Matching Using a MWLD Algorithm (MWLD 알고리즘을 이용한 문자열정합 1차원 Bit-Serial 어레이 프로세서의 설계)

  • 박종진;김은원;조원경
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.2
    • /
    • pp.1-8
    • /
    • 1992
  • This paper is proposed a Modified WLD (Weighted Levenshtein Distance) algorithm for processor desihn of code-string matching. A proposed MWLD (Modified Weighted Levenshtein Distance) algorithm is consist of 1-dimension bit-serial array processor to pattern matching using a Hamming Distance. The proposed processor is applied to recognition of character with real time input. The recognition rate of Hangul strokes is resulted to 98.65$\%$

  • PDF

A study on the processing method of the PLPS code and the Hangul code in the teletext systems (문자다중방송 시스템에서의 PLPS 코드 및 한글코드 처리방식에 관한 연구)

  • Lee, Jong-Dae;Kim, Jung-Seok;Jun, Kyong-Il;Kim, Yong-Deak
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1356-1359
    • /
    • 1987
  • 본 논문은 북미 표준방식인 문자다중방송 시스템에서 표현계층 코드 및 한글코드를 처리하여 TV 화면에 표시하는 방식에 대한 연구이다.

  • PDF

A Hierarchical Neural Network for Printed Hangul Character Recognition (인쇄체 한글문자 인식을 위한 계층적 신경망)

  • 조성배;김진형
    • Korean Journal of Cognitive Science
    • /
    • v.2 no.1
    • /
    • pp.33-50
    • /
    • 1990
  • Recently, neural networks have been proposed as computaional models for hard prlblems that the brain appears to solve easily. This paper proposes a hierarchical network which practically recognizes printed Hangul characters based on the various psychological stueies. This system is composed of a type classification netwotk and six recognition networks. The former clessifier input character images into one of the six thper by their overall sturcture, and the latter further classify them into character code. Extperiments with most frequently used 990 printed hangul characters conform the superiority of the propsed system. After all, neural nework approach turns out to be very reasonable through a comparison with statistical classifier and an analysis of mis-classification and generalization capability.