• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.221-223
• /
• 2012

많은 대학과 스토리지 업체에서 고성능 병렬 파일시스템 관련 연구를 활발히 진행하고 있다. 그러나 대학이나 업체에서 연구된 병렬 파일시스템 기술은 상호 호환성에 제약이 있다. 네트워크 파일시스템 관련해서 유일한 표준 기술인 NFS은 최근 pNFS 기능을 포함한 NFSv4.1로 확장되었다. pNFS은 NFS 서버를 거치지 않고 데이터를 병렬적으로 접근함으로써 고성능 입출력을 보장해 주고 있으며 기존 스토리지 기술과의 호환성을 제공하고 있다. 본 연구에서는 pNFS의 성능 평가를 위해서 pNFS을 사용하는 대용량 스토리지 시스템을 구현하고 NFSv4와 NFSv4.1간 성능을 비교한다. 성능 비교는 파일 사이즈와 동시 수행 프로세스 수 별로 수행되며 읽기 및 쓰기 연산에 대한 pNFS의 성능 향상을 확인한다.

• Proceedings of the KIPE Conference
• /
• 2011.07a
• /
• pp.555-556
• /
• 2011

본 논문은 중, 고용량 통신용 정류기에 적합한 고효율 PFC Topology를 선정하여 특성 및 성능을 비교한다. 선정회로는 Conventional Average Current Mode PFC, Back-To-Back Bridgeless PFC, Semi-Bridgeless PFC, Interleaved PFC 이다. 통신용 1U 표준사이즈의 2kw PFC 정류기 제작 및 시험을 통해 각 Topology의 성능 차이점을 확인한다.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.776-777
• /
• 2015

본 논문에서는 송전급 전력계통 적용을 위한 축자계 방식의 전극 구조를 갖는 진공 인터럽터의 전자계 해석 및 설계에 대해서 기술하였다. 상대적으로 극간 거리가 먼 초고압 진공인터럽터의 전극 구조로 축자계 방식을 채택하였으며, 효과적인 아크 확산 면적을 확보하기 위하여 자계 해석을 통해 전극 사이즈를 선정하였다. 또한, 접지된 금속외함 내에서 진공 인터럽터의 절연을 확보하기 위하여 전계 해석을 통해 전극 및 쉴드 등의 형상 설계를 수행하였다. 본 논문에서는 72.5kV 40kA 정격의 진공 인터럽터의 설계를 위한 전자계 해석 결과를 실험결과와 비교하여 설계 기준의 타당성을 검증하였고, 국제표준인 IEC 62271-100의 시험 규격에 의한 차단시험을 통하여 설계된 진공 인터럽터의 성능을 검증하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.781-784
• /
• 2007

정보화 사회가 진행되어감에 따라 카메라 센서, 디지털 카메라, 휴대폰, 영상 관련디지털 기기들이 증가하고 이로 인하여 영상정보 서비스 기술의 중요성이 크게 부각되었다. 특히 멀티미디어 응용서비스 기술에서는 영상 정보가 필수적인데, 그 영상 정보의 양이 너무 방대하여 압축 부호화를 하여 사용되고 있다. 본 논문에서는 정지영상압축 방법 중 JPEG표준에서 제시한 4가지 동작 모드 중 베이스라인을 기반으로 하는 JPEG압축 알고리즘을 연구하여 허프만 인코더의 메모리 사이즈를 줄인 엔트로피 인코더를 C언어를 통해 시뮬레이션하고 최적화된 결과를 VHDL로 구현하여 향후 디코더나 Motion JPEG연구에 응용 가능하도록 연구 및 분석, 평가 하였다. 설계결과 11-bit 한 입력 데이터가 처리되는데 5-clock이 소요 되었고 Xilinx xc3s1000 환경에서 21,962개의 게이트 수와 74.212MHz의 동작 속도를 나타내었다.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.7
• /
• pp.93-101
• /
• 2020

Regional CRL(certificate revocation list) in vehicular communications is to partition Full CRL into several small CRLs according to geographic location to keep the size of individual CRLs with smaller. However, since a Regional CRL includes vehicle's revoked certificates within its administrative region, it has to know vehicle' location. For this, how to know vehicle' location effectively corresponding to every region represents a major challenge. This paper proposes a Regional CRL scheme which is envisioned to achieve vehicle's location and to make regional CRLs according to vehicles current location efficiently. The scheme is based on the short-lived pseudonyms defined by WAVE standard. It also acquires issued pseudonyms, vehicle's id and region information whenever a vehicle initiates pseudonyms refill after that, utilizes them to create and distribute the Regional CRL. To keep location privacy-preserving for vehicles, the scheme uses the blockchain technology in the network. The analysis results show that it reduces CRL size and database query time for finding revoked certificates sharply in the vehicle's on-board unit.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• Journal of Broadcast Engineering
• /
• v.21 no.3
• /
• pp.341-348
• /
• 2016

HEVC is the next compression standard and is expected to be used widely replacing the conventional H.264/AVC standard. The compression ratio of the HEVC is twice times than H.264/AVC, whereas its computational complexity is increased by up to 40%. Many research efforts have been made to reduce the computational complexity and to speed up encoding. For intra coding, the rough mode decision (RMD) is commonly applied. The rate-distortion optimization (RDO) process to decide the best mode is too complex so that RMD chooses the candidate modes with a simple process and sends the candidates to RDO process. However, for large-size blocks, the RMD also requires considerable computations. In this paper, a down-sampling scheme is proposed for the RMD process. The reference pixel loading, predicted pixel generation are performed using the down-sampled pixel data. When the proposed scheme is applied to the RMD, the computational complexity is reduced by 70% with a marginal bitrate increase of 0.04%. In terms of area of hardware-based RMD, the gate count and the buffer size is reduced 33% and 66%, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.95-105
• /
• 2010

IEEE 802.15.4 is the one of the protocols for radio communication in a personal area network. Since it aims to provide low cost and low power communication for ubiquitous communication, it requires high level of optimization in implementation. Recently, there have been many studies on the performance evaluation of IEEE 802.15.4 MAC protocol. According to the results of the studies, it is tendency that the transceiver is implemented to SoC type. On the implementation, the specific functions of MAC like CSMA-CA and MAC frame handling is designed to hardwired functions. In this paper, we implemented the protocol with hardwired low MAC (HL-MAC) and its state machine for the optimization from the physical layer and MAC layer. it has the characteristics of the small code size and the enhanced power consumption.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.271-282
• /
• 2013

Recently, ITU-T/VCEG and ISO/IEC MPEG have started a new joint standardization activity on video coding, called High Efficiency Video Coding (HEVC). This new standard gives significant improvement in terms of picture quality for high resolution video. The main challenge in this upcoming standard is the time complexity. In this paper we have focused on CU splitting algorithm. We have proposed a novel algorithm which can terminate the CU splitting process early based on the RD cost of the parent and current level and the motion vector value of the current CU. Experimental result shows that our proposed algorithm gives on average more than about 10% decrement in time over ECU [8] with on average 1.78% of BD loss on the original.