Results 261 to 270 of about 15,467,312 (299)

Discrete-Time Signals and Systems

2014
Abstract In this chapter we will investigate the fundamental topic of discrete-time signals and systems. We first introduce some basic and useful discrete-time signals, like the unit impulse, the sinusoidal and white Gaussian random sequences. Then we define and represent discrete-time systems.
Leonardo G. Baltar, Josef A. Nossek
openaire   +1 more source

On the performance of a discrete time RAKE

11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications. PIMRC 2000. Proceedings (Cat. No.00TH8525), 2002
A discrete time implementation of the RAKE receiver (DTR) is proposed. The suggested approach works without knowledge of the path delays and their number. It is based on a global estimation of the multipath channel convolutioned with the shaping filter.
Hatem Boujemaa, Octavian Fratu, Mohamed Siala 0001, Philippe Loubaton   +3 more
openaire   +1 more source

Discrete-Time Ordering Policies

IEEE Transactions on Reliability, 1979
Optimum ordering policies are discussed for units with discrete failure-time distributions. The results can include a negative ordering time. Under certain conditions, there exists a finite and unique optimum policy minimizing the s-expected cost rate.
Kaio, Naoto, Osaki, Shunji
openaire   +2 more sources

Linearization of Discrete-Time Systems

SIAM Journal on Control and Optimization, 1996
The paper deals with discrete-time nonlinear systems of the form \(x(k+1) = f(x(k), u(k))\) with \(x(\cdot) \in \mathbb{R}^n\) and \(u(\cdot) \in \mathbb{R}^m\) and \(f\) an analytic map. Using an algebraic formalism based on tools from difference algebra and exterior differential systems, a characterization of accessibility of the system is found ...
Aranda Bricaire, Eduardo, Kotta, Ülle, Moog, Claude   +2 more
openaire   +3 more sources

A discrete-time queueing network

Journal of Applied Probability, 1983
A discrete-time network with multiple transitions is defined. It is characterized by the independence of the service processes at different nodes. That network is shown to have the familiar quasi-reversibility properties.
openaire   +2 more sources

Impulse Control in Discrete Time

gmj, 2008
Abstract We present here impulse control theory in discrete time. We show the connection between quasi-variational inequalities (QVI) in this context, with the standard formulation of dynamic programming. We show that the QVI formulation brings many interesting features, completing the standard formulation of dynamic programming.
openaire   +2 more sources

Discrete-Time Control Barrier Function: High-Order Case and Adaptive Case

IEEE Transactions on Cybernetics, 2023
Di-Hua Zhai, Yuanqing Xia
exaly  

Discrete-Time Systems

2009
M. Sami Fadali, Antonio Visioli
openaire   +1 more source

Novel Discrete-Time Recurrent Neural Network for Robot Manipulator: A Direct Discretization Technical Route

IEEE Transactions on Neural Networks and Learning Systems, 2023
Xiaobing Sun, Shuai Li, Yang Shi
exaly  

Discrete-Time Formulation I

2023
openaire   +1 more source