• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.20-25
• /
• 2005

A high performance Viterbi decoder is designed using modified register exchange scheme and block decoding method. The elimination of the trace-back operation reduces the operation cycles to determine the merging state and the amount of memory. The Viterbi decoder has low latency, efficient memory organization, and low hardware complexity compared with other Viterbi decoding methods in block decoding architectures. The elimination of trace-back also reduces the power consumption for finding the merging state and the access to the memory. The proposed decoder can be designed with emphasis on either efficient memory or low latency. Also, it has a scalable structure so that the complexity of the hardware and the throughput are adjusted by changing a few design parameters before synthesis.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2000.02a
• /
• pp.211-211
• /
• 2000

Carbon nanotubes (CNTs) have been spotlighted as one of promising field emission displays(FEDs). For the first time, to authors knowledge, we have developed the 9" color CNT-FEDs with the resolution of 240x576 lines. The 9" CNT-FEDs with diode-type and triode-type structures are presented. The well-dispersed CNT paste was squeezed onto the metal-patterned cathode glass. For the anode plate, the Y2O2S:Eu, ZnS:Ag,Cl low-voltage phosphors were printed for red, green, and blue colors, respectively. The vacuum-packaged panel maintained the vacuum level of 1x10-7 Torr. The uniform moving images vacuum-packaged panel maintained the vacuum level of 1x10-7 Torr. The uniform moving images were demonstrated at 2 V/um. High brightness of 800, 200, and 150cd/m2 was observed on the green, red, and blue phosphors at V/um, respectively. Field emission characteristics of a triode-type CNT-FED were simulated using a finite element method. the resultant field strength on the cathode was modulated by gate bias and emitted electrons were focused on the anode. A relatively uniform emission image was experimentally achieved at the 800V anode. A relatively uniform emission image was experimentally achieved at the 800V anode and the 50-180 V gate biases. Energy distribution of electrons emitted from CNTs was measured using an energy analyzer. The maximum peak of energy curve corresponded to the Fermi energy level of CNTs. The whole fabrication processed of CNT-FEDs were fully scalable and reproducible. Our CNT-FEDs has demonstrated the high potential of large-area and full-color applications with very low cost fabrication and low power consumption.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1505-1510
• /
• 2008

In large-scale wireless sensor networks, the deployed nodes cannot be replaced or recharged after first deployment. Also, dead nodes maγ lead to the partition of whole networks. While performing data dissemination under a battery power constraint, energy efficiency is a key design factor of routing protocol. As a solution for the efficient data dissemination, in this paper, we propose a protocol namely Hierarchical Data Dissemination (HDD) which provides scalable and efficient data delivery to multiple sources and mobile sinks. HDD uses the facts that sink nodes are central gathering Points and source-centric data forwarding paths are constructed and it is maintained with two-tier communications. The performance of HDD is compared with TTDD about the energy consumption, data delivery time and data success ration. The extensive simulation results show that HDD Routing Protocol outperforms TIDD by more than $1.5{\sim}3times$ on energy consumption.

• Smart Structures and Systems
• /
• v.6 no.5_6
• /
• pp.423-438
• /
• 2010

Wireless smart sensors enable new approaches to improve structural health monitoring (SHM) practices through the use of distributed data processing. Such an approach is scalable to the large number of sensor nodes required for high-fidelity modal analysis and damage detection. While much of the technology associated with smart sensors has been available for nearly a decade, there have been limited numbers of fulls-cale implementations due to the lack of critical hardware and software elements. This research develops a flexible wireless smart sensor framework for full-scale, autonomous SHM that integrates the necessary software and hardware while addressing key implementation requirements. The Imote2 smart sensor platform is employed, providing the computation and communication resources that support demanding sensor network applications such as SHM of civil infrastructure. A multi-metric Imote2 sensor board with onboard signal processing specifically designed for SHM applications has been designed and validated. The framework software is based on a service-oriented architecture that is modular, reusable and extensible, thus allowing engineers to more readily realize the potential of smart sensor technology. Flexible network management software combines a sleep/wake cycle for enhanced power efficiency with threshold detection for triggering network wide operations such as synchronized sensing or decentralized modal analysis. The framework developed in this research has been validated on a full-scale a cable-stayed bridge in South Korea.

• Journal of Energy Engineering
• /
• v.25 no.3
• /
• pp.27-33
• /
• 2016

The heat recovery system that was applied in this study, is the energy-saving type that can produce the maximum cooling capacity less power in use. In order to have a more precise control function the temperature and humidity of the constant temperature and humidity machine, control algorithm is applied to designed a fuzzy PID controller, and the outside air compensation device (air-cooled) demonstrated excellent ability to dehumidify the moisture, $-20^{\circ}C$ in winter. High efficiency and the low-noise type sirocco fan operate quitely and designed to fit the bottom-up and top-down in accordance with the characteristics of equipment. as a result of experiment data, the conversion efficiency is 95% or more, power recovery time is within 5sec, stop delay time is within 30sec, pump down time is 10sec, pump delay time is 5sec, heating delay time is 5sec, temperature deviation is ${\pm}2^{\circ}C$ (cooling deviation: $2^{\circ}C$, Heating deviation : $2^{\circ}C$), humidity deviation is a ${\pm}5%$ (humidification deviation 3.0%, dehumidification deviation 3.0%). Recently, ubiquitous technology is important. so, the constant temperature and humidity machine designed to be able to remotely control to via the mobile phone, and more scalable to support MMI software and automatic interface. Further, the life of the parts and equipment is extended by the failure.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.149-157
• /
• 2019

Recent research has been actively carried out on systems that want to optimize resource utilization by analyzing the intended behavior and pattern of behavior of objects (users, consumers). A service system that applies information about an object's location or behavior must include a location trigger processing system for tracking an object's real-time location. In this paper, we analyze design problems for the implementation of a context-awareness based location trigger system, and present system models based on analysis details. For this purpose, this paper introduces the concept of location trigger for intelligent location tracking techniques about moving situations of objects, and suggests a mobile agent system with active rules that can perform monitoring and appropriate actions based on sensing information and location context information, and uses them to design and implement the location trigger system for context-awareness based location services. The proposed system is verified by implementing location trigger processing scenarios and trigger service and action service protocols. In addition, through experiments on mobile agents with active rules, it is suggested that the proposed system can optimize the role and function of the application system by using rules appropriate to the service characteristics and that it is scalable and effective for location-based service systems. This paper is a preliminary study for the establishment of an optimization system for utilizing resources (equipment, power, manpower, etc.) through the active characteristics of systems such as real-time remote autonomous control and exception handling over consumption patterns and behavior changes of power users. The proposed system can be used in system configurations that induce optimization of resource utilization through intelligent warning and action based on location of objects, and can be effectively applied to the development of various location service systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.509-520
• /
• 2007

In this paper, we propose a real-time sensor node platform that guarantees the real-time scheduling of periodic and aperiodic tasks through a multitask-based software decomposition technique. Since existing sensor networking operation systems available in literature are not capable of supporting the real-time scheduling of periodic and aperiodic tasks, the preemption of aperiodic task with high priority can block periodic tasks, and so periodic tasks are likely to miss their deadlines. This paper presents a comprehensive evaluation of how to structure periodic or aperiodic task decomposition in real-time sensor-networking platforms as regard to guaranteeing the deadlines of all the periodic tasks and aiming to providing aperiodic tasks with average good response time. A case study based on real system experiments is conducted to illustrate the application and efficiency of the multitask-based dynamic component execution environment in the sensor node equipped with a low-power 8-bit microcontroller, an IEEE802.15.4 compliant 2.4GHz RF transceiver, and several sensors. It shows that our periodic and aperiodic task decomposition technique yields efficient performance in terms of three significant, objective goals: deadline miss ratio of periodic tasks, average response time of aperiodic tasks, and processor utilization of periodic and aperiodic tasks.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.89-99
• /
• 2005

Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.5
• /
• pp.583-594
• /
• 1999

With the advance of VLSI and network technologies, it has now become a common practice to deploy a various forms of distributed computing environments. A study shows that a lot of network-aware computers are in an idle state for considerable amount of time depending on the types of users and time frames of the day. If we can take the full advantage of those idle computers, we can obtain the enormous combined processing power without further costly investment. In this paper, we present a distributed batch-processing system, called the Java Distributed Batch-processing System (JDBS), which allows us to execute CPU-intensive, independent jobs across a pool of idle workstations on top of extant distributed computing environments. Since JDBS is implemented using a Java programming language, it not only extends the scope of machine types that can be joined to the pool, but makes it a lot easier to build an entire system. Besides, JDBS is scalable and fault-tolerant due to its multi-cluster organization and intelligent strategies. A graphical user interface is also provided to facilitate the registration and unregistration, job submission, and job monitoring.