• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.4
• /
• pp.338-347
• /
• 2021

In this paper, the beta-ray sensor circuit used in the true random number generator was designed using DB HiTek's 0.18㎛ CMOS process. The CSA circuit proposed a circuit having a function of selecting a PMOS feedback resistor and an NMOS feedback resistor, and a function of selecting a feedback capacitor of 50fF and 100fF. And for the pulse shaper circuit, a CR-RC2 pulse shaper circuit using a non-inverting amplifier was used. Since the OPAMP circuit used in this paper uses single power instead of dual power, we proposed a circuit in which the resistor of the CR circuit and one node of the capacitor of the RC circuit are connected to VCOM instead of GND. And since the output signal of the pulse shaper does not increase monotonically, even if the output signal of the comparator circuit generates multiple consecutive pulses, the monostable multivibrator circuit is used to prevent signal distortion. In addition, the CSA input terminal, VIN, and the beta-ray sensor output terminal are placed on the top and bottom of the silicon chip to reduce capacitive coupling noise between PCB traces.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2A
• /
• pp.203-212
• /
• 2007

An advanced vehicle safety system can be constructed by exchanging danger-related information ,such as urgency stop, traffic accident, obstacle, and car trouble, among the vehicles. However, because network topology changes rapidly and frequently due to the mobility of vehicles, it is impossible to configure the network for information forwarding in this environment. In the most of vehicle safety communication applications, an emergency message is propagated in a form of broadcasting. The simple broadcasting causes a lot of problems in terms of efficiency due to multi-hop area and radio collision problem. This paper proposes a method of selective message forwarding with stem and branch structure for propagating the emergency messages. However, the proposed method raise the efficiency of message transmission with the selective forwarding based on the priority assignment as its location. We analyze and evaluate the performance by comparing the proposed scheme with other schemes that are presented in the paper.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.21-26
• /
• 2012

Intra-session network coding has been proposed to improve throughput by simplifying scheduling of multi-hop wireless network and efficiency of packet transmission. Multi-rate transmission has been used in multihop wireless networks. An opportunistic routing with multirate shows throughput improvement compared with single rate. In this paper, we propose a method of throughput improvement in multi-hop wireless network by using multi-rate and intra-session network coding. We suggest a method to select an local optimal transmission rate at each node. The maximum throughput is evaluated by using linear programming (LP). To solve the LP, we use MATLAB and lp_solve IDE program. The performance evaluation results show that end-to-end throughput is improved by using multirate and intra-session network coding can achieve better throughput than opportunistic routing.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.429-437
• /
• 2013

Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.1
• /
• pp.101-108
• /
• 2005

Adaptive constant false alarm rate(CFAR) algorithm is used for good detection probability as well as constant false alarm rate in clutter background. Especially, filtering technique adaptive to spatial variation is necessary for improving detection quality in non stationary clutter environment which has spatial correlation and large magnitude deviation. In this paper, we propose a two-dimensional block interpolation(TBI) adaptive CFAR algorithm that calculates the node estimate in the fred two dimensional region and subsequently determines the final estimate for each resolution cell by two-dimensional interpolation. The proposed method is efficient for filtering abnormal ejection by adopting distribution median in fixed region and also has advantage of reducing required memory space by using estimation method which gets final values after calculating the block node values. Through simulations, we show that the proposed method is superior to the traditional adaptive CFAR algorithms which are transversal or recursive in aspect of the detection performance and required memory space.

• Journal of Korean Society of Transportation
• /
• v.24 no.3 s.89
• /
• pp.177-187
• /
• 2006

It is known that over one million car navigation devices are being currently used in Korea. Most. if not all, route guidance systems, however, Provide only one "best" route to users, not providing any options for various types of users to select. The current practice dose not consider each individual's different preferences. These days, a vast amount of information became available due to the rapid development in information processing technology. Thus, users Prefer choices to be given and like to select the one that suits him/her the "best" among available information. To provide such options in this Paper, we developed an algorithm that provides alternative routes that may not the "least cost" ones, but ones that are close to the "least cost" routes for users to select. The algorithm developed and introduced in the paper utilizes a link-based search method, rather than the traditional node-based search method. The link-based algorithm can still utilize the existing transportation network without any modifications, and yet enables to provide flexible route guidance to meet the various needs of users by allowing transfer to other modes and/or restricting left turns. The algorithm developed has been applied to a toy network and demonstrated successful implementation of the multi-path search algorithm for multi-purpose activities.

• Korean Journal of Oriental Medicine
• /
• v.12 no.3 s.18
• /
• pp.1-15
• /
• 2006

For the recent several years, there has been much interest in lexical semantic network. However, it seems to be very difficult to evaluate the effectiveness and correctness of it and invent the methods for applying it into various problem domains. In order to offer the fundamental ideas about how to evaluate and utilize lexical semantic networks, we developed two automatic word clustering systems, which are called system A and system B respectively. 68,455,856 words were used to learn both systems. We compared the clustering results of system A to those of system B which is extended by the lexical-semantic network. The system B is extended by reconstructing the feature vectors which are used the elements of the lexical-semantic network of 3,656 '-ha' verbs. The target data is the 'multilingual Word Net-CoreNet'.When we compared the accuracy of the system A and system B, we found that system B showed the accuracy of 46.6% which is better than that of system A, 45.3%.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.4
• /
• pp.508-516
• /
• 2016

When GPS signals are not available, a relative localization can be alternatively used to represent the topological relationship between mobile nodes. A relative location map of a network can be constructed by using the distance information between all the pairs of nodes in the network. If a network is large, a number of small local maps are individually constructed and are merged to obtain the whole map. However, this approach may result in a high computation and communication overhead. In this paper, we propose a reference-node selection scheme for relative localization map construction, which chooses a subset of nodes as a reference node that is supposed to construct local maps. The scheme is a greedy algorithm that iteratively chooses nodes with high degree as a reference node until the chosen local maps are successfully merged with a sufficient number of common nodes between nearby local maps. The simulation results indicate that the proposed scheme achieves higher localization accuracy with a reduced computational overhead.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.727-740
• /
• 2006

Schema matching is important as a prerequisite to the transformation of XML documents. This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: preliminary matching relationships between leaf nodes in the two XML schemas are computed based on proposed ontology and leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method is superior to previous works, resulting in a precision of 97% and a recall of 83 % on the average. Furthermore, the dynamic ontology increased by 9 percent overall.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.7
• /
• pp.785-797
• /
• 2014

Support for the precise time synchronization of EtherCAT, known as distributed clock (DC), enables the design of highly synchronized operations in distributed real-time systems. This study evaluates the performance of the EtherCAT DC through extensive experiments in a real automation system. We constructed an EtherCAT control system using Xenomai and IgH EtherCAT stack, and analyzed the clock deviation for different devices in the network. The results of the evaluation revealed that the accuracy of the synchronized clock is affected by several factors such as the number of slave devices, period of drift compensation, and type of system time base. In particular, we found that careful decision regarding the system time base is required because it has a fundamental effect on the master operation, which results in significantly different performance characteristics.