• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.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
• /
• v.16 no.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).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.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.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.507-517
• /
• 2003

A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.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
• /
• v.25 no.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)
• /
• v.11 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.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학회:학술대회논문집
• /
• 2007.02a
• /
• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.53-61
• /
• 2004

This paper proposes two types of sub-network based on dynamic restoration schemes to improve survivability of GMPLS networks and analyzes characteristics of these two schemes. The first proposed scheme divides with a whole GMPLS network into several sub-networks, applies a mixture of both restoration and protection methods according to fault location. The other scheme divides a whole GMPLS network into primary and secondary sub-networks, applies a restoration method in each sub-network according to fault location. In our simulation, we evaluate the performances of network resource utilization, restoration success rate, and mean restoration time and conduct its comparative analysis with conventional schemes. The simulation results show that the efficiency of network resource utilization in the proposed schemes is increased as compared with conventional restoration schemes (l＋l, 1:1, 1:N) in case of single-failed link. By contrast, we found that the performances of restoration success rate and mean restoration time in case of multi-failed link is lower than conventional restoration schemes. However, the probability that multi-failed link is occurred is very low so that the problem in practical GMPLS network is negligible.