• Title/Summary/Keyword: code generation

Search Result 1,006, Processing Time 0.024 seconds

Design and Implementation of Java Bytecode Translator usin Pattern Matching Technique (패턴 매칭 기법을 이용한 자바 바이트코드 변환기의 설계 및 구현)

  • Ko, Kwang-Man
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.4
    • /
    • pp.1-9
    • /
    • 2002
  • The various researches are investigated for translating Bytecode into native code which can be implemented in the specific processor using classical compiling methods to improve the execution speed of the Java application programs. The code generation techniques using pattern matching can generate more high-quality machine code than code expansion techniques. We provide, in this research, the standardized pattern describing methods and pattern matching techniques that can be used to generate the register-based intermediate code which is for the effective native code generation from Bytecode. And we designed and realized the intermediate code translator with which we can generate the high-quality register-based intermediate code using standardized pattern described formerly.

Development of Automatic Code Generation of Condensation Algorithm using MATLAB (MATLAB을 이용한 Condensation 알고리즘의 자동 코드 구현)

  • Lee, Yang-Weon
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.5
    • /
    • pp.618-624
    • /
    • 2010
  • This paper address the problem of tracking multiple objects encountered in many situations in developing condensation algorithms. The difficulty lies on the fact that the implementation of condensation algorithm is not easy for the general users. We propose an automatic code generation program for condensation algorithm using MATLAB tool. It will help for general user who is not familiar with condensation algorithm to apply easily for real system. The merit of this program is that a that a general industrial engineer can easily simulate the designed system and confirm the its performance on the fly.

Calculation of kinetic parameters βeff and L with modified open source Monte Carlo code OpenMC(TD)

  • Romero-Barrientos, J.;Dami, J.I. Marquez;Molina F.;Zambra, M.;Aguilera, P.;Lopez-Usquiano, F.;Parra, B.;Ruiz, A.
    • Nuclear Engineering and Technology
    • /
    • v.54 no.3
    • /
    • pp.811-816
    • /
    • 2022
  • This work presents the methodology used to expand the capabilities of the Monte Carlo code OpenMC for the calculation of reactor kinetic parameters: effective delayed neutron fraction βeff and neutron generation time L. The modified code, OpenMC(Time-Dependent) or OpenMC(TD), was then used to calculate the effective delayed neutron fraction by using the prompt method, while the neutron generation time was estimated using the pulsed method, fitting Λ to the decay of the neutron population. OpenMC(TD) is intended to serve as an alternative for the estimation of kinetic parameters when licensed codes are not available. The results obtained are compared to experimental data and MCNP calculated values for 18 benchmark configurations.

An improved NC-code generation method for circular interpolation (새로운 원호보간법에 의한 공구경로의 생성)

  • Yang, Min-Yang;Shon, Tae-Young;Cho, Hyun-Deog
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.11
    • /
    • pp.77-83
    • /
    • 1997
  • This work is concerned with the algorithm of generating a new circular are interpolation. This research presents a new biarc curve fitting that is a circular interpolation method based on a triarc curve fitting. The triarc method, where a segment span is composed of three circular arcs, using maximum error estimation has the advantage of generating arc splines easily to a given tolerance. The new biarc method is called when the adjacent radii are the same in the same in the triarc method. In generating the machining data for various cam curves in CNC machining with the biarc method and the new biarc method, the latter accomp- lished faster NC-code generation, shorter NC-code block formation and machined the same cam profile more efficiently.

  • PDF

Automatic Generation of Code Optimizer for DFA Pattern Matching (DFA 패턴 매칭을 위한 코드 최적화기의 자동적 생성)

  • Yun, Sung-Lim;Oh, Se-Man
    • The KIPS Transactions:PartA
    • /
    • v.14A no.1 s.105
    • /
    • pp.31-38
    • /
    • 2007
  • Code Optimization is converting to a code that is equivalent to given program but more efficient, and this process is processed in Code Optimizer. This paper designed and processed Code Optimizer Generator that automatically generates Code Optimizer. In other words Code Optimizer is automatically generated for DFA Pattern Matching which finds the optimal code for the incoming pattern description. DFA Pattern Matching removes redundancy comparisons that occur when patterns are sought for through normalization process and improves simplification and structure of pattern shapes for low cost. Automatic generation of Code Optimization for DFA Pattern Matching eliminates extra effort to generate Code Optimizer every time the code undergoes various transformations, and enables formalism of Code Optimization. Also, the advantage of making DFA for optimization is that it is faster and saves cost of Code Optimizer Generator.

Performance of W-CDMA System with SOVA-based Turbo Decoder in ITU-R Realistic Channel (ITU-R 실측채널에서 SOVA 기반의 터보부호를 적용한 W-CDMA 시스템의 성능 분석)

  • Jeon Jun-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.8
    • /
    • pp.1613-1619
    • /
    • 2004
  • Turbo codes of long block sizes have been known to show very good performance in an AWGN channel and the turbo code has been strongly recommended as error correction code for W-CDMA in 3GPP(3rd Generation Partnership Project). Recently, turbo codes of short block sizes suitable for real time communication systems have attracted a lot of attention. Thus, in this paper we consider the turbo code of 1/3 code rate and short frame size of 192 bits in ITU-R channel model. We analyzed the performance of W-CDMA systems of 10MHz bandwidths employing RAKE receiver with not only MRC diversity but also SOVA-based turbo code.

A Study of Mobile Content Generation System using 2-Dimensional bar code in Smart Device Environment (스마트 기기 환경에서 2차원 바코드를 활용한 모바일 콘텐츠 생성 시스템 연구)

  • Jin, Byung-Wook;Lee, Keun-Wang
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.4
    • /
    • pp.2349-2354
    • /
    • 2014
  • While the number of smart phone subscribers excessing 30 million people, Korea is leaping into the 'smart powerhouse' from IT powerhouse. The popularizat+ion of smart devices so called 'PC in the hand', brought surely change to people's life style, and also it had led to a revolutionary change to and also to business and government. In several corporations of each countries, a variety of smart devices smart devices such as smart phone, tablet PC and E-books have been developing. Nowadays, the usage of the smart phone is not only the simple function calling. It has become a culture of the terminal type in the hand anywhere at any time, which makes can communicate with the others in anywhere and anytime. However, some of the subscribers who visit the website for PC version with the mobile devices screen, can feel kind of discomfort while surfing the net on a smartphone devices because the install of the existing video and flash files and the screen size for computer is not available for mobile devices. Therefore, in this paper, we studied on effective mobile contents generation program using QR code that is two dimensions bar code under the smart device environment. Also, unlike previous QR code generator that decorate standardized design, we realize an original QR code generation system from user perspective.

Closed-code-conversion: Transforming Open Code Multi-staged Programs into Closed Ones (다단계 프로그램에서 프로그램 생성 단계의 자유변수 제거)

  • Eo, Hyun-Jun;Yi, Kwang-Keun
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.3
    • /
    • pp.244-251
    • /
    • 2009
  • We present a transformation which converts open-code multi-staged programs into closed ones. Staged computation, which explicitly divides a computation into separate stages, is a unifying framework for existing program generation systems. Because a multi-staged program generates another program, which can also generate a third program and on, the implementation of a multi-staged language is not straightforward. Dynamic binding of (lexically free) variables in code also makes the implementation of a multi-staged language hard. By converting each code into code of function which takes environment for free variables as its argument and giving an actual environment at the code-composition site, we can transform a open-code program into a closed-code one. Combining with Davies and Pfenning's method, our closed-code-conversion enables the implementation of the unstaged language to be useful for executing multi-staged programs. We also prove the correctness of our conversion: the converted program is equivalent to the original program, and the converted program does not have open code.

Analysis of Turbo Coding and Decoding Algorithm for DVB-RCS Next Generation (DVB-RCS Next Generation을 위한 터보 부복호화 방식 분석)

  • Kim, Min-Hyuk;Park, Tae-Doo;Lim, Byeong-Su;Lee, In-Ki;Oh, Deock-Gil;Jung, Ji-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9C
    • /
    • pp.537-545
    • /
    • 2011
  • This paper analyzed performance of three dimensional turbo code and turbo ${\Phi}$ codes proposed in the next generation DVB-RCS systems. In the view of turbo ${\Phi}$ codes, we proposed the optimal permutation and puncturing patterns for triple binary input data. We also proposed optimal post-encoder types and interleaving algorithm for three dimensional turbo codes. Based on optimal parameters, we simulated both turbo codes, and we confirmed that the performance of turbo ${\Phi}$ codes are better than that of three dimensional turbo codes. However, the complexity of turbo ${\Phi}$ is more complex than that of three dimensional turbo codes by 18%.

Automated Code Generation Framework for Industrial Automation Applications based on Timed Automata Model (타임드 오토마타 모델 기반 산업 자동화 응용 자동생성 프레임워크)

  • Lee, Kyunghyun;Kim, Ikhwan;Kim, Taehyoun
    • Journal of KIISE
    • /
    • v.44 no.12
    • /
    • pp.1307-1312
    • /
    • 2017
  • Due to their convergence with state-of-the-art ICT technologies, the complexity and reliability demands of industrial automation systems have been rapidly increasing. In recent years, to cope with these demands, several research works have been carried out to adopt formal methods to the application development cycle at the early design stage. In this paper, we propose an automated code generation framework for industrial automation applications, based on a timed automata model. As a case study, we developed a formal model for a traffic light control system and verified the timing properties described in the specification. We finally demonstrated that the operation of a test-bed based on the auto-generated native code was identical to that of the model specification.