• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1299-1310
• /
• 1992

Recently, digital realizations of timing recovery circuits for digital data transmission are of growing interest. As a result of digital realization of timing recovery circuits, new digital algorithms for timing error detection are required. In this paper, we present a new digital Angular Form(AF) algorithm which can be directly applied to QPSK modulation technique. AF algorithm is basically developed on the concepts of detected angle form and transition logic table. We evaluated the performance of this algorithm by Monte-Carlo simulation method under Gaussian and Impulsive noise environments. From the performance evaluation result, we show that the performance of AF Algorithm is better than that of Gardner in BER, RMS jitter, S-curve.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.12
• /
• pp.756-763
• /
• 2014

In this paper, we introduce a new sparse signal recovery algorithm referred to as the matching pursuit with greedy tree search (GTMP). The tree search in our proposed method is implemented to minimize the cost function to improve the recovery performance of sparse signals. In addition, a pruning strategy is employed to each node of the tree for efficient implementation. In our performance guarantee analysis, we provide the condition that ensures the exact identification of the nonzero locations. Through empirical simulations, we show that GTMP is effective for sparse signal reconstruction and outperforms conventional sparse recovery algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5116-5134
• /
• 2015

In this paper, due to the network security defense is mainly static defense, a dynamic classification network security defense strategy model is proposed by analyzing the security situation of complex computer network. According to the network security impact parameters, eight security elements and classification standard are obtained. At the same time, the dynamic classification algorithm based on fuzzy theory is also presented. The experimental analysis results show that the proposed model and algorithm are feasible and effective. The model is a good way to solve a safety problem that the static defense cannot cope with tactics and lack of dynamic change.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.10
• /
• pp.1001-1008
• /
• 1991

.In this paper the efficient clock recovery algorithm is proposed to regenerate the manchester code at the system using the Manchester encoding scheme such as LAN. Mobile communication and digital communication systems. The proposed clock recovery circuit recovers the clock using the two times of the same original transmitted frequency can be completely recovered. The implementation of the proposed clock recovery circuit and the interpretation of test results prove the validity of the proposed algorithm.

• Journal of Information Processing Systems
• /
• v.15 no.1
• /
• pp.55-66
• /
• 2019

Storage system often applies erasure codes to protect against disk failure and ensure system reliability and availability. Liberation code that is a type of coding scheme has been widely used in many storage systems because its encoding and modifying operations are efficient. However, it cannot effectively achieve fast recovery from single disk failure in storage systems, and has great influence on recovery performance as well as response time of client requests. To solve this problem, in this paper, we present HRSF, a Hybrid Recovery method for solving Single disk Failure. We present the optimal algorithm to accelerate failure recovery process. Theoretical analysis proves that our scheme consumes approximately 25% less amount of data read than the conventional method. In the evaluation, we perform extensive experiments by setting different number of disks and chunk sizes. The results show that HRSF outperforms conventional method in terms of the amount of data read and failure recovery time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2461-2466
• /
• 2003

This paper presents a simple sensor fusion algorithm using neural network for navigation of mobile robots with obstacle avoidance and trap recovery. The multiple sensors input sensor data to the input layer of neural network activating the input nodes. The multiple sensors used include optical encoders, ultrasonic sensors, infrared sensors, a magnetic compass sensor, and GPS sensors. The proposed sensor fusion algorithm is combined with the VFH(Vector Field Histogram) algorithm for obstacle avoidance and AGPM(Adaptive Goal Perturbation Method) which sets adaptive virtual goals to escape trap situations. The experiment results show that the proposed low-level fusion algorithm is effective for real-time navigation of mobile robot.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.920-930
• /
• 1999

Many researches on the multi-level QAM(Quadrature Amplitude Modulation) which is known to be a promising digital data transmission method for efficient use of channel bandwidth have been carried on, and their applications to various real fields are now being in progress. However, in the band-limited communication systems, each transmitted symbols is distorted by the ISI(Intersymbol Interference) and the phase error. Therefore, an equalizer and a carrier recovery must be taken into considerations to attenuate the effects of these distortions in the receiver. This paper presents an effective receiver structures that is applicable to the multi-level QAM. The proposed receiver system is consisted of an equalizer with Godard’s blind algorithm and a carrier recovery circuit. The phase error is estimated with a $\theta$-matching algorithm and is used in the carrier recovery to recover the correct phase. The simulation results are included to evaluate performance of the proposed receiver system for the various channel models.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.409-421
• /
• 2004

A database sharing system (DSS) couples a number of computing nodes for high performance transaction processing, and each node in DSS shares database at the disk level. In case of node failures in DSS, database recovery algorithms are required to recover the database in a consistent state. A database recovery process in DSS takes rather longer time compared with single database systems, since it should include merging of discrete log records in several nodes and perform REDO tasks using the merged lo9 records. In this paper, we propose a two version caching (2VC) algorithm that improves the cache fusion algorithm introduced in Oracle 9i Real Application Cluster (ORAC). The 2VC algorithm can achieve faster database recovery by eliminating the use of merged log records in case of single node failure. Furthermore, it can improve the performance of normal transaction processing by reducing the amount of unnecessary disk force overhead that occurs in ORAC.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.245-249
• /
• 2004

In this paper, we have proposed a clock recovery algorithm of Orthogonal Frequency Division Multiplexing/Quadrature Phase Shift Keying Modulation-Digital Microwave Radio(OFDM/QPSK-DMR) system using Band Limited-Pulse Shaping Filter(BL-PSF) and compared the clock phase error variance of OFDM/QPSK-DMR system with that of single carrier DMR system. The OFDM/QPSK-DMR system using windowing method requires training sequence or Cyclic Prefix (CP) to synchronize the clock phase of received signal. But transmit efficient is increased in our proposed DMR system because of no using redundant data such as training sequence or CP. The proposed clock recovery algorithm is simply realized in the OFDM/QPSK-DMR system using BL-PSF. The simulation results confirm that the proposed clock recovery algorithm has the same clock phase error variance performance in a single carrier DR system under Additive White Gaussian Noise(AWGN) environment.

• ETRI Journal
• /
• v.38 no.6
• /
• pp.1153-1162
• /
• 2016

This paper addresses the resource allocation (RA) problem in multi-cell cognitive radio networks. Besides the interference power threshold to limit the interference on primary users PUs caused by cognitive users CUs, a proportional fairness constraint is used to guarantee fairness among multiple cognitive cells and the impact of imperfect spectrum sensing is taken into account. Additional constraints in typical real communication scenarios are also considered-such as a transmission power constraint of the cognitive base stations, unique subcarrier allocation to at most one CU, and others. The resulting RA problem belongs to the class of NP-hard problems. A computationally efficient optimal algorithm cannot therefore be found. Consequently, we propose a suboptimal RA algorithm composed of two modules: a subcarrier allocation module implemented by the immune algorithm, and a power control module using an improved sub-gradient method. To further enhance algorithm performance, these two modules are executed successively, and the sequence is repeated twice. We conduct extensive simulation experiments, which demonstrate that our proposed algorithm outperforms existing algorithms.