• Bulletin of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1095-1110
• /
• 2017

The t-wise intersection is a useful property of a linear code due to its many applications. Recently, the second author determined the t-wise intersection of a relative two-weight code. By using this result and generalizing the finite projective geometry method, we will present the t-wise intersection of a relative three-weight code and its applications in this paper.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.129-139
• /
• 2013

Java bytecodes are executed not on target machine but on the Java virtual machines. Since this bytecodes use a higher level representation than binary code, it is possible to decompile most bytecodes back to Java source. Obfuscation is the technique of obscuring code and it makes program difficult to understand. However, most of the obfuscation techniques make the code size and the performance of obfuscated program bigger and slower than original program. In this paper, we proposed an effective Java obfuscation techniques using assignment statements merging that make the source program difficult to understand. The basic approach is to merge assignments statements to append side effects of statement. An additional benefit is that the size of the bytecode is reduced.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.78-91
• /
• 1998

This paper presents modular design techniques of multiple-valued logic functions about the function decomposition method and input variable management method. The function decomposition method takes avantage of the property of the column multiplicity in a single-column variable partitioning. Due to the increased number of identical modules, we can achieve a simpler circuit design by using a single T-gate, which can eliminate some of the control functions in the module libraty types. The input variable management method is to reduce the complexity of the input variables by proposing the look up table which assign input variables to a code. In this case as the number of sub-functions increase the code-length and the size of the code-assignment table grow. We identify some situations where shard input variables among sub-functions can be further reduced by a simplicication technique. According to the result of adapting this method to a function, we have demonstrated the superiority of the proposed methods which is bing decreased to about 12% of interconnection and about 16% of T-gate numbers compare with th eexisting for th enon-symmetric and irregular function realization.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.107-117
• /
• 2006

Java language creates class files through Java compiler. Class files include informations involved with achievement of program. We can do analysis and optimization for efficient codes by analyzing class files. This paper analyzes bytecodes using informations of Java class files. We translate stack-based Java bytecodes into 3-address codes. Then we translate into static single assignment form using the 3-address codes. Static single assignment form provides a compact representation of a variable's definition-use information. Static single assignment form is often used as an intermediate representation during code optimization. Static sing1e assignment form renames each occurrence of a variable such that each variable is defined only once.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.1
• /
• pp.104-112
• /
• 1989

A design automation method for sequential circuits implementation by mans of PLA is discussed, and an optimal state-code assignment algorithm to minimize the PLA area is proposed. In order to design sequential circuit automatically, DASL (Design Automation Support Language) [8] which is easy to describe and powerful to synthesize, is proposed and used to describe sequential circuit, An optimal statecode assignment algorithm which considers next states and outputs simultaneously is proposed, and by adopting this algorithm to various examples, the area of PLA is reduced by 10% comparing privious methods. This system is constructed to design microinstruction, FSM, VLSI control part synthesis.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.1-8
• /
• 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 implements CTOC. In order to statically determine the value and type, CTOC uses the SSA Form which separates the variable according to assignment. Also, it uses a Tree Form for statements. But, due to insertion of the $\phi$-function in the process of conversion into the SSA Form, the number of nodes increased. This paper shows the dead code elimination to obtain a more optimized code in SSA Form. We add new live field in each node and achieve dead code elimination in tree structures. We can confirm after dead code elimination though test results that nodes decreases.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.5
• /
• pp.711-720
• /
• 2004

There are conversion of expression motion and assignment motion inclusive espression motion in techniques that optimized program computationally and livelly. In this paper, I suggest that an algorithms of reconstruct unnecessary code motion which is improves Knoop's algorithms that have ambiguous. It is occurred by mixing the node level analysis and the instruction level analysis. This algorithm improves runtime and efficiency of a program by avoiding the unnecessary recalculations and reexecutions of expressions and assignment statements.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1556-1559
• /
• 1987

In this paper, a new state assignment method is proposed for the implementation of the area-effective control part. Introducing the, concept of adjacency matrix to control table generated by SDL(Symbolic Description Language) hardware compiler, a state assignment method is proposed with which minimal number of flip flops and effective number of product terms can be obtained to accomplish the area-effective implementation. Also, with substituting the assigned code to state transition table, boolean equations are obtained through 2-level logic minimization. Proposed algorithm is programmed in C-language on VAX-750/UNIX and b efficiency is shown by the practical example.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.471-482
• /
• 2021

Several code-division multiple access (CDMA)-based interconnect schemes have been recently proposed as alternatives to the conventional time-division multiplexing bus in multicore systems-on-chip. CDMA systems with a dynamic assignment of spreading codewords are particularly attractive because of their potential for higher bandwidth efficiency compared with the systems in which the codewords are statically assigned to processing elements. In this paper, we propose a novel distributed arbitration scheme for dynamic CDMA-bus-based systems, which solves the complexity and scalability issues associated with commonly used centralized arbitration schemes. The proposed arbitration unit is decomposed into multiple simple arbitration elements, which are connected in a ring. The arbitration ring implements a token-passing algorithm, which both resolves destination conflicts and assigns the codewords to processing elements. Simulation results show that the throughput reduction in an optimally configured dynamic CDMA bus due to arbitration-related overheads does not exceed 5%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1624-1630
• /
• 1999

Code division multiple access (CDMA) is a promising air interface technique for cellular systems. When an MS (Mobile Station) moves to an adjacent cell, the handoff between the serving cell and the target cell is needed. Compared with the hard handoffs, the soft handoffs between two CDMA channels with the identical frequency assignments and frame offsets can provide a better quality of service by minimizing the undesirable ping pong phenomenon of back-and forth handoffs between two adjacent cells in conventional hard handoffs. For the soft handoff of a call to an adjacent cell to be successful, the adjacent cell should assign to the call the same frame offset as that being used in the original cell by the call. In this paper, considering the assignment states of the frame offsets of the adjacent cells, a frame offset assignment algorithm for the originated call is proposed. And analytic method for the handoff blocking probability due to the lack of the frame offset capacity is also presented to show the advantage of the proposed algorithm with respect to the soft handoff blocking probability.