• 제목/요약/키워드: Recursive sequence

검색결과 63건 처리시간 0.029초

PERIODICITY AND ATTRACTIVITY FOR A RATIONAL RECURSIVE SEQUENCE

  • ZHANG LIJIE;ZHANG GUANG;LIU HUI
    • Journal of applied mathematics & informatics
    • /
    • 제19권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.

AN EXPLICIT FORM OF POWERS OF A $2{\times}2$ MATRIX USING A RECURSIVE SEQUENCE

  • Kim, Daniel;Ryoo, Sangwoo;Kim, Taesoo;SunWoo, Hasik
    • 충청수학회지
    • /
    • 제25권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.

GLOBAL ATTRACTIVITY OF THE RECURSIVE SEQUENCE $x_{n+1}$ = $\frac{\alpha-{\beta}x_{n-1}}{\gamma+g(x_n)}$

  • Ahmed, A. M.
    • Journal of applied mathematics & informatics
    • /
    • 제26권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).

  • PDF

SRLS을 이용한 파라미터 추정에 관한 연구 (A study on the parameter estimate using selective recursive least square)

  • 유치형;이재하;정찬수
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
    • /
    • 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.

  • PDF

차분방정식에 의한 역 z변환 계산을 위한 초기 조건의 추출 (Extraction of Initial Conditions For a Recursive Numerical Inverse z-Transform Method)

  • 이재석;정태상
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제51권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.

Multi-lag Out of Sequence Measurement 환경에서의 IMM-MPDA 필터 성능 분석 (The Performance Analysis of IMM-MPDA Filter in Multi-lag Out of Sequence Measurement Environment)

  • 서일환;송택렬
    • 전기학회논문지
    • /
    • 제56권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.

직접 수열 확산 대역 시스템의 고속 부호 획득을 위한 순차 추정 기법들의 성능 분석 (Performance Analysis of Sequential Estimation Schemes for Fast Acquisition of Direct Sequence Spread Spectrum Systems)

  • 이성로;채근홍;윤석호;정민아
    • 한국통신학회논문지
    • /
    • 제39A권8호
    • /
    • pp.467-473
    • /
    • 2014
  • 직접 수열 확산 대역 시스템에서는 (direct sequence spread spectrum: DSSS) 올바른 신호 동기화가 매우 중요하며, 이에 따라 부호 획득을 위한 다양한 순차 추정 기반 기법들이 연구되어 왔다. 대표적으로, rapid acquisition sequential estimation (RASE), seed accumulating SE (SASE), recursive soft SE (RSSE) 등의 기법이 연구되었다. 하지만, 기존의 기법들 간의 객관적인 성능 비교 및 분석은 현재까지 이루어진 바 없다. 본 논문에서는 순차 추정 기반 부호 획득 기법의 대표적 성능 지표인 올바른 칩 추정 확률 및 평균 부호 획득 시간을 (MAT) 이용하여 RASE, SASE, 및 RSSE 기법의 성능을 비교 및 분석한다.

A RECURSIVE FORMULA FOR THE KHOVANOV COHOMOLOGY OF KANENOBU KNOTS

  • Lei, Fengchun;Zhang, Meili
    • 대한수학회보
    • /
    • 제54권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.

2차 재귀 다항식 시스템을 이용한 수직 자기 기록 채널 등화 기법 (Perpendicular Magnetic Recording Channel Equalization Using a Bilinear Recursive Polynomial System)

  • 조현민;공규열;최수용
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • 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.

  • PDF