• 제목/요약/키워드: Code Assignment

검색결과 75건 처리시간 0.026초

A Study on Construction of the Advanced Sequential Circuit over Finite Fields

  • Park, Chun-Myoung
    • Journal of Multimedia Information System
    • /
    • 제6권4호
    • /
    • pp.323-328
    • /
    • 2019
  • In this paper, a method of constructing an advanced sequential circuit over finite fields is proposed. The method proposed an algorithm for assigning all elements of finite fields to digital code from the properties of finite fields, discussed the operating characteristics of T-gate used to construct sequential digital system of finite fields, and based on this, formed sequential circuit without trajectory. For this purpose, the state transition diagram was allocated to the state dependency code and a whole table was drawn showing the relationship between the status function and the current state and the previous state. The following status functions were derived from the status function and the preceding table, and the T-gate and the device were used to construct the sequential circuit. It was confirmed that the proposed method was able to organize sequential digital systems effectively and systematically.

A Study on Verification of NC Code of Multi-spindles Drilling for Tube Sheet in Heat Exchanger (열교환기 Tube Sheet의 다축드릴가공 검증에 관한 연구)

  • Oh, Byeong-Hwan;Lee, Hui-Gwan;Yang, Gyun-Ui
    • Journal of the Korean Society for Precision Engineering
    • /
    • 제18권2호
    • /
    • pp.79-83
    • /
    • 2001
  • A verification of multi-spindles drilling NC data is presented. The drilling of multi-spindles can offer productivity over three times as fast as that of single spindle. The most important things in machining tube sheet are precision of hole position and machining time. The drilling of multi-spindles has difficulties in controlling many motors to drive spindles and assign a correspondent number to each spindles. Multi-spindles drilling has different codes from CNC milling ; many subroutines, assignment of spindle, and so on. The conventional method, which inspects the NC code of the drilling, is to drill holes on a thin plate or tube sheet previously. The method results in low productivity because it consumed long machining time and welding for correction. This paper describes details of multi-spindles NC code and operation of multi-spindles drilling machine. A verification software of the multi-spindles drilling NC code is developed on the details.

  • PDF

Random Assignment-Transmitter-Based Protocol for Centralized Stread-Spectrum Packet Radio Networks (중앙집중 대역확산 패킷라디오 네트워크를 위한 임의할당-송신기 프로토콜)

  • 노준철;김동인
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제19권4호
    • /
    • pp.729-739
    • /
    • 1994
  • In a centralized spread-spectrum packet radio network, a random assignment -transmitter-based spreading code protocol(RA-T) is proposed which permits the contention mode only in the trasmission of a preamble while avoiding collision during the data packet transmission by assigning near-orthogonal spreading codes to each user. Compared to the conventional transmitter-based code scheme, this scheme allows reduction in receiver complexity when only a small number of distinct spreading codes are employed for the preamble transmission. Throughout theoretical and simulation results, it is shown that the use of the RA-T scheme with just two or three distinct codes for the preamble packet achieves most of the performance gain.

  • PDF

On the Program Conversion and Conditional Simplification for VECTRAN Code (백트란 코드화를 위한 프로그램 변환과 단순화)

  • Hwang, Seon-Myeong;Kim, Haeng-Gon
    • The Transactions of the Korea Information Processing Society
    • /
    • 제1권1호
    • /
    • pp.38-49
    • /
    • 1994
  • One of the most common problems encountered in the automatic translation of FORTRAN source code to VECTRAN is the occurrence of conditional transfer of control within loops. Transfers of control create control dependencies, in which the execution of a statement is dependent on the value of a variable in another statement. In this paper I propose algorithms involve an attempt to convert statements in the loop into conditional assignment statements that can be easily analyzed for data dependency, and this paper presents a simplification method for conditional assignment statement. Especially, I propose not only a method for simplifying boolean functions but extended method for n-state functions.

  • PDF

Optimization Using Partial Redundancy Elimination in SSA Form (SSA Form에서 부분 중복 제거를 이용한 최적화)

  • Kim, Ki-Tae;Yoo, Weon-Hee
    • The KIPS Transactions:PartD
    • /
    • 제14D권2호
    • /
    • pp.217-224
    • /
    • 2007
  • In order to determine the value and type statically. CTOC uses the SSA Form which separates the variable according to assignment. The SSA Form is widely being used as the intermediate expression of the compiler for data flow analysis as well as code optimization. However, the conventional SSA Form is more associated with variables rather than expressions. Accordingly, the redundant expressions are eliminated to optimize expressions of the SSA From. This paper defines the partial redundant expression to obtain a more optimized code and also implements the technique for eliminating such expressions.

Processing of Code Optimization in CTOC (CTOC에서 코드 최적화 수행)

  • Kim, Ki-Tae;Yoo, Weon-Hee
    • Journal of Korea Multimedia Society
    • /
    • 제10권5호
    • /
    • pp.687-697
    • /
    • 2007
  • Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. Therefore, in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implemented CTOC for transforming to optimized code. In Optimization, SSA Form that distinguish variable by assignment is used to determine value and type statically. Copy propagation, dead code elimination optimization is applied to SSA Form. However, existing SSA Form is related to variable than expression. Therefore, in this paper, to performing optimization to SSA Form expression, after performing copy propagation and dead code elimination, in addition to that, partial redundant expression elimination is performed

  • PDF

Assignment and Analysis of New Postcode using Geographic Data (지리정보 데이터를 활용한 새우편번호 부여 및 분석에 관한 연구)

  • Lee, Jeong-Hun;Eom, Bo-Yun;Kim, In-Soo;Lee, Seong-Joon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • 제38권3호
    • /
    • pp.227-236
    • /
    • 2012
  • New 5-digit zone code (new postcode) will replace the current 6-digit postcode which has been used for postal automation in 2014. New postcode will be used for processing various works to distinguish location and area in the entire country. For example, it new postcode will be used to denote different administration areas, firefighting and police jurisdiction, weather forecast areas, emergency medical facility areas, social welfare institution areas, election districts, school districts, statistical areas, courier and delivery business areas, and etc. Therefore, the relevant authorities must be cosider for the feasibility and applicability of assigning the new postcode. In postal service, postal process will be affected a lot by new postcode because a postcode has been related with delivery area of a postman. Therefore, we propose assignment scheme for new postcode which will impact less to postal process. Then, we present how we used geographic data for efficient assignment and analysis of the results.

A Construction Theory of Multiple-Valued Logic Fuctions on GF($(2^m)$ by Bit Code Assignment (Bit Code할당에 의한 GF($(2^m)$상의 다치논리함수 구성 이론)

  • Kim, Heung Soo;Park, Chun Myoung
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • 제23권3호
    • /
    • pp.295-308
    • /
    • 1986
  • This paper presents a method of constructing multiple-valued logic functions based on Galois field. The proposed algorithm assigns all elements in GF(2**m) to bit codes that are easily converted binary. We have constructed an adder and a multiplier using a multiplexer after bit code operation (addition, multiplication) that is performed among elements on GF(2**m) obtained from the algorithm. In constructing a generalized multiple-valued logic functions, states are first minimized with a state-transition diagram, and then the circuits using PLA widely used in VLSI design for single and multiple input-output are realized.

  • PDF

Performance Analysis of Packet CDMA R-ALOHA for Multi-media Integration in Cellular Systems with Adaptive Access Permission Probability

  • Kyeong Hur;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제25권12B호
    • /
    • pp.2109-2119
    • /
    • 2000
  • In this paper, the Packet CDMA Reservation ALOHA protocol is proposed to support the multi-traffic services such as voice and videophone services with handoff calls, high-rate data and low-rate data services efficiently on the multi-rate transmission in uplink cellular systems. The frame structure, composed of the access slot and the transmission slot, and the proposed access permission probability based on the estimated number of contending users for each service are presented to reduce MAI. The assured priority to the voice and the videophone handoff calls is given through higher access permission probability. And through the proposed code assignment scheme, the voice service can be provided without the voice packet dropping probability in the CDMA/PRMA protocols. The code reservation is allowed to the voice and the videophone services. The low-rate data service uses the available codes during the silent periods of voice calls and the remaining codes in the codes assigned to the voice service to utilize codes efficiently. The high-rate data service uses the assigned codes to the high-rate data service and the remaining codes in the codes assigned to the videophone service. Using the Markov-chain subsystem model for each service including the handoff calls in uplink cellular systems, the steady-state performances are simulated and analyzed. After a round of tests for the examples, through the proposed code assignment scheme and the access permission probability, the Packet CDMA Reservation ALOHA protocol can guarantee the priority and the constant QoS for the handoff calls even at large number of contending users. Also, the data services are integrated efficiently on the multi-rate transmission.

  • PDF

An algorithm in Davis method for assigning input codes (Input code를 지정하기 위한 Davis방법의 산법)

  • 양흥석;방승양
    • 전기의세계
    • /
    • 제18권3호
    • /
    • pp.15-23
    • /
    • 1969
  • A combinational circuit is one of the fundamental elements in digital circuits, containing electronic computers. W.A. Davis presented a new approach to the problem of assigning binary input codes so that the combinational circuits necessary to realize the given output functions may be minimized. This paper has derived an algorithm for determining the actual cost of a given assignment scheme in Davis method. First, the combinations of partitions realizing the output functions are obtained and then those among them implementing all of the output functions are found by using a table. In consequence it has been proved that by this algorithm the process of the assignment in a schcme with 16 states and 3 determined partitions can be reduced to 1/10$^{6}$ .

  • PDF