• 디지털콘텐츠학회 논문지
• /
• 제8권3호
• /
• pp.385-391
• /
• 2007

HFC 망 상향채널의 용량을 증대시키기 위한 차세대 케이블 모뎀 기술의 하나인 S-DMT 방식 케이블 모뎀의 주파수 동기 알고리즘 제안하고 성능을 평가하였다. 다수 반송파 전송 시스템의 주파수 동기 알고리즘들에 대한 분석을 통하여, 데이터 프레임의 프리앰블 필드 내에 약속된 반복 패턴의 훈련열을 삽입하여 전송하고, 파일롯 신호를 이용하여 잔류 주파수 오프셋에 따른 위상오차를 보정하는 방법을 제안하고 시뮬레이션을 통해 AWGN 잡음 환경에서의 성능을 평가 하였다. 성능 평가 결과, 파일롯 신호의 수와 크기에 따라 성능 차이를 보이나, 제안한 주파수 동기 알고리즘이 신속한 동기를 필요로 하는 S-DMT 방식 상향채널 케이블 모뎀에 적합하고 양호한 성능을 보임을 확인하였다.

• Journal of Information Processing Systems
• /
• 제16권1호
• /
• pp.30-41
• /
• 2020

Lines and textures are natural properties of the surface of natural objects, and their images can be sparsely represented in suitable frames such as wavelets, curvelets and wave atoms. Based on characteristics that the curvelets framework is good at expressing the line feature and wavesat is good at representing texture features, we propose a model for the weighted sparsity constraints of the two frames. Furtherly, a multi-step iterative fast algorithm for solving the model is also proposed based on the split Bergman method. By introducing auxiliary variables and the Bergman distance, the original problem is transformed into an iterative solution of two simple sub-problems, which greatly reduces the computational complexity. Experiments using standard images show that the split-based Bergman iterative algorithm in hybrid domain defeats the traditional Wavelets framework or curvelets framework both in terms of timeliness and recovery accuracy, which demonstrates the validity of the model and algorithm in this paper.

• Journal of information and communication convergence engineering
• /
• 제9권5호
• /
• pp.615-618
• /
• 2011

Living cells generate the cell cycle or apoptosis, depending on the course will be repeated. If an error occurs during this period of life in order to maintain the cells in the peripheral cells find the error portion. These cellular functions were applied to the system to simulate the circuit. Circuit implementation of the present study was constructed the redundant structure in order to found the error quickly. Self-repairing of digital systems as an advanced form of fault-tolerance has been increasingly receiving attention according as digital systems have been more and more complex and speed-up especially for urgent systems or those working on extreme environments such as deep sea and outer space. Simulating the process of cell differentiation algorithm was confirmed by the FPGA on the counter circuit. If an error occurs on the circuit where the error was quickly locate and repair. In this paper, we propose a novel self-repair architecture for fast and robust fault-recovery that can easily apply to real, complex digital systems. These Self-Repairing Algorithms make it possible for the application digital systems to be alive even though in very noisy and extreme environments.

• Journal of the Optical Society of Korea
• /
• 제18권5호
• /
• pp.507-516
• /
• 2014

We present a hybrid method for spectral reflectivity recovery, using 3D extrapolation as a supplemental method for 3D interpolation. The proposed 3D extrapolation is an extended version of 3D interpolation based on the barycentric algorithm. It is faster and more accurate than the conventional spectral-recovery techniques of principal-component analysis and nonnegative matrix transformation. Four different extrapolation techniques (based on nearest neighbors, circumcenters, in-centers, and centroids) are formulated and applied to recover spectral reflectivity. Under the standard conditions of a D65 illuminant and 1964 $10^{\circ}$ observer, all reflectivity data from 1269 Munsell color chips are successfully reconstructed. The superiority of the proposed method is demonstrated using statistical data to compare coefficients of correlation and determination. The proposed hybrid method can be applied for fast and accurate spectral reflectivity recovery in image processing.

• 제어로봇시스템학회논문지
• /
• 제17권9호
• /
• pp.902-907
• /
• 2011

In this paper, we deal with performance evaluation of visual path following using 2D and 3D information. Visual path follow first teaches driving path by selecting milestone images then follows the same route by comparing the milestone image and current image. We follow the visual path following algorithm of [8] and [10]. In [8], a robot navigated with 2D image information only. But in [10], local 3D geometries are reconstructed between the milestone images in order to achieve fast feature prediction which allows the recovery from tracking failures. Experimental results including diverse indoor cases show performance of each algorithm.

• Journal of Power Electronics
• /
• 제16권6호
• /
• pp.2212-2220
• /
• 2016

Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

• ETRI Journal
• /
• 제42권6호
• /
• pp.922-931
• /
• 2020

A hierarchical iterative algorithm for the canonical polyadic decomposition (CPD) of tensors is proposed by improving the traditional conjugate gradient least squares (CGLS) method. Methods based on algebraic operations are investigated with the objective of estimating the direction of arrival (DoA) and polarization parameters of signals impinging on an array with electromagnetic (EM) vector-sensors. The proposed algorithm adopts a hierarchical iterative strategy, which enables the algorithm to obtain a fast recovery for the highly collinear factor matrix. Moreover, considering the same accuracy threshold, the proposed algorithm can achieve faster convergence compared with the alternating least squares (ALS) algorithm wherein the highly collinear factor matrix is absent. The results reveal that the proposed algorithm can achieve better performance under the condition of fewer snapshots, compared with the ALS-based algorithm and the algorithm based on generalized eigenvalue decomposition (GEVD). Furthermore, with regard to an array with a small number of sensors, the observed advantage in estimating the DoA and polarization parameters of the signal is notable.

• 한국전자파학회논문지
• /
• 제14권12호
• /
• pp.1248-1255
• /
• 2003

본 논문에서는 QPSK 방식을 채용하는 고속 무선 전송 시스템에 적용될 수 있는 Zero-Crossing IF-level QPSK 복조기에 대해서, 복조기에 소요되는 알고리즘들을 고찰하고 이를 구현하기 위한 H/W구조에 대해서 언급한다. Zero-Crossing IF-level QPSK 복조기를 구현하기 위해서, 비트 동기를 포착하는 심볼 동기부와 반송파 동기를 포착하는 반송파 동기부가 구현되어야 하는데, 심볼 동기부로는 Gardner 알고리즘을, 반송파 동기부로는 빠른 반송파 포착을 위한 Decision-Directed 동기화 알고리즘을 적용하여 설계, 구현하였다. 설계한 QPSK복조기를 Altera 사의 Design Compiler를 이용하여 CPLD-FLEX10K 칩에 합성해 본 결과 약 2.6 Mbps의 전송속도까지 복조 가능하였다. 설계된 Zero-Crossing IF-level QPSK 복조기를 ASIC으로 구현할 경우 CPLD속도의 5∼6 이상 고속화가 가능하므로 약 10 Mbps급 Zero-Crossing IF-level QPSK 복조가 가능하다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 B
• /
• pp.616-619
• /
• 1997

The spectrum-recovery scheme in Hadamard transform spectroscopy is commonly implemented with a fast Hadamard transform (FHT). When the Hadamard or simplex matrix corresponding to the mask does not have the same ordering as the Hadamard matrix corresponding to the FHT, a modification is required. When the two Hadamard matrices are in the same equivalence class, this modification can be implemented as a permutation scheme. This paper investigates permutation schemes for this application. This paper is to relieve the confusion about the applicability of existing techniques, reveals a new, more efficient method: and leads to an extension that allows a permutation scheme to be applied to any Hadamard or simplex matrix in the appropriate equivalence class.

• 한국통신학회논문지
• /
• 제31권5B호
• /
• pp.397-404
• /
• 2006

최근 광네트워크 기반 IP 서비스가 증가함에 따라 GMPLS 관리 프레임워크는 더욱 중요해지고 있다. 본 논문에서는 이러한 GMPLS 네트워크의 장애 요인들 중 다중 경로 장애 시 사용자의 트래픽 엔지니어링 복구 요구조건을 만족하고 최적의 서비스에 대한 대체 경로를 찾을 수 있는 동적 GMPLS 경로 관리 알고리즘을 제안한다. 구체적으로 GMPLS 네트워크에서 복구 조건을 만족하는 대체 경로의 가용성 조건들을 도출하고 있다. 또한 고속 대체 경로 설정 알고리즘을 제안하여 사용자의 복구 요구조건을 만족하고 서비스의 중지를 최소한으로 막을 수 있게 한다.