• The Journal of Information Technology
• /
• v.5 no.1
• /
• pp.133-142
• /
• 2002

This paper presents an efficient implementation of the linear window operator. I derived computational primitives based upon a block state space representation. The computational primitive can be implemented as a data path for a programmable processor, which can be used for the efficient implementation of a linear window operator. A multiprocessor architecture is presented for the realtime processing of a linear window operator. The architecture is designed based upon the data partitioning technique. Performance analysis for the various block size is provided.

• International Journal of Contents
• /
• v.2 no.1
• /
• pp.9-16
• /
• 2006

Recently many researches are investigating for ubiquitous computing and network. In the real world many sensor devices must be equipped to provide many services for users. To make computing environment easy and more user friendly, middleware system not only hides all complexities (network, system, services, etc), but also needs to have efficient context inference scheme and system reconfiguration capability. In this paper we suggest context-aware middleware design for sensor network which provides efficient computing environment for end-users. We also present XML based implementation of our system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.365-374
• /
• 1996

Finite wordlength effects of the FS-1016 CELP(Code Excite Linear Prediction) vocoder algorithm) is analyzed, and a block floating-Point implementation method is employed to improve the fixed-point performance. An efficient run-time integer wordlength estimation algorithm is developed, and the overall system performance. An efficient run-time integer wordlength estimation algorithm is developed, and the overall system performance is verified in real-time using a TMS320C50 emulation board. Autoscaler software that conducts simulation-based automatic scaling to provide a floating-point like programming environment is used for this application development.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1793-1802
• /
• 2000

In this paper we propose an efficient implementation technique for cyclic extension in VDSL(Very High bit-rate Digital Subscriber Line) systems using Zipper duplexing and analyze its performances under typical telephone channel environments. In Zipper-based VDSL systems each DTM(discrete-multitone) block is appended by both cyclic prefix(CP) and cyclic suffix(CS). The CP is inserte to prevent both intersymbol interference (ISI) and iterchannel interference (ICI) while the CS is appended to ensure orthogonality between the upstream and downstream carriers thus preventing near-end crosstalk (NEXT). However in order to implement the CP in the transmitter side of the VDSL system an additional hardware is required to append the latter part of each DMT symbol to the beginning of the DMT symbol. In this paper we propose a VDSL system with Zipper duplexing using only CS to reduce hardware complexity (memory and processing delay) required for implementation of CP. It is shown by computer simulation that the proposed approach has the same capacity under typical channel environments as the previous Zipper-based VDSL system using both CP and CS. even with a significantly lower hardware complexity.

• Korean Management Science Review
• /
• v.21 no.2
• /
• pp.43-60
• /
• 2004

Every iteration of interior-point methods of large scale optimization requires computing at least one orthogonal projection. In the practice, symmetric variants of the Gaussian elimination such as Cholesky factorization are accepted as the most efficient and sufficiently stable method. In this paper several specific implementation issues of the symmetric factorization that can be applied for solving such equations are discussed. The code called McSML being the result of this work is shown to produce comparably sparse factors as another implementations in the $MATLAB^{***}$ environment. It has been used for computing projections in an efficient implementation of self-regular based interior-point methods, McIPM. Although primary aim of developing McSML was to embed it into an interior-point methods optimizer, the code may equally well be used to solve general large sparse systems arising in different applications.

• KIEAE Journal
• /
• v.14 no.5
• /
• pp.67-73
• /
• 2014

This study aims at examining kinetic efficient shading systems and their implementation methods. These days, the importance of the shading devices are getting more significant due to the energy problem. Cordially, suitable shade designs are required as an important element for the exterior envelope of the building. This study employs the optimal shading design as an efficient shading method with the kinetic system that can be converted actively by the altitude of the sun. The proposed kinetic shading system works not only as a lightshelf in case the altitude of the sun is high but also as a vertical louver when the sun is getting lower in order to block the direct sunlight. This study has analyzed the thermal performance and shading coefficient of the kinetic shading system in comparison to existing fixed shading devices using the Ecotect. The results, in sum, conclude that the suggested kinetic shading system could decrease direct sunlights 26.2% more than the existing shading methods.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.16-23
• /
• 1998

In this paper, we present a fast and efficient Iterative Improvement Partitioning(IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. The IIP algorithms are very widely used in VLSI circuit partition due to their time efficiency. As the performance of these algorithms depends on choices of moving cell, various methods have been proposed. Specially, Cluster-Removal algorithm by S. Dutt significantly improved partition quality. We indicate the weakness of previous algorithms wjere they used a uniform method for choice of cells during for choice of cells during the improvement. To solve the problem, we propose a new IIP technique that selects the method for choice of cells according to the improvement status and present hybrid bucket structures for easy implementation. The time complexity of proposed algorithm is the same with FM method and the experimental results on ACM/SIGDA benchmark circuits show improvment up to 33-44%, 45%-50% and 10-12% in cutsize over FM, LA-3 and CLIP respectively. Also with less CUP tiem, it outperforms Paraboli and MELO represented constructive-partition methods by about 12% and 24%, respectively.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.68-70
• /
• 2004

In this paper we develop an adaptive interface between video compression and transission protocols to handle QoS fluctuations that are common to mobile communication systems. We consider various generic design alternatives for QoS adaptation and identify 'QoS negotiation' as the most promissing. This method gives the best possibilities to obtain system-wide efficiency. To handle the indued system complexity we apply a design philosophy (called ARC) that separates implementation dependencies by introducing QoS interfaces between system modules. In the ARC phlosophy the implementation details are hidden in the subsystems. To assure efficient adaptation, the QoS must be negotiated between modules. We select the QoS parameters that are both necessary and sufficient for efficient negotiation between the video encoder and protocol modules. We describe the relation between the QoS parameters at the interface and the internal parameters of common video coding methods and protocol elements. Furthermore, we describe a negotiation procedure that allows a system-wide optimum to emerge.

• Journal of Korea Multimedia Society
• /
• v.24 no.12
• /
• pp.1653-1662
• /
• 2021

In this paper, we propose a small waste appliance collection system that can be used for efficient waste appliance collection, and implement an unmanned automatic small waste appliance collector system. First, we collected cases related to the collection of waste home appliances, compared and analyzed methods, and arranged the characteristics. We analyzed at the requirements for the collection and management system of waste appliances by dividing it into the aspect of the discharger and the recycling business company. The collection system consists of a client-server structure, which is a collector system and a collection management server. The unmanned automatic collector system is divided into a control unit and a machine/mechanical unit. We identified the functions that the collector system must perform and the hardware required to perform these functions. Based on this, the collector system was implemented as an embedded system. The hardware and software used in the implementation are described and the implementation results are described. The collection system developed in this paper will contribute to the development of urban mining industry by enabling the efficient collection of waste appliances.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.4
• /
• pp.113-127
• /
• 2000

It is an essential prior condition that information security of all sorts of administration-information on line for E-Government. Every country including United Slates has been constructing and managing Government PKI(Public Key Infrastructure) of information security of one\`s own authentication, confidentiality, integrity, non-repudiation in administration environment on line for information security base construction of E-Government. In this paper, we present an efficient GPKI(Government PKI) implementation suitable for Korea actual circumstance through study and analysis of superior case such as United State.