• 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.

• 한국정밀공학회지
• /
• 제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.

• 한국통신학회논문지
• /
• 제19권4호
• /
• pp.729-739
• /
• 1994

중앙집중 대역확산 패킷라디오 네트워크를 위한 다원접속 방식으로 임의할당-송신기 프로토콜을 새로이 제안한다. 제안하는 임의할당-송신기 프로토콜은 프리엠블 전송시만 경쟁모드로 동작하고, 데이터부분은 의사 직교특성을 갖는 송신기별 확산코드를 사용한다. 종래의 송신기별 프로토콜과 비교할때, 임의 할당-송신기 프로토콜은 프리엠블 전송을 위해 적은 수의 확산코드를 사용하는 경우 중앙수신기의 복잡도를 크게 줄일 수 있다. 이론적인 처리율 분석과 시뮬레이션 결과를 통해 단지 2~3개의 확산코드를 사용하여 프리엠블을 전송하는 경우에 성능이득의 대부분을 얻을 수 있었다.

• 한국정보처리학회논문지
• /
• 제1권1호
• /
• pp.38-49
• /
• 1994

기존 포트란 프로그램을 벡터 처리 가능한 코드인 벡트란으로 변환시키는데 있어 서 가장 문제가 되는 것은 루프내에서 제어의 분기가 발생하는 경우 조건적 전달이 일어난다는 것이다. 조건적 전단이란 어떤 문장의 실행이 다른 문장내의 변수 값에 의 해 이루어지는 제어 의존성으로, 본 논문은 루프내부의 조건적 제어를 제거하기 위한 알고리즘과 조건적 할당문을 이용하였을 때 그 내부의 복잡한 조건에 대한 단순화 알 고리즘을 제시한다. 이 때 조건적 할당문의 조건은 부울 변수(2-상태)뿐 아니라 3가지 이상의 상태를 나타내는 n-상태변수를 통하여 나타낸다.

• 정보처리학회논문지D
• /
• 제14D권2호
• /
• pp.217-224
• /
• 2007

CTOC에서는 정적으로 값과 타입을 결정하기 위해 변수를 배정에 따라 분리하는 SSA Form을 사용한다. SSA Form은 최근 데이터 흐름분석과 코드 최적화를 위해 컴파일러의 중간 표현으로 많이 사용되고 있다. 하지만 기존의 SSA Form은 표현적보다는 주로 변수에 관련된 것이다. 따라서 SSA Form 형태의 표현식에 대해 최적화를 적용하기 위해 중복된 표현식을 제거한다. 본 논문에서는 좀더 최적화된 코드를 얻기 위해 부분 중복 표현식을 정의하고, 부분 중복 표현식을 제거하는 방법을 구현한다.

• 한국멀티미디어학회논문지
• /
• 제10권5호
• /
• pp.687-697
• /
• 2007

자바 바이트코드는 많은 장점을 가지고 있지만, 수행속도가 느리고 프로그램 분석이나 최적화에 적절한 표현이 아니라는 단점이 존재한다. 따라서 네트워크와 같은 실행 환경에서 효율적으로 수행되기 위해서는 최적화된 코드로 변환이 필요하다. 따라서 우리는 최적화된 코드로의 변환을 위해 CTOC를 구현하였다. 최적화 과정에서 CTOC는 정적으로 값과 타입을 결정하기 위해 변수를 배정에 따라 분리하는 SSA From을 사용하였다. 하지만 SSA Form변환 과정에서 ${\phi}$-함수의 추가에 의해 오히려 노드의 수가 증가되는 문제점이 발생하였다. 이를 해결하기 위해 본 논문에서는 SSA Form에서 복사 전파와 죽은 코드 제거 최적화를 수행한다. 또한 기존의 SSA Form은 표현식보다는 주로 변수에 관련된 것이라는 단점이 존재한다. 따라서 본 논문에서는 SSA Form 형태의 표현식에 대해 복사 전파와 죽은 코드 제거와 같은 최적화를 적용한 후 다시 중복된 표현식을 제거하는 과정을 추가로 수행한다.

• 대한산업공학회지
• /
• 제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.

• 대한전자공학회논문지
• /
• 제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.

• 한국통신학회논문지
• /
• 제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.

• 전기의세계
• /
• 제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}$ .