• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.04a
• /
• pp.42-45
• /
• 1984

we propose a new parameter estimation algorithm that converge with probability one and in mean square, If the mean is the function of parameter of the probability density function. This recursive algorithm is applicable also ever the parameters we estimate are multiparameter case. And the results are shown by the computer simulation.

• Kyungpook Mathematical Journal
• /
• v.28 no.1
• /
• pp.45-50
• /
• 1988

Circulant and multiblock circulant matrices have many important applications, and therefore their inverses are of considerable interest. A simple recursive algorithm is presented to compute the inverse of a multiblock circulant matrix. The algorithm only uses complex variables, roots of unity and normal matrix/vector operations.

• Bulletin of the Korean Mathematical Society
• /
• v.8 no.1
• /
• pp.9-15
• /
• 1971

The purpose of this note is to use primitive recursive functions and predicates similar to those presented by Davis [2] to show the well-known result first proved by Godel in [3] that the well-formed formulas of a pure functional calculus form a recursive set. The technique shown in this paper immediately suggests a unique approach to Theorem proving using a computer.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.35-49
• /
• 2004

This paper proposes a new glasses removal method from color frontal facial image to generate gray glassless facial image. The proposed method is based on recursive PCA reconstruction. For the generation of glassless images, the occluded region by glasses should be found, and a good reconstructed image to compensate with should be obtained. The recursive PCA reconstruction Provides us with both of them simultaneously, and finally produces glassless facial images. This paper shows the effectiveness of the proposed method by some experimental results. We believe that this method can be applied to removing other type of occlusion than the glasses with some modification and enhancing the performance of a face recognition system.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1342-1350
• /
• 2016

Induction and coinduction are well-established proof principles, which are widely used in mathematics and computer science. In particular, induction is taught in most undergraduate programs and well understood in the field of computer science. In contrast, coinduction is not as widespread or well understood as induction. In this paper, we introduce coinduction by defining a subtype system for recursive and union types and proving the transitivity property of the system. This paper will help to promote familiarity with coinduction and provides a basis for a subtype system for recursive types with other advanced type constructors and connectives.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.1-6
• /
• 2016

The biased zero-error probability and its related algorithms require heavy computational burden related with some summation operations at each iteration time. In this paper, a recursive approach to the biased zero-error probability and related algorithms are proposed, and compared in the simulation environment of shallow water communication channels with ambient noise of biased Gaussian and impulsive noise. The proposed recursive method has significantly reduced computational burden regardless of sample size, contrast to the original MBZEP algorithm with computational complexity proportional to sample size. With this computational efficiency the proposed algorithm, compared with the block-processing method, shows the equivalent robustness to multipath fading, biased Gaussian and impulsive noise.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.3
• /
• pp.37-48
• /
• 1995

This paper presents an sstimation of ARMA coefficients of noisy ARMA system using generalized total least square (GTLS) method. GTLS problem for ARMA system is defined as minimizing the errors between the noisy output vectors and estimated noisy-free output. The GTLS problem is solved in closed form by eigen-problem and the perturbation analysis of GTLS is presented. Also its recursive solution (recursive GTLS) is proposed using the power method and the covariance formula of the projected output error vector into the input vector space. The simulation results show that GTLS ARMA coefficients estimator is an unbiased estimator and that recursive GTLS achieves fast convergence.

• Smart Structures and Systems
• /
• v.11 no.1
• /
• pp.19-34
• /
• 2013

The objective of this paper is to develop on-line system parameter estimation and damage detection technique from the response measurements through using the Recursive Covariance-Driven Stochastic Subspace identification (RSSI-COV) approach. To reduce the effect of noise on the results of identification, discussion on the pre-processing of data using recursive singular spectrum analysis (rSSA) is presented to remove the noise contaminant measurements so as to enhance the stability of data analysis. Through the application of rSSA-SSI-COV to the vibration measurement of bridge during scouring experiment, the ability of the proposed algorithm was proved to be robust to the noise perturbations and offers a very good online tracking capability. The accuracy and robustness offered by rSSA-SSI-COV provides a key to obtain the evidence of imminent bridge settlement and a very stable modal frequency tracking which makes it possible for early warning. The peak values of the identified $1^{st}$ mode shape slope ratio has shown to be a good indicator for damage location, meanwhile, the drastic movements of the peak of $2^{nd}$ mode slope ratio could be used as another feature to indicate imminent pier settlement.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.6
• /
• pp.37-43
• /
• 1999

Two-way addressing method has been proposed for efficient VLSI implementation of Euclidean calculation circuit for pipelined Reed-Solomon decoder. This new circuit is operating with single clock while exploiting maximum parallelism, and uses register addressing instead of register shifting to minimize the switching power. Logic synthesis shows the circuit with the new scheme takes 3,000 logic gates, which is about 40% reduction from the previous 5,000 gate implementation. Computer simulation also shows the power consumption is about 3mW. The previous implementation with multiple clock consumed about 5mW.