• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.12
• /
• pp.1-8
• /
• 1997

In this paper, a new method of state code assignment for reduction of switching activities of state transition in asynchronous circuits is proposed. The algorithm is based on a on-hot code and modifies it to reduce switching activities. To estimate switching activities as a cost functions we introduce state transition probability (STP). AS a results, the proposed algorithm has an advantage of 60% over with the conventional code assignment in terms of switching and code length of state assignment.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.108-114
• /
• 1988

We have developed a program that minimizes the chip area with effective code assignment of microinstructions when the control part of VLSI system is implemented in the PLA. While conventional algorithms are composed of one pass, the algorithm proposed in this paper is composed of two passes and it consists of three principal procedures: a procedure for the determination of the code assignment order, a procedure for the code assignment and a procedure for the reduction of the code length. especially, we have proposed a new method of folding back for the reduction of the code length. We have obtained the result of 4 bit code length and 9 product terms when 11 micro-instructions and 6 microoperations were given as a inputs. Therefore, we have certified that it could be used efficiently for the control part of the processors.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.55-67
• /
• 2008

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicate. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in Knoop's algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.27-35
• /
• 2001

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicated. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in knoop’s algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.587-590
• /
• 1988

In the case of VLSI computer system control unit design using PLA, optimal state code assignment algorithm to minimize the PLA area is proposed. An optimal state code assignment algorithm which considers output state and logic minimization simultaneously is proposed, and by means of this, algorithm product term is minimized. Also, by means of this algorithm running time and memory capacitance is decreased as against heuristic state code assignment algorithm which uses matrix calculation and considers the constraint relation only. This algorithm is implemented on VAX 11/750 (UNIX4.3BSD). Through the various test example applied proposed algorithm, the efficiency of this algorithm is shown.

• Journal of Information Technology Applications and Management
• /
• v.15 no.1
• /
• pp.261-270
• /
• 2008

Wireless Mesh Networks (WMNs) have emerged as one of the new hot topics in wireless communications. WMNs have been suggested for use in situations in which some or all of the users are mobile or are located in inaccessible environments. Unconstrained transmission in a WMN may lead to the time overlap of two or more packet receptions, called collisions or interferences, resulting in damaged useless packets at the destination. There are two types of collisions; primary collision, due to the transmission of the stations which can hear each other, and hidden terminal collision, when stations outside the hearing range of each other transmit to the same receiving stations. For a WMN, direct collisions can be minimized by short propagation and carrier sense times. Thus, in this paper we only consider hidden terminal collision while neglecting direct collisions. To reduce or eliminate hidden terminal collision, code division multiple access (CDMA) protocols have been introduced. The collision-free property is guaranteed by the use of spread spectrum communication techniques and the proper assignment of orthogonal codes. Such codes share the fixed channel capacity allocated to the network in the design stage. Thus, it is very important to minimize the number of codes while achieving a proper transmission quality level in CDMA WMNs. In this paper, an efficient heuristic code assignment algorithm for eliminating hidden terminal collision in CDMA WMNs with general topology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1302-1310
• /
• 1997

In this paper, we propose a dynamic code allocation strategy using voice activity detection and evaluate the performance of a dynamic code allocation strategy using voice activeity detection in DS-CDMA system. Proposed method allocates code to mobile terminal according to the residual capacity computed by SIR in the base station. In hot spot traffic loading cell, we find that the performance of proposed method is better than that of a fixed code assignment strategy using voice activity detection. Also, we find that the proposed method provide much improvement in blocking probability against the dynamic code assignment strategy withoug voice activity detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.315-326
• /
• 2003

Abstract In this paper, an improved index assignment procedure is proposed to reduce the channel error effect in a communication system employing classified vector quantization(CVQ). The proposed algorithm consists of two parts: inner index assignment (IIA) and cross index assignment (CIA). The II A reduces the distortion resulting from the error in order bits, presenting the identity of each code vector in a subcodebook. The CIA modifies the indexes assigned by the IIA in such a way that the effect of the channel error occurring in class bits, indicating the class information of the code vector, can be minimized. Simulation results show that the proposed algorithms enable a reliable communication over noisy channels even without employing the channel encoding. Index Terms Classified vector quantization, index assignment.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.16 no.4
• /
• pp.13-21
• /
• 1979

In this paper, some fundamental problems in the assignment and standardization of codes for Korean letters are discussed, and a multi-code method is proposed for the code assignment. This method is designed in particular to reflect the characteristics of Korean letters. Also, based on this method, a computer internal code and a telex code are suggested. The multi-code method enables us to obtain information on the display at a terminal rather easily by assigning the information dispersed among the code sequences to code himself and position. Further this method is shown to be capable of improving the transmission rate by 7.5% over the conventional resolution method if the given code space is efficiently utilized.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.37-47
• /
• 2008

Exploitation of address generation units which are typically provided in DSPs plays an important role in DSP code generation since that perform fast address computation in parallel to the central data path. Offset assignment is optimization of memory layout for program variables by taking advantage of the capabilities of address generation units, consists of memory layout generation and address pointer assignment steps. In this paper, we propose an effective address pointer assignment method to minimize the number of address calculation instructions in DSP code generation. The proposed approach reduces the time complexity of a conventional address pointer assignment algorithm with fixed memory layouts by using minimum cost-nodes breaking. In order to contract memory size and processing time, we employ a powerful pruning technique. Moreover our proposed approach improves the initial solution iteratively by changing the memory layout for each iteration because the memory layout affects the result of the address pointer assignment algorithm. We applied the proposed approach to about 3,000 sequences of the OffsetStone benchmarks to demonstrate the effectiveness of the our approach. Experimental results with benchmarks show an average improvement of 25.9% in the address codes over previous works.