• Title/Summary/Keyword: Code-30

Search Result 933, Processing Time 0.032 seconds

The Development of New Hangul Code "Truecode" and Its Applications (새로운 한글코드 “Truecode”의 개발과 응용)

  • 이문형;김기두
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.5
    • /
    • pp.43-51
    • /
    • 1993
  • A new Hangul code called Truecode is developed for accomodating to the future computing environments of graphical user interface and multimedia as well as for corresponding with the invention principle of Hangul. Truecode is not a forced two-byte code of syllable unit, as completion-type of combination-type, currently used, but a one byte code of phoneme unit, which can represent initial consonant, vowel, and final consonant each. It is quite different from three-byte code of syllable unit and also does not require the fill code used for three-byte code. We expect great contribution to the Hangul culture from Truecode's some important following features. It can express all the Korean characters we may imagine and does not cause any problem in communication. As well as we may use direct connection font, we can assign ont-to-one correspondence between Truecode and a keyboard with three sets. Truecode has a good advantage in developing application softwares of Hangul and it can nicely be applied to the fields of speech recognition and artificial intelligence using natural language.

  • PDF

A Minimum-Bandwidth Line Code for Low-Pass Channels (저역 통과 선로를 위한 최소 대역폭 선로부로)

  • 김대영;김재균
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.5
    • /
    • pp.23-30
    • /
    • 1983
  • A new runlength-limited minimum-bandwidth line code is designed by modifying the duobinary code. Since the new code is runlength limited, the need for a data scrambling before transmission is eliminated. The eye width and the error probability of the new code are shown to be almost the same as those of the duobinary code. Also, the power spectral shape is scarcely changed, so that the new code is suitable for such low-pass channels as optical fibers.

  • PDF

Study on the ASCII Code in the side of the Transmission Efficiency in Data Communications (데이터통신 전송효율과 ASCII 부호체계 고찰)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.5
    • /
    • pp.657-664
    • /
    • 2011
  • This paper proposes the revised ASCII code. The study started with consideration whether the ASCII code is proper or not in the side of the transmission efficiency in data communications. In data communications, when the consecutive "0" bits from the information devices input into the line coder, its consecutive "0" bits are scrambled to the predetermined patterns not to the consecutive "0" signal. The paper used to study with the statistical data for the frequency of the letters of the alphabets and the proposed rule of characters coding in reference. As a result of the study, when the proposed ASCII code is applied, the operation efficiency of the scrambler in the line coder is improved upto average 30%.

Domain Analysis of Device Drivers Using Code Clone Detection Method

  • Ma, Yu-Seung;Woo, Duk-Kyun
    • ETRI Journal
    • /
    • v.30 no.3
    • /
    • pp.394-402
    • /
    • 2008
  • Domain analysis is the process of analyzing related software systems in a domain to find their common and variable parts. In the case of device drivers, they are highly suitable for domain analysis because device drivers of the same domain are implemented similarly for each device and each system that they support. Considering this characteristic, this paper introduces a new approach to the domain analysis of device drivers. Our method uses a code clone detection technique to extract similarity among device drivers of the same domain. To examine the applicability of our method, we investigated whole device drivers of a Linux source. Results showed that many reusable similar codes can be discerned by the code clone detection method. We also investigated if our method is applicable to other kernel sources. However, the results show that the code clone detection method is not useful for the domain analysis of all kernel sources. That is, the applicability of the code clone detection method to domain analysis is a peculiar feature of device drivers.

  • PDF

On the Optimum Dwell Time for Fast Code Acquisition is DS/SS Systems (DS/SS 시스템에서 최소 코드획득시간을 위한 최적 코드측정시간에 관한 연구)

  • 조권도;부수일;김철성
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.8
    • /
    • pp.11-18
    • /
    • 1993
  • In a spread spectrum system, the bandwidth and period of spreading code is wide and long, respectively. So it is necessary to make the code acquisition time as short as possible. In particular, serial search code acquisition system requires optimum dwell time for fast acquisition. In this paper, code acquisition time is calculated by varying dwell time. Among them, minimum code acquisition time is chosen and then optimum dwell time can be obtained. Detection probability (P$_{D}$) and false alarm probability (P$_{FA}$) can be obtained by integrating chi-square pdf by numerical analysis. The results are compared with that of gaussian approximation method and then it is concluded gaussian approximation method is not suitable for obtaining optimum dwell time. Computer simulation supports theoretical results.

  • PDF

Parallel lProcessing of Pre-conditioned Navier-Stokes Code on the Myrinet and Fast-Ethernet PC Cluster (Myrinet과 Fast-Ethernet PC Cluster에서 예조건화 Navier-Stokes코드의 병렬처리)

  • Lee, G.S.;Kim, M.H.;Choi, J.Y.;Kim, K.S.;Kim, S.L.;Jeung, I.S.
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.6
    • /
    • pp.21-30
    • /
    • 2002
  • A preconditioned Navier-Stokes code was parallelized by the domain decomposition technique, and the accuracy of the parallelized code was verified through a comparison with the result of a sequential code and experimental data. Parallel performance of the code was examined on a Myrinet based PC-cluster and a Fast-Ethernet system. Speed-up ratio was examined as a major performance parameter depending on the number of processor and the network communication topology. In this test, Myrinet system shows a superior parallel performance to the Fast-Ethernet system as was expected. A test for the dependency on problem size also shows that network communication speed in a crucial factor for parallel performance, and the Myrinet based PC-cluster is a plausible candidate for high performance parallel computing system.

A Review of Arbitrator Disclosure Obligations in Korea through the Oilhub Case

  • Kim, Joongi
    • Journal of Arbitration Studies
    • /
    • v.30 no.3
    • /
    • pp.115-136
    • /
    • 2020
  • This article provides an overview of the state of affairs of arbitrator disclosure obligations in Korea. It shows how Korean courts will analyze arbitrator conflicts and obligations through an evaluation of Supreme Court judgments and a case-specific analysis of the recent Oilhub case and provides a comparative perspective through a review of recent Japanese case law. Although limited to domestic arbitrations, it assesses the various grounds that courts consider when determining impermissible arbitrator conflicts based on relations with parties and when an award might be set aside as a result. With the 2016 adoption of the KCAB Code of Ethics for Arbitrators and its rigorous standards, great clarity has been brought to the landscape. The Code of Ethics marks a significant milestone in enhancing the robustness of arbitrator disclosures and guaranteeing the fairness, integrity, and transparency of Korean arbitration practice and law.

Parallel Procedure and Evaluation of Parallel Performance of Impact Simulation Based on Two-Step Eulerian Scheme (Two-Step Eulerian 기법에 기반 한 충돌 해석의 병렬처리 및 병렬효율 평가)

  • Kim Seung-Jo;Lee Min-Hyung;Paik Seung-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.10 s.253
    • /
    • pp.1320-1327
    • /
    • 2006
  • Parallel procedure and performance of two-step Eulerian code have not been reported sufficiently yet even though it was developed and utilized widely in the impact simulation. In this study, parallel strategy of two-step Eulerian code was proposed and described in detail. The performance was evaluated in the self-made linux cluster computer. Compared with commercial code, a relatively good performance is achieved. Through the performance evaluation of each computation stage, remap is turned out to be the most time consuming part among the other part such as FE processing, communication, time marching etc.

Simplified Decoder of the Modulation Code for DVD System (DVD 시스템에서 사용되는 변조 코드에 대한 간소화된 디코더)

  • Kim Hyoung seok;Lee Joohyun;Lee Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4C
    • /
    • pp.247-252
    • /
    • 2005
  • Currently, the decoder receives a 16 bit channel input and restores an 8 bit data symbol in the DVD system. Such modulation code of DVD is the EFMplus code, and it is composed of a main table and a sub table. For reducing the size of the code table, this paper divided the code table into 3 groups and we implemented the decoder using this new code table. After all, this method enables us to reduce the size of ROM as reducing the total number of code from 1376 to 750.

Constant-Amplitude Biorthogonal Multi-Code Modulation (정 진폭 다중 보호 이진 직교 변조)

  • Hong Dae ki;Kang Sung jin;Ju Min chul;Kim Young sung;Seo Kyeung hak;Cho Jin woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3C
    • /
    • pp.69-76
    • /
    • 2005
  • In this paper, we propose a biorthogonal modulation employing a constant-amplitude transmission of multi-code signals by introducing a simple constant-amplitude coding scheme with redundant bits. The proposed constant-amplitude biorthogonal multi-code (CABM) modulation can provide high spectral efficiency compared with a conventional direct sequence/spread spectrum (DS/SS) modulation. Nevertheless the proposed CABM modulation can keep up a constant-amplitude signal. Additionally, we propose various types of demodulation structures for the CABM modulation. Simulation results show that bit error rate (BER) performance and hardware complexity of the proposed CABM modulation are highly improved in comparison with those of a constant-amplitude orthogonal multi-code (CAOM) modulation.