IFAPT estimates the parameters of piece-wise linear approximation to assumed continuous narrow-band signals. Its simple, recursive nature enables direct interaction with recursive algorithms, such as the Viterbi and t...
详细信息
ISBN:
(纸本)0780344081
IFAPT estimates the parameters of piece-wise linear approximation to assumed continuous narrow-band signals. Its simple, recursive nature enables direct interaction with recursive algorithms, such as the Viterbi and the BCJR in the APP SISO module, used for iteratively decoding concatenated codes. An augmented APP (A(2)P(2))-module, containing IFAPT and BCJR algorithms is here applied to iterative decoding serial concatenated convolutional codes under Rayleigh fading conditions, with diversity reception.
In a recent work the authors derived quaternionic recursions for positions, velocities and acceleration components (inertial, Coriolis and centrifugal) of robot links for robots with only revolute joints (Hachicho, et...
详细信息
In a recent work the authors derived quaternionic recursions for positions, velocities and acceleration components (inertial, Coriolis and centrifugal) of robot links for robots with only revolute joints (Hachicho, et al., 1998). In the present paper recursions for the general case, i.e. for robots with both revolute and prismatic joints, are developed
In this paper, we study the H ∞ control problem for singularly perturbed systems under imperfect state measurements by using the recursive approach. We construct a controller that guarantees a disturbance attenuation...
详细信息
In this paper, we study the H ∞ control problem for singularly perturbed systems under imperfect state measurements by using the recursive approach. We construct a controller that guarantees a disturbance attenuation level larger than a boundary value of the reduced-order slow and fast subsystems when the singular perturbation parameter ε approaches zero. In order to obtain the controller, we must solve the generalized algebraic Riccati equations. The main results in this paper is to propose a new recursive algorithm to solve the generalized algebraic Riccati equations and to find sufficient conditions for the convergence of the proposed algorithm.
This paper provides empirical evidence on the cross-sectional and timeseries variation for the pricing of contracts that swap fixed-for floating-rate interest payments in eight international markets. Swap spreads defi...
详细信息
This paper provides empirical evidence on the cross-sectional and timeseries variation for the pricing of contracts that swap fixed-for floating-rate interest payments in eight international markets. Swap spreads defined as the difference between the fixed swap rate and the yield of a risk-free security of equal maturity are analyzed across markets. A framework, which allows to assess the ability of asymmetric default risk to generate observed spreads, is introduced and used to simulate default risk-adjusted swap rates. For typical yield curve and default conditions asymmetric default risk cannot generate positive swap spreads of the magnitude found in the data. These results are unchanged when incorporating expected or realized LIBOR spreads in the analysis.
In spite of having several advantages, IIR adaptive filters have not been getting their due share in applications because of the need for stability monitoring during adaptation and uncertainty in convergence time for ...
详细信息
In spite of having several advantages, IIR adaptive filters have not been getting their due share in applications because of the need for stability monitoring during adaptation and uncertainty in convergence time for stochastic inputs which can be mainly attributed to the involved nonquadratic criterion function. Because of this type of criterion function, it has been very difficult to estimate the nature of convergence in the stochastic frame work. Recently, it is shown that the ensemble mean parameter updating equations of the IIR adaptive algorithms can be represented by the associated ordinary differential equations (ODEs). In this paper a method of solving the ODEs in order to analyse the mean convergence behaviour of these filters, given the mean description of the input in the form of power spectral density is presented. Further, this procedure is applied to study the convergence behaviour of general IIR adaptive filters. Effectiveness of this method is shown through several analytical and simulation results obtained from two adaptive filtering examples. (C) 1997 Elsevier Science B.V. All rights reserved.
The main contribution of this paper is a recursive algorithm for parametric system identification in the presence of both noise and model uncertainties. The estimates provided by this algorithm are not invalidated, af...
详细信息
The main contribution of this paper is a recursive algorithm for parametric system identification in the presence of both noise and model uncertainties. The estimates provided by this algorithm are not invalidated, after a learning period, by the observed input-output data and the assumed system and uncertainty structures. A complementary off-line algorithm derived from the on-line algorithm is also presented. (C) 1997 Elsevier Science B.V.
作者:
Annexstein, FSDept. of Electr. & Comput. Eng.
Cincinnati Univ. OH USA Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions
This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [5]. We provide code for a function that for eac...
详细信息
This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [5]. We provide code for a function that for each pair of integers n greater than or equal to 2 and 0 less than or equal to x < 2(n-2) returns a unique De Bruijn sequence of order-n. The implementation requires only 0(2(n)) bit operations.
Three parameter motion model can better describe the motion trajectory of picture element in video sequence. Combining the features of block process and recursive estimation, a block recursive algorithm is proposed to...
详细信息
Three parameter motion model can better describe the motion trajectory of picture element in video sequence. Combining the features of block process and recursive estimation, a block recursive algorithm is proposed to calculate these three motion parameters with compensating the variety of block position to get better stability. To get the simplification requirement for hardware implementation, the representation accuracy of displaced frame difference and gradient that are given is analyzed, From these analysis we propose a quantized block recursive algorithm with quantized grandient to reduce the computational complexity. With this simplification the quantized motion estimation algorithm could get sufficient computational speed to meet the requirement of real time application with the least accuracy loss.
This paper addresses the issue of writing image processing algorithms and programs that are independent of the dimension of the dataset. Such an approach aims at writing libraries and tool-boxes that will be smaller (...
详细信息
ISBN:
(纸本)0819424455
This paper addresses the issue of writing image processing algorithms and programs that are independent of the dimension of the dataset. Such an approach aims at writing libraries and tool-boxes that will be smaller (because one routine works on all dimensions) as well as easier to debug (the more the routine is used, the easier it is debugged). The data to be processed is stored in a multi-dimensional, self-documented format describing, not only the content of the image, but also its context and the conditions of its acquisition. The work presented in this paper is based on the image kernel of the MIMOSA standard. We propose a recursive programming scheme that allows one to write general algorithms for such multi-dimensional images. Oddly enough, the design of such algorithms is easy and intuitive, thanks to the recursion. Moreover, the computational cost;remains comparable to the one of dimension-specific algorithms. The cost of the recursion is indeed negligible compared to the cost of non trivial processings. We present an implementation of a reduced version of the MIMOSA image kernel, show how elementary processing such as convolution and filtering can be easily implemented. Finally we propose an algorithm for the no Fast Fourier Transform operating on real data.
Une commande adaptive basée sur une regulateur d'état avec observateur est developée pour positioner une charge mécanique variable avec un moteur linéaire. Afin de recevoir une bande passs...
详细信息
Une commande adaptive basée sur une regulateur d'état avec observateur est developée pour positioner une charge mécanique variable avec un moteur linéaire. Afin de recevoir une bande passsante qui est équilibre aux hautes performances des ces types de moteurs, une fréquence d'échantillonage élevée dans une zone de 10 Khz à 20 Khz est nécessaire. Done une compensation d'une changement de masse en temps reel exige un algorithme très efficace par rapport de la vitesse de calcul. Un tel algorithme est proposé dans ce papier. L'algorithme est en état de calculer la masse et des components parasitaires, comme la friction, avec 5 multiplications et 5 additions dans une boucle d'irération. A full adaptive observer based state space controller is developed for positioning of a mechanical load using linear synchronous motors. To fully exploit the high dynamic response capabilities of such linear motors, it is necessary to operate at relatively high sampling frequencies in the range of 10 Khz to 20 Khz. To compensate the change of the moved mass during system operation, an computational efficiency on-line parameter estimation algorithm is therefore developed here. The algorithm can estimate the load mass and parasitic components such as the friction with only 5 multiplication's and 5 additions per iteration.
暂无评论