• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.191-201
• /
• 2005

In this paper, the existence of periodic positive solution and the attractivity are investigated for the rational recursive sequence $x_{n+1} = (A + ax_{n_k})/(b + x{n-l})$, where A, a and b are real numbers, k and l are nonnegative integer numbers.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.1
• /
• pp.19-25
• /
• 2012

The purpose of this paper is to derive powers $A^{n}$ using a system of recursive sequences for a given $2{\times}2$ matrix A. Introducing a recursive sequence we have a quadratic equation. Solutions to this quadratic equation are related with eigenvalues of A. By solving this quadratic equation we can easily obtain an explicit form of $A^{n}$. Our method holds when A is defined not only on the real field but also on the complex field.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.275-282
• /
• 2008

Our aim in this paper is to investigate the global attractivity of the recursive sequence $x_{n+1}$ = $\frac{\alpha-{\beta}x_{n-1}}{\gamma+g(x_n)}$ under specified conditions. We show that the positive (or zero for $\alpha$ = 0) equilibrium point of the equation is a global attractor with a basin that depends on certain conditions posed on the coefficients and the function g(x).

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.441-444
• /
• 1989

This correspondence presents a recursive estimation algorithm which, unlike conventional ones; updates the estimates only when a sufficient improvement can be obtained with a bounded noise assumption, the resulting sequence of estimates is a sequence of convex sets(ellipsoids) in the parameter space. For the cases studied, the algorithm use less than 20 percent of the. data to update, the estimate and still acquired good accuracy for spectral estimation.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.8
• /
• pp.368-373
• /
• 2002

The inverse z-transform of a z-domain expression of a sequence can be Performed in many different methods among which the recursive computational method is based on the difference equation. In applying this method, a few initial values of the sequence should be obtained separately. Although the existing method generates the right initial values of the sequence, its derivation and justification are not theoretically in view of the definition of z-transform and its shift theorems. In this paper a general approach for formulating a difference equation and for obtaining required initial values of a sequence is proposed, which completely complies to the definition of the z-transform and an interpretation of the validity of the existing method which is theoretically incorrect.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.4
• /
• pp.402-406
• /
• 1991

In this paper, we find a set of conditions on weights under which a recursive weighted median filter preserves monotone or localy monotone sequence and under which any input sequence converges to a locally monotone sequence after a finite number of passes.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1476-1483
• /
• 2007

In a multi-sensor target tracking systems, the local sensors have the role of tracking the target and transferring the measurements to the fusion center. The measurements from the same target can arrive out of sequence called, the out-of-sequence measurements(OOSMs). The OOSM can arise in a form of single-lag or multi-lag throughout the transfer at the fusion center. The recursive retrodiction step was proposed to update the current state estimates with the multi-lag OOSM from the several previous papers. The real world has the possible situations that the maneuvering target informations can arrive at the fusion center with the random clutter in the possible OOSMs. In this paper, we incorporate the IMM-MPDA(Interacting Multiple Model - Most Probable Data Association) into the multi-lag OOSM update. The performance of the IMM-MPDA filter with multi-lag OOSM update is analyzed for the various clutter densities, OOSM lag numbers, and target maneuvering indexes. Simulation results show that IMM-MPDA is sufficient to be used in out of sequence environment and it is necessary to correct the current state estimates with OOSM except a very old OOSM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.8
• /
• pp.467-473
• /
• 2014

In the direct sequence spread spectrum system, the correct synchronization is very important; hence, several acquisition schemes based on the sequential estimation have been developed. Typically, the rapid acquisition sequential estimation (RASE) scheme, the seed accumulating sequential estimation (SASE) scheme, the recursive soft sequential estimation (RSSE) scheme have been developed for the correct acquisition. However, the objective performance comparison and analysis between former estimation schemes have not been performed so far. In this paper, we compare and analyze the performance of the above sequential estimation schemes by simulating the correct chip probability and the mean acquisition time (MAT).

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.1-15
• /
• 2017

Kanenobu has given infinite families of knots with the same HOMFLY polynomial invariant but distinct Alexander module structure. In this paper, we give a recursive formula for the Khovanov cohomology of all Kanenobu knots K(p, q), where p and q are integers. The result implies that the rank of the Khovanov cohomology of K(p, q) is an invariant of p + q. Our computation uses only the basic long exact sequence in knot homology and some results on homologically thin knots.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.279-280
• /
• 2008

In order to improve the performance and simplify the structure of the conventional detectors in high density magnetic channels, a new equalizer based on bilinear recursive polynomial (BRP) models, which uses the previously estimated sequence, is proposed. The performance is compared with the conventional equalizers and the maximum likelihood sequence detection (MLSD) bound.