• Proceedings of the KIEE Conference
• /
• 2003.10a
• /
• pp.170-173
• /
• 2003

The driving method is one of the most important factors of PDP, so various driving methods have been developed to improve the duality of PDP Nowadays, most of PDPs apply to ADS (Address and Display period Separated) driving method. In this paper, a new driving method that divides scan lines into multi-Blocks is suggested. The proposed driving method in this paper can drive 14 sub-fields per 1 TV field in SD panel, 16 sub-fields per 1 TV field in HD panel. And sufficient Address margin can be obtained.

• Journal of information and communication convergence engineering
• /
• v.7 no.1
• /
• pp.35-40
• /
• 2009

Many researchers strive to research on ways on how to improve the performance of RFID system and many papers were written to solve one of the major drawbacks of potent technology related with data management. As RFID system captures billions of data, problems arising from dirty data and large volume of data causes uproar in the RFID community those researchers are finding ways on how to address this issue. Especially, effective data management is important to manage large volume of data. Data reduction techniques in attempts to address the issues on data are also presented in this paper. This paper introduces readers to a new data reduction algorithm that might be an alternative to reduce data in RFID Systems. A process on how to extract data from the reduced database is also presented. Performance study is conducted to analyze the new data reduction algorithm. Our performance analysis shows the utility and feasibility of our categorization reduction algorithms.

• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.179-182
• /
• 2000

We have proposed a new driving method of AC PDPs for high resolution and high luminance, in which address pulses shorter than 1 $\mu$sec and increase address time, make it possible to drive 2100 scan lines The proposed driving scheme also allows high sustain frequency, leading to improved luminance. The experiment with a 4-inch color AC PDP with 30$\times$58 pixels realized a high luminance of 850cd/$m^2$ when the sustain voltage of 140v with the frequency of 125KHz is applied to the panel, and showed the possibility of the proposed driving scheme for high luminance and high resolution AC PDPs with 2100 lines.

• Proceedings of the KIEE Conference
• /
• 2002.07c
• /
• pp.1636-1639
• /
• 2002

We proposed the new reset waveform for reducing reset period. The square pulse is applied to the address electrode when the ramp pulse increases before a discharge occurs between sustain electrodes. If the discharge occurs between address electrode and X electrode, the wall charge is reversely accumulated between sustain electrodes compared with the applying voltage before the discharge occurs between sustain electrodes. So the next discharge more weakly occurs between sustain electrodes. If the more weak discharge is obtained, it can make the low background luminance and the high contrast ratio and reduce ramp up time in the ramp reset waveform.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.227-230
• /
• 2003

Mobile SCTP (mSCTP) is a new scheme which can be used to provide seamless handover for the mobile node. The reason that is possible is because of the SCTP extension which provides a method to reconfigure IP address on an existing SCTP association (ADDIP). While mSCTP focuses on an association originated ken mobile node (MN) toward fixed correspondent node (CN), mSCTP with Mobile IP support an association originated from CN toward MN by using the Home Agent in Mobile IP and location management. However, there are still some problems related to communication interruption. In this paper, we present a new scheme to solve these problems. The main idea of this scheme is using the home address of MN as a backup path of an SCTP association.

• Journal of KIBIM
• /
• v.13 no.1
• /
• pp.22-32
• /
• 2023

Due to the increased use of digital maps in the construction industry, there is a growing demand for high-quality digital map analysis. With the large amounts of data found in digital maps at earthwork sites, there is a particular need to enhance the accuracy and speed of digital map analysis. To address this issue, our study aims to develop new technology and verify its performance to address non-ground and range mismatch issues that commonly arise. Additionally, our study presents a new digital map analysis framework for earthwork sites that utilizes three newly developed technologies to improve the performance of digital map analysis. Through this, it achieved about 95% improvement in analysis performance compared to the existing framework. This study is expected to contribute to the improvement of the quality of digital map analysis data of earthworks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2B
• /
• pp.138-143
• /
• 2003

One of the important design issues for IP routers responsible for packet forwarding in computer networks is the route-lookup mechanism. For each incoming packet, IP routing requires that a router performs a longest-prefix-match address lookup in order to determine the next hop that the incoming packet should be forwarded to. In this paper, we present a new scheme which applies the hashing function for IP address lookup. In the proposed scheme, the forwarding table is composed of multiple SRAMs, and each SRAM represents an address lookup table in each prefix. Hashing function is applied in order to find out the matching entries from the address lookup tables in parallel, and the entry with the longest prefix match among them is selected. Simulation using the MAE-WEST router example shows that a large routing table with 37000 entries can be compacted to a forwarding table of 300 Kbytes in the proposed scheme. It is also shown that the proposed scheme achieves one route lookup every 1.93 memory accesses in average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1510-1518
• /
• 2006

As a promising technology that enables ubiquitous computing and leads IT(information Technology) industries of next generation, the exciting new field of sensor networks is attracting so much attention and considered to be the one of the hottest research topics these days. From now on, all the each node, forming a network, and even the sensor network itself will interact with the generic network and evolve dynamically according to the change of environment with the perpetual creation and extinction. In this paper, we purpose the dynamic address interworking scheme for interactive networking between sensor network and Internet(IPv6). Proposed scheme is enable to interworking dynamically between sensor network address scheme based on Zigbee and Internet address scheme based on IP. Additionally, we implement the proposed address interworking scheme using Berkeley TinyOS, mica motes, and IP protocol. And, we verify the proposed scheme by the interconnection experimental between wireless sensor networks and Internet based on IPv4/IPv6.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.285-295
• /
• 2008

Internet routers perform packet forwarding which determines a next hop for each incoming packet using the packet's destination IP address. IP address lookup becomes one of the major challenges because it should be performed in wire-speed for every incoming packet under the circumstance of the advancement in link technologies and the growth of the number of the Internet users. Many binary search algorithms have been proposed for fast IP address lookup. However, tree-based binary search algorithms are usually unbalanced, and they do not provide very good search performance. Even for binary search algorithms providing balanced search, they have drawbacks requiring prefix duplication. In this paper, a new binary search algorithm which provides the balanced binary search and the number of its entries is much less than the number of original prefixes. This is possible because of composing the binary search tree only with disjoint prefixes of the prefix set. Each node has a prefix vector that has the prefix nesting information. The number of memory accesses of the proposed algorithm becomes much less than that of prior binary search algorithms, and hence its performance for IP address lookup is considerably improved.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.84-98
• /
• 2009

Various algorithms and architectures for IP address lookup have been studied to improve forwarding performance in the Internet routers. Previous IP address lookup architecture using Bloom filter requires a separate Bloom filter as well as a separate hash table in each prefix length, and hence it is not efficient in implementation complexity. To reduce the number of hash tables, it applies controlled prefix expansion, but prefix duplication is inevitable in the controlled prefix expansion. Previous parallel multiple-hashing architecture shows very good search performance since it performs parallel search on tables constructed in each prefix length. However, it also has high implementation complexity because of the parallel search structure. In this paper, we propose a new IP address lookup architecture using all-length Bloom filter and all-length multiple hash table, in which various length prefixes are accomodated in a single Bloom filter and a single multiple hash table. Hence the proposed architecture is very good in terms of implementation complexity as well as search performance. Simulation results using actual backbone routing tables which have $15000{\sim}220000$ prefixes show that the proposed architecture requires 1.04-1.17 memory accesses in average for an IP address lookup.