• 제목/요약/키워드: Efficient implementation

검색결과 2,952건 처리시간 0.029초

알고리즘 분해방법을 이용한 Linear Window Operator의 구현 (A Linear Window Operator Based Upon the Algorithm Decomposition)

  • 정재길
    • 정보학연구
    • /
    • 제5권1호
    • /
    • pp.133-142
    • /
    • 2002
  • 본 논문에서는 linear window operator의 효율적인 구현 방안을 제안하였다. 블록 상태 공간함수를 이용하여 computational primitive를 찾아내고 이를 이용하여 프로세사의 datapath의 구현에 사용함으로서 효율적인 linear window operator의 구현을 가능하게 하였다. 또한 linear window operator의 실시간 처리를 위하여 데이터 분할 기법을 사용한 다중 프로세서 구조를 제안하였다. 블록의 크기에 따른 성능 분석을 통하여 제시된 프로세서 및 다중 프로세서의 성능이 우수함을 보였다.

  • PDF

Implementation of Context-Aware Middleware for Sensor Network in Ubiquitous Environment

  • Kim Bo-Seong;Lee Byoung-Hoon;Kim Jai-Hoon
    • International Journal of Contents
    • /
    • 제2권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.

  • PDF

FS-CELP 음성 부호화기의 고정 소수점 성능 분석 및 구현 (Fixed-point performance analysis and implementation of the FS-CELP vocoder)

  • 손종서;김시현;강지양;성원용
    • 한국통신학회논문지
    • /
    • 제21권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.

  • PDF

효율적 Cyclinc Extension을 갖는 Zipperqkdtlr의 VDSL 모뎀 (A Zipper-based VDSL Modem with an Efficient Cyclic Extension)

  • 위정욱
    • 한국통신학회논문지
    • /
    • 제25권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.

  • PDF

자동조절자 내부점 방법을 위한 선형방정식 해법 (Computational Experience of Linear Equation Solvers for Self-Regular Interior-Point Methods)

  • 설동렬
    • 경영과학
    • /
    • 제21권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.

가동형 차양 시스템의 구성과 에너지 효율 (Implementation and the Energy Efficiency of the Kinetic Shading System)

  • 한승훈
    • KIEAE Journal
    • /
    • 제14권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.

하이브리드 버켓을 이용한 대규모 집적회로에서의 효율적인 분할 개선 방법 (An efficient iterative improvement technique for VLSI circuit partitioning using hybrid bucket structures)

  • 임창경;정정화
    • 전자공학회논문지C
    • /
    • 제35C권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.

  • PDF

무선네트워크에서의 종단간 QoS를 고려한 적응적 협상 인터페이스 (Adaptive Negotiation Interface for End-to-End QoS in Mobile Network)

  • 장익규;박홍성
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 심포지엄 논문집 정보 및 제어부문
    • /
    • 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.

  • PDF

소형 폐가전 수거 시스템 개발 (Development of a Small Waste Appliance Collection System)

  • 차현철
    • 한국멀티미디어학회논문지
    • /
    • 제24권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.

전자정부 구현을 위한 효율적인 GPKI 구축 방안 (Implementation of Efficient GPKI for E-Government)

  • 장홍종;박인재;이정현
    • 정보보호학회논문지
    • /
    • 제10권4호
    • /
    • pp.113-127
    • /
    • 2000
  • 전자정부 구현에 있어 온라인 상에서 유통되는 각종 행정정보들에 대한 정보보호는 필수적인 선결 조건이다. 미국 등 각국에서는 전자정부의 정보보호 기반 구축을 위하여 가상행정 환경에서 당사자의 신원 확인, 기밀성, 무결성, 부인봉쇄 등을 보장하는 정부타원의 PKI(Public Key Infrastructure)를 구축 운영 중에 있다. 본 논문에서는 미국 등 선진 국의 사례 연구 분석을 통하여 우리나라 실정에 적합한 효율적인 GPKI(Government PKI) 구축방안을 제시하였다.