• 한국군사과학기술학회지
• /
• 제14권5호
• /
• pp.957-964
• /
• 2011

New time schemes based on the FEM were developed and their performances were tested with 2D wave equation. The least-squares and weighted residual methods are used to construct new time schemes based on traditional residual minimization method. To overcome some drawbacks that time schemes based on the least-squares and weighted residual methods have, ad-hoc method is considered to minimize residuals multiplied by others residuals as a new approach. And variational method is used to get necessary conditions of ad-hoc minimization. A-stability was chosen to check the stability of newly developed time schemes. Specific values of new time schemes are presented along with their numerical solutions which were compared with analytic solution.

• Journal of Power Electronics
• /
• 제16권2호
• /
• pp.621-630
• /
• 2016

In this paper, a single current sensor technique (SCST) is proposed for single-phase full-bridge inverters. The proposed SCST measures the currents of multiple branches at the same time, and reconstructs the average inductor, capacitor, and load current in a single switching cycle. Since all of the branches' current in the LC filter and the load are obtained using the SCST, both the inductor and the capacitor current feedback schemes can be selectively applied while taking advantages of each other. This paper also analyzes both of the current feedback schemes from the view point of the closed-loop output impedance. The proposed SCST and the analysis in this paper are verified through experiments on a 3kVA single-phase uninterruptible power supply (UPS).

• 한국통신학회논문지
• /
• 제21권2호
• /
• pp.383-393
• /
• 1996

This paper considers the evaluation of the ecquistion performance for an accesschannel preamble based on a random access procedure of direct sequence code division multiple access(DS/CDMA) reverse link. The parallel acquistion technique that employs the single-well detection scheme and the multiple-dwell(double-dwell) detection scheme is mentioned. The acquisition performance for two detection schemes is compared in therms of the acquisition probability and the acquisition time. The parallel acquisition is done by a bank of N parallel I/Q noncoherent correlators. Expressions on the detection, false alarm, and miss probabilities of the single-dwell and multiple-dwell(double-well) detection schemes are derived for multiple H$_{1}$ cells and multipath Rayleight fading channel. comparing the single-dwell detection scheme with the multiple-dwell(double-dwell) detection scheme in the case of employing the parallel acquisition technique in the reverse link,the numerical results show that the single-dwell detection scheme deomonstrates a better performance.

• 대한전자공학회논문지SD
• /
• 제40권7호
• /
• pp.507-517
• /
• 2003

메쉬 기반의 파장분할다중화(WDM)망에서는 단 하나의 광섬유 케이블의 장애로도 심각한 데이터의 손실을 야기할 수 있다. 따라서, 이러한 장애에 대한 효율적인 복구 알고리즘이 필요하다 본 논문에서는 메쉬기반의 WDM 망에서의 복구 기법에 대한 새로운 알고리즘을 제안하였고 기존의 복구 기법과 비교하였다. 복구 방법으로는 경로 복구, 링크 복구의 대표적인 두 가지 기법이 있다. 이러한 기법들의 한 가지 공통점은 단일 링크장애에 대해서 논하고 있다는 것이다. 본 논문에서 제안한 복구 기법에서는 각각의 링크 장애에 대한 복구 경로를 확보하지 않는다. 메쉬 기반의 WDM망을 여러 개의 작은 폐루프로 분리하고 폐루프내에서 단일 링크 장애가 발생하면 그 폐루프를 우회하여 복구 경로가 결정되는 복구 기법과 복구 경로가 폐루프 내에서만 결정되는 복구 기법을 제안하였다. 경로 복구 기법과 링크 복구 기법과 더불어 제안된 기법의 성능을 비교하였다. 시뮬레이션 결과 제안된 두 기법은 비록 총 사용되는 파장 마일리지가 기존의 복구 기법보다 10%에서 50% 정도 증가하게 되지만 경로 설정에 소요되는 실행시간(CPU Time)은 경로 복구 기법과 링크 복구 기법에 비해 상당히 감소되는 결과를 얻게 되었다.

• 한국통신학회논문지
• /
• 제36권1A호
• /
• pp.41-48
• /
• 2011

This paper proposes an efficient code acquisition scheme for direct-sequence spread spectrum (DSSS) based real-time locating systems (RTLS). The proposed scheme employs multiple bit integration to significantly decrease false alarms when no packet signal is transmitted and increase the detection probability when the RTLS tags are excited. The performance of the proposed code acquisition scheme is analyzed and numerically evaluated, and compared with those of single-dwell and traditional double-dwell code acquisition schemes. The simulation results show that the proposed multiple-bit integration scheme outperforms single-dwell and double-dwell schemes.

• ETRI Journal
• /
• 제25권2호
• /
• pp.144-147
• /
• 2003

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권2호
• /
• pp.826-845
• /
• 2017

Outsourcing computation is one of the most important applications in cloud computing, and it has a huge ability to satisfy the demand of data centers. Modular exponentiation computation, broadly used in the cryptographic protocols, has been recognized as one of the most time-consuming calculation operations in cryptosystems. Previously, modular exponentiations can be securely outsourced by using two untrusted cloud servers. In this paper, we present two practical and secure outsourcing modular exponentiations schemes that support only one untrusted cloud server. Explicitly, we make the base and the index blind by putting them into a matrix before send to the cloud server. Our schemes provide better performance in higher efficiency and flexible checkability which support single cloud server. Additionally, there exists another advantage of our schemes that the schemes are proved to be secure and effective without any cryptographic assumptions.

• 한국통신학회논문지
• /
• 제33권10A호
• /
• pp.980-986
• /
• 2008

Spatial multiuser access is investigated for the reverse link of multiuser multiple-input multiple-output (MIMO) systems. In particular, we consider two alternative a aches to spatial multiuser access that adopt the same detection algorithm at the base station: one is a closed-loop approach based on singular value decomposition (SVD) of the channel matrix, whereas the other is an open-loop approach based in space-time block coding (STBC). We develop multiuser detection algorithms for these two spatial multiuser access schemes based on the minimum mean square error (MMSE) criterion. Then, we compare the bit error rate (BER) performance of the two schemes and a single-user MIMO scheme. Interestingly, it is found that the STBC approach can provide much better BER performance than the SVD approach as well as than a single-user MIMO scheme.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2007년도 학술대회 1부
• /
• pp.982-987
• /
• 2007

The necessity of data compression scheme for volume data has been increased because of the increase of data capacity and the amount of network uses. Now we have various kinds of compression schemes, and we can choose one of them depending on the data types, application fields, the preferences, etc. However, the capacity of data which is produced by application scientists has been excessively increased, and the format of most scientific data is 3D volume. For 2D image or 3D moving pictures, many kinds of standards are established and widely used, but for 3D volume data, specially time-varying volume data, it is very difficult to find any applicable compression schemes. In this paper, we present a compression scheme for encoding time-varying volume data. This scheme is aimed to encoding time-varying volume data for visualization. This scheme uses MPEG's I- and P-frame concept for raising compression ratio. Also, it transforms volume data using Daubechies D4 filter before encoding, so that the image quality is better than other wavelet-based compression schemes. This encoding scheme encodes time-varying volume data composed of single precision floating-point data. In addition, this scheme provides the random reconstruction accessibility for an unit, and can be used for compressing large time-varying volume data using correlation between frames while preserving image qualities.

• 대한전자공학회논문지TC
• /
• 제41권5호
• /
• pp.53-61
• /
• 2004

본 논문에서는 GMPLS 네트워크의 생존성을 높이기 위해 서브네트워크를 이용한 2가지 유형의 동적 복구 방안들을 제안하고, 그의 특성을 분석한다. 제안한 방식은 전체 GMPLS 네트워크를 몇 개의 서브네트워크로 나누고, 장애가 발생된 장소에 따라 복구 방식과 보호 방식을 혼합하여 적용한 방식과 GMPLS 네트워크를 주 서브네트워크와 보조 서브네트워크로 나누고 장애가 발생한 지점에 따라 서브네트워크 별로 복구 방식을 적용하는 방안이다. 두 방식의 성능을 시뮬레이션을 통해 네트워크자원 이용 율과 복구 성공률, 평균 복구 시간을 분석하고, 기존 방식과 비교 분석하였다. 그 결과 기존 l＋l, 1:1, 1:N의 보호 방식보다는 두 방식 모두 자원이용 효율은 증가하였다. 복구 성공률과 평균 복구 시간은 기존의 경로 복구 방식에 비해, 단일 장애에 대해서는 우수하지만 다중 장애에 대해서는 약간 열세임을 확인하였다. 그러나 단일 경로에서 다중 링크 장애가 발생할 확률은 낮으므로, 실제 적용 시 문제가 되지 않는다.