• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.527-536
• /
• 2004

A novel hybrid multiple access system, TD-BCDMA, where Binary CDMA that maintains a constant amplitude by clipping the summation of input signals multiplied by the orthogonal codes is transmitted over a TDMA frame structure, was Nosed. In every time slot of TDMA, binary CDMA modulated multiple channel signals are transmitted with the same waveform of TDMA. TD-BCDMA has all the advantages of TDMA. Flexible adjustment of the data transmission rate In demand is possible by adjusting the number of codes and time slots assigned to each user. This property was used to show an example of Ad Hoc network applications. To obtain a proper synchronization scheme for TD-BCDMA, the Receiver Operating Characteristics performance and the false alarm probability and false dismissal probability under various channel environment of two different schemes, a preamble scheme as in TDMA and a synchronization channel scheme as in CDMA were compared. It was proved that the preamble scheme is more practical and suitable than the synchronization channel scheme for the hybrid multiple access system.

• Korean Journal of Plant Resources
• /
• v.17 no.2
• /
• pp.161-168
• /
• 2004

Optimal regeneration conditions of ginseng transformants were studied. It has been known that Ferritin Light Heavy Chain (FLHC) gene remove the several heavy metal by combination, store and transport. To obtain the ginseng tolerant to heavy metal, binary vector was introduced in Agrobacterium by tri-parental mating and then Agrobacterium tumefaciens MP90/FLHC was selected on the AB media and MS media containing kanamycin. Explants were co-cultured with Agrobacterium tumefaciens MP90/FLHC, which contained NPT II as a selectable marker, tadpole ferritin heavy chain (FLHC) gene and human ferritin light chain gene and then a number of embryos were induced. The induced embryo transferred to shooting media consisting of MS medium supplemented with GA 10 mg/L. As a result of examination that induced the normal growth of transfomants, transformants showed the equivalent growth in both root and shoot on the media containing the 1/3 MS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.269-280
• /
• 1996

We proposed a symbolic substitution method based on an optical correlator for an optical parallel addition. In the proposed symbolic substitution method, we used redundant binary number of the symbolic substitution rules as a number system and chose MAC3E filter which had very low sidelobes and good correlation peak compared with SDF filter as the optical correlation filter. We encoeded input numbers property to increase the discrimination capability and divided inpt patterns into 5 groups of the same addition results to minimize the number of symbolic substitution rules. Through the computer simulation, we confirmed the proposed method was suitable to implement the optical parallel adder.

• Journal of the Optical Society of Korea
• /
• v.10 no.3
• /
• pp.118-123
• /
• 2006

We present an optical security method for binary data information by using 4-step phase-shifting digital holography and we analyze tolerance error for the decrypted data. 4-step phase-shifting digital holograms are acquired by moving the PZT mirror with equidistant phase steps of ${\pi}/2$ in the Mach-Zender type interferometer. The digital hologram in this method is a Fourier transform hologram and is quantized with 256 gray level. The decryption performance of the binary data information is analyzed. One of the most important errors is the quantization error in detecting the hologram intensity on CCD. The greater the number of quantization error pixels and the variation of gray level increase, the more the number of error bits increases for decryption. Computer experiments show the results for encryption and decryption with the proposed method and show the graph to analyze the tolerance of the quantization error in the system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.6
• /
• pp.891-897
• /
• 2013

The spectrum and the number of the values of the cross-correlation function between the maximal period binary sequences have been extensively studied because of their importance in communications applications. In this paper, we propose the new family of the sequences using the decimation $d=2^{m-1}(3{\cdot}2^{m}-1)$. And we find the spectrum of the cross-correlation function of the sequences and analyze the number of times each value occurs for $0{\leq}{\tau}{\leq}2^{n}-2$.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1237-1240
• /
• 1996

This paper proposes a heuristic algorithm for performing the line balancing of PCB assembly fine including multiple surface mounters efficiently. We consider a PCB assembly line including the multiple surface mounters arranged serially as a target system. We assume that the number of heads of surface mounters can be changed. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. Also we propose an head-changing algorithm. The algorithms are validated through the computer simulation.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2002.05a
• /
• pp.273-277
• /
• 2002

This paper describes an optimal synthesis method of binary neural network(BNN) for an approximation problem of a circular region and synthetic image having four class using a newly proposed learning algorithm. Our object is to minimize the number of connections and neurons in hidden layer by using a Newly Expanded and Truncated Learning Algorithm(NETLA) based on the multilayer BNN. The synthesis method in the NETLA is based on the extension principle of Expanded and Truncated Learning (ETL) learning algorithm using the multilayer perceptron and is based on Expanded Sum of Product (ESP) as one of the boolean expression techniques. The number of the required neurons in hidden layer can be reduced and fasted for learning pattern recognition.. The superiority of this NETLA to other algorithms was proved by simulation.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.5
• /
• pp.331-336
• /
• 2016

Multi-bit tries have been proposed to improve the search performance of a binary trie by providing flexibility in stride values, which identify the number of bits examined at a time. However, constructing a variable-stride multi-bit trie is challenging since it is not easy to determine a proper stride value that satisfies the required performance at each node. The aim of this paper is to identify several desired characteristics of a trie for IP address lookup problems, and to propose a multi-stride decision trie that has these characteristics. Simulation results using actual routing sets with about 30,000 to 220,000 prefixes show that the proposed multi-stride decision trie has the desired characteristics and achieves IP address lookup using 33% to 47% of the 2-bit trie in the average number of node accesses, while requiring a smaller amount of memory.

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.696-703
• /
• 2017

In this paper, we show how to design based on solving Sudoku problem that is one of the NP-complete problems like Go. We show how to use greedy method which can minimize depth based on tree expansion and how to apply heuristic algorithm for pruning unnecessary branches. As a result of measuring the performance of the proposed method for solving of Sudoku problems, this method can reduce the number of function call required for solving compared with the method of heuristic algorithm or recursive method, also this method is able to reduce the 46~64 depth rather than simply expanding the tree and is able to pruning unnecessary branches. Therefore, we could see that it can reduce the number of leaf nodes required for the calculation to 6 to 34.

• Journal of the Optical Society of Korea
• /
• v.1 no.1
• /
• pp.26-35
• /
• 1997

Rigorous coupled-wave analysis (RCWA) with a simplified eigenvalue problem is used to investigate the an-tireflective property of one-dimensional surface-relief gratings such as binary gratings, triangular gratings and gratings with triangle-like surface profiles. The convergence of RCWA is investigated by varying the number of layers and the number of space-harmonics used in the computation. For unpolarized light normally incident on a medium of refractive index 1.64 from vaccum, a triangle-like grating shows the reflectivity of $1.6 {\times} 10^{-4}$ in contrast to a minimum reflectivity of $3.8 {\times} 10^{-3}$ for a binary grating. We also study the dependence of reflectivity on the wavelength, and on the angle of incidence for a groove shape and depth which result in minimum reflectivity.