DOCSLIB.ORG

The Digital All-Pass Filter: a Versatile Signal Processing Building Block

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Digital All-Pass Filter: a Versatile Signal Processing Building Block The Digital All-Pass Filter: A Versatile Signal Processing Building Block PHILLIP A. REGALIA, STUDENT MEMBER, IEEE, SANJIT K. MITRA, FELLOW, IEEE, AND P. P. VAIDYANATHAN, MEMBER, IEEE The digital all-pass filter is a computationally efficient signal pro- tionally efficient filter structures, tunable filters, filter bank cessing building block which is quite useful in many signal pm- analysis/synthesis systems, multirate filtering, and stability cessing applications. In this tutorial paper we review the properties of digital all-pass filters, and provide a broad overview of the diver- under linear and nonlinear (i.e., quantized) environments. sity of applications in digital filtering. Starting with the definition This paper considersa basic scalar lossless building block, and basic properties of a scalar all-pass function, a variety of struc- which is a stable all-pass function. The interconnections of tures satisfying the all-pass property are assembled, with emphasis such lossless building blocksform useful solutions to many placed on the concept of structural losslessness. Applications are practical filtering problems. The many results presented then outlined in notch filtering, complementary filtering and filter banks, multirate filtering, spectrum and group-delay equalization, here can be derived by appealing to elegant theoretical Hilbert transformations, and so on. In all cases, the structural loss- forms; however, in maintaining a tutorial tone it is our aim lessness property induces very robust performance in the face of to expose the salient features using direct discrete-time multiplier coefficient quantization. Finally, the state-space mani- concepts, in the hope that the references cited will further festations of the all-pass property are explored, and it is shown that many all-pass filter structures are devoid of limit cycle behavior aid both thedesigner and researcher alike. Weshould point and feature very low roundoff noise gain. out that many of the results which are developed in terms of scalar all-pass functions in one dimension can be gen- I. INTRODUCTION eralized tovector or matrixall-pass functions [3]and to mul- tidimensional filtering [4],though for the presentwe restrict In many signal processingapplications, thedesigner must our attention to the one-dimensional scalar case. determine the transfer function of a digital filter subject to We begin in Section II by defining a scalar all-pass func- constraints on the frequency selectivity andlor phase tion and reviewing some basic properties. Section Ill response which are dictated by the application at hand. assembles avariety of all-pass filter structures, with empha- Once a suitable transfer function is found, the designer sis placed on the concept of structurallosslessness. Section must select a filter structure from the numerous choices IV outlines applications to notch filtering, Section V to com- available. Ultimately, finite precision arithmetic is used in plementary filters and filter banks, Section VI to multirate any digital filter computation, and traditionally the round- signal processing, SectionVII to tunablefilters, and Section off noise and coefficient sensitivity characteristics have Vlll togroupdelay equalization. Finally, Section IX explores formed the basis of selecting one filter structure in favor state-space representations of lossless transfer functions, of another. and the implications of losslessness in obtainingvery robust In the quest for low coefficient sensitivityand low round- performance under finite word-length constraints. off noise, an elegant theory of losslessness and passivity in the discrete-time domain has evolved [I], (21. Although this II. DEFINITIONSAND PROPERTIES theory has been motivated by the desire to obtain digital filters with predictable behavior under finite word-length The frequency responseA(ei'")of an all-pass filter exhibits conditions, many useful by-products have emerged which unit magnitude at all frequencies, i.e., have contributed to a better understanding of computa- JA(e'")(* = 1, for all U. (2.1) Manuscript received July IO, 1987; revised October 16,1987.This The transfer function of such a filter has all poles and zeros work was supported by the National Science Foundation under occurring in conjugate reciprocal pairs, and takes the form Grants MIP 85-08017and MIP 8404245. P. A. Regalia and S. K. Mitra are with the Department of Electrical and Computer Engineering, University of California, Santa Bar- (2.2) bara, CA 93106, USA. P. P. Vaidyanathan is with the Department of Electrical Engi- For stability reasons we assume (Ykl 1 for all k to place neering, California Institute of Technology, Pasadena, CA 91125, < USA. all the poles insidethe unit circle. Now, ifA(z) isconstrained IEEE Log Number 8718413. to be a real function, we must have 0 = 0 or 0 = T,and any 00189219/88/0100-0019601.000 1988 IEEE PROCEEDINGS OF THE IEEE, VOL. 76, NO. 1, JANUARY 1988 19 complex pole at z = Yk must be accompanied by a complex This relation is useful in verifying stability in lattice real- conjugate pole atz = 7:. In this caseA(z) can be expressed izations of all-pass filters. in the form The last property of interest is the change in phase for real all-pass filter over the frequency range w E [0, TI.We (2.3) start with the group delay function T(W) of an all-pass filter, which is usually defined as In effect, the numerator polynomial is obtained from the d denominator polynomial by reversingthe order of the coef- 7(w) = - - [arg A(e/")]. (2.10) ficients. For example, dw a2 + alz-l + z-~ Note that the phase function must be taken as continuous A(z) = I + alz-' + a22-2 or "unwrapped" [5] if 7(w) is to be well-behaved. Since an all-pass function is devoid of zeros on the unit circle accord- isasecond-order all-pass functionoftheform of(2.3)above, ing to (2.1), the phase function arg A(ei") can always be since the numerator coefficients appear in the reverse order unwrapped with no ambiguities. Now, the phase response ofthose in thedenominator. In thiscase,thenumeratorand of a stable all-pass function is a monotonically decreasing denominator polynomials are said to form a mirror-image function of w, so that T(W) is everywhere positive. An Mth- pair. order real all-pass function, in fact, satisfies the property If we lift the restriction that A(z) be a real function, then A(z) takes the more general form lou7(w) dw = Mr. (2.11) z -M D*(l/z*) A(z) = (2.5) D(z) The interpretation of (2.11) is that the change in phase of The numerator and denominator polynomials now form a the all-phase function as w goes from 0 to r is -MT radians. Hermitian mirror-image pair. For example, 111. ALL-PASSFILTER STRUCTURES The (Hermitian) mirror-image symmetry relation between the numerator and denominator polynomials of an all-pass transfer function can be exploited to obtain a computa- tionally efficient filter realization with a minimum number of multipliers. To see this, consider the second-order all- with0 = arg(a;/ao), isrecognizedasacomplexall-passfunc- pass function of (2.4) which, upon expressing A(z) = tion due to the Hermitian mirror-image relation between Y(z)/U(z), corresponds to the second-orderdifference equa- the numerator and denominator polynomials. tion Properties y(n) = -32[u(n) - y(n - 2)1 From the definition of an all-pass function in (2.1), setting + al[u(n- 1) - y(n - I)] + u(n - 2) (3.1) A(z) = Y(z)/U(z) reveals in which terms have been grouped in such a way that only 1 y(eju)12 = I u(eju)12, for all w. (2.7) two multiplications are required. A similar strategy can be Upon integrating both sides from w = --a to rand applying applied to an arbitrary Mth-order all-pass filter, such that Parseval's relation [I], we obtain only M multiplications are required to compute each out- put sample. On the other hand, a direct-form filter real- m m ization would in general require 2M + 1 multiplications to c I y(n)12 = ldn)l2. (2.8) " = -m computeeach output sample. In this sense,an all-pass filter represents a computationally efficient structure. It is convenient to interpret the two sides of (2.8) as the out- Thedifferenceequation as expressed in (3.1) requiresfour put energy and input energy of the digital filter, respec- delay (or storage) elements to be realized as a filter struc- tively [I], [5]. Thus an all-pass filter is lossless, since the out- ture. Since the difference equation is of second order, this put energy equals the input energy for all finite energy does not represent a canonic realization. However, mini- inputs. If the all-pass filter is stable as well, it is termed Loss- mum multiplier delay-canonic all-pass filter structures can less Bounded Real (LBR) [2], or more generally Lossless be developed using the multiplier extraction approach [q, Bounded Complex [6] if the coefficients are not all real. [8]. For example, consider the digital two-pair network of Another useful property follows from (2.1) with the aid Fig. 1, which has a constraining multiplier b, at the second of the maximum modulus theorem. In particular, since a "port": U2(z)= bl Y2(z).The transfer function as seen from hasall its poles insidethe unitcircle, stableall-pass function the remaining port is constrained to be a first-order all-pass all its zeros outside, and exhibits unit magnitude along the unit circle, one can deduce <I, for Iz( > 1 (2.9) Fig. 1. Digital two-pair network constrained with a multi. >I, for IzI < 1. plier of value b,. 20 PROCEEDINGS OF THE IEEE, VOL. 76, NO. 1, JANUARY 1988 function (3.2) This allows one to solve for the internal parameters of the digital two-pair.
Load more

Recommended publications
  • Lecture 3: Transfer Function and Dynamic Response Analysis
    Transfer function approach Dynamic response Summary Basics of Automation and Control I Lecture 3: Transfer function and dynamic response analysis Paweł Malczyk Division of Theory of Machines and Robots Institute of Aeronautics and Applied Mechanics Faculty of Power and Aeronautical Engineering Warsaw University of Technology October 17, 2019 © Paweł Malczyk. Basics of Automation and Control I Lecture 3: Transfer function and dynamic response analysis 1 / 31 Transfer function approach Dynamic response Summary Outline 1 Transfer function approach 2 Dynamic response 3 Summary © Paweł Malczyk. Basics of Automation and Control I Lecture 3: Transfer function and dynamic response analysis 2 / 31 Transfer function approach Dynamic response Summary Transfer function approach 1 Transfer function approach SISO system Definition Poles and zeros Transfer function for multivariable system Properties 2 Dynamic response 3 Summary © Paweł Malczyk. Basics of Automation and Control I Lecture 3: Transfer function and dynamic response analysis 3 / 31 Transfer function approach Dynamic response Summary SISO system Fig. 1: Block diagram of a single input single output (SISO) system Consider the continuous, linear time-invariant (LTI) system defined by linear constant coefficient ordinary differential equation (LCCODE): dny dn−1y + − + ··· + _ + = an n an 1 n−1 a1y a0y dt dt (1) dmu dm−1u = b + b − + ··· + b u_ + b u m dtm m 1 dtm−1 1 0 initial conditions y(0), y_(0),..., y(n−1)(0), and u(0),..., u(m−1)(0) given, u(t) – input signal, y(t) – output signal, ai – real constants for i = 1, ··· , n, and bj – real constants for j = 1, ··· , m. How do I find the LCCODE (1)? .
    [Show full text]
  • Control Theory
    Control theory S. Simrock DESY, Hamburg, Germany Abstract In engineering and mathematics, control theory deals with the behaviour of dynamical systems. The desired output of a system is called the reference. When one or more output variables of a system need to follow a certain ref- erence over time, a controller manipulates the inputs to a system to obtain the desired effect on the output of the system. Rapid advances in digital system technology have radically altered the control design options. It has become routinely practicable to design very complicated digital controllers and to carry out the extensive calculations required for their design. These advances in im- plementation and design capability can be obtained at low cost because of the widespread availability of inexpensive and powerful digital processing plat- forms and high-speed analog IO devices. 1 Introduction The emphasis of this tutorial on control theory is on the design of digital controls to achieve good dy- namic response and small errors while using signals that are sampled in time and quantized in amplitude. Both transform (classical control) and state-space (modern control) methods are described and applied to illustrative examples. The transform methods emphasized are the root-locus method of Evans and fre- quency response. The state-space methods developed are the technique of pole assignment augmented by an estimator (observer) and optimal quadratic-loss control. The optimal control problems use the steady-state constant gain solution. Other topics covered are system identification and non-linear control. System identification is a general term to describe mathematical tools and algorithms that build dynamical models from measured data.
    [Show full text]
  • Step Response of Series RLC Circuit ‐ Output Taken Across Capacitor
    ESE 271 / Spring 2013 / Lecture 23 Step response of series RLC circuit ‐ output taken across capacitor. What happens during transient period from initial steady state to final steady state? 1 ESE 271 / Spring 2013 / Lecture 23 Transfer function of series RLC ‐ output taken across capacitor. Poles: Case 1: ‐‐two differen t real poles Case 2: ‐ two identical real poles ‐ complex conjugate poles Case 3: 2 ESE 271 / Spring 2013 / Lecture 23 Case 1: two different real poles. Step response of series RLC ‐ output taken across capacitor. Overdamped case –the circuit demonstrates relatively slow transient response. 3 ESE 271 / Spring 2013 / Lecture 23 Case 1: two different real poles. Freqqyuency response of series RLC ‐ output taken across capacitor. Uncorrected Bode Gain Plot Overdamped case –the circuit demonstrates relatively limited bandwidth 4 ESE 271 / Spring 2013 / Lecture 23 Case 2: two identical real poles. Step response of series RLC ‐ output taken across capacitor. Critically damped case –the circuit demonstrates the shortest possible rise time without overshoot. 5 ESE 271 / Spring 2013 / Lecture 23 Case 2: two identical real poles. Freqqyuency response of series RLC ‐ output taken across capacitor. Critically damped case –the circuit demonstrates the widest bandwidth without apparent resonance. Uncorrected Bode Gain Plot 6 ESE 271 / Spring 2013 / Lecture 23 Case 3: two complex poles. Step response of series RLC ‐ output taken across capacitor. Underdamped case – the circuit oscillates. 7 ESE 271 / Spring 2013 / Lecture 23 Case 3: two complex poles. Freqqyuency response of series RLC ‐ output taken across capacitor. Corrected Bode GiGain Plot Underdamped case –the circuit can demonstrate apparent resonant behavior.
    [Show full text]
  • Frequency Response and Bode Plots
    1 Frequency Response and Bode Plots 1.1 Preliminaries The steady-state sinusoidal frequency-response of a circuit is described by the phasor transfer function Hj( ) . A Bode plot is a graph of the magnitude (in dB) or phase of the transfer function versus frequency. Of course we can easily program the transfer function into a computer to make such plots, and for very complicated transfer functions this may be our only recourse. But in many cases the key features of the plot can be quickly sketched by hand using some simple rules that identify the impact of the poles and zeroes in shaping the frequency response. The advantage of this approach is the insight it provides on how the circuit elements influence the frequency response. This is especially important in the design of frequency-selective circuits. We will first consider how to generate Bode plots for simple poles, and then discuss how to handle the general second-order response. Before doing this, however, it may be helpful to review some properties of transfer functions, the decibel scale, and properties of the log function. Poles, Zeroes, and Stability The s-domain transfer function is always a rational polynomial function of the form Ns() smm as12 a s m asa Hs() K K mm12 10 (1.1) nn12 n Ds() s bsnn12 b s bsb 10 As we have seen already, the polynomials in the numerator and denominator are factored to find the poles and zeroes; these are the values of s that make the numerator or denominator zero. If we write the zeroes as zz123,, zetc., and similarly write the poles as pp123,, p , then Hs( ) can be written in factored form as ()()()s zsz sz Hs() K 12 m (1.2) ()()()s psp12 sp n 1 © Bob York 2009 2 Frequency Response and Bode Plots The pole and zero locations can be real or complex.
    [Show full text]
  • Linear Time Invariant Systems
    UNIT III LINEAR TIME INVARIANT CONTINUOUS TIME SYSTEMS CT systems – Linear Time invariant Systems – Basic properties of continuous time systems – Linearity, Causality, Time invariance, Stability – Frequency response of LTI systems – Analysis and characterization of LTI systems using Laplace transform – Computation of impulse response and transfer function using Laplace transform – Differential equation – Impulse response – Convolution integral and Frequency response. System A system may be defined as a set of elements or functional blocks which are connected together and produces an output in response to an input signal. The response or output of the system depends upon transfer function of the system. Mathematically, the functional relationship between input and output may be written as y(t)=f[x(t)] Types of system Like signals, systems may also be of two types as under: 1. Continuous-time system 2. Discrete time system Continuous time System Continuous time system may be defined as those systems in which the associated signals are also continuous. This means that input and output of continuous – time system are both continuous time signals. For example: Audio, video amplifiers, power supplies etc., are continuous time systems. Discrete time systems Discrete time system may be defined as a system in which the associated signals are also discrete time signals. This means that in a discrete time system, the input and output are both discrete time signals. For example, microprocessors, semiconductor memories, shift registers etc., are discrete time signals. LTI system:- Systems are broadly classified as continuous time systems and discrete time systems. Continuous time systems deal with continuous time signals and discrete time systems deal with discrete time system.
    [Show full text]
  • Simplified, Physically-Informed Models of Distortion and Overdrive Guitar Effects Pedals
    Proc. of the 10th Int. Conference on Digital Audio Effects (DAFx-07), Bordeaux, France, September 10-15, 2007 SIMPLIFIED, PHYSICALLY-INFORMED MODELS OF DISTORTION AND OVERDRIVE GUITAR EFFECTS PEDALS David T. Yeh, Jonathan S. Abel and Julius O. Smith Center for Computer Research in Music and Acoustics (CCRMA) Stanford University, Stanford, CA [dtyeh|abel|jos]@ccrma.stanford.edu ABSTRACT retained, however, because intermodulation due to mixing of sub- sonic components with audio frequency components is noticeable This paper explores a computationally efficient, physically in- in the audio band. formed approach to design algorithms for emulating guitar distor- tion circuits. Two iconic effects pedals are studied: the “Distor- Stages are partitioned at points in the circuit where an active tion” pedal and the “Tube Screamer” or “Overdrive” pedal. The element with low source impedance drives a high impedance load. primary distortion mechanism in both pedals is a diode clipper This approximation is also made with less accuracy where passive with an embedded low-pass filter, and is shown to follow a non- components feed into loads with higher impedance. Neglecting linear ordinary differential equation whose solution is computa- the interaction between the stages introduces magnitude error by a tionally expensive for real-time use. In the proposed method, a scalar factor and neglects higher order terms in the transfer func- simplified model, comprising the cascade of a conditioning filter, tion that are usually small in the audio band. memoryless nonlinearity and equalization filter, is chosen for its The nonlinearity may be evaluated as a nonlinear ordinary dif- computationally efficient, numerically robust properties.
    [Show full text]
  • Control System Design Methods
    Christiansen-Sec.19.qxd 06:08:2004 6:43 PM Page 19.1 The Electronics Engineers' Handbook, 5th Edition McGraw-Hill, Section 19, pp. 19.1-19.30, 2005. SECTION 19 CONTROL SYSTEMS Control is used to modify the behavior of a system so it behaves in a specific desirable way over time. For example, we may want the speed of a car on the highway to remain as close as possible to 60 miles per hour in spite of possible hills or adverse wind; or we may want an aircraft to follow a desired altitude, heading, and velocity profile independent of wind gusts; or we may want the temperature and pressure in a reactor vessel in a chemical process plant to be maintained at desired levels. All these are being accomplished today by control methods and the above are examples of what automatic control systems are designed to do, without human intervention. Control is used whenever quantities such as speed, altitude, temperature, or voltage must be made to behave in some desirable way over time. This section provides an introduction to control system design methods. P.A., Z.G. In This Section: CHAPTER 19.1 CONTROL SYSTEM DESIGN 19.3 INTRODUCTION 19.3 Proportional-Integral-Derivative Control 19.3 The Role of Control Theory 19.4 MATHEMATICAL DESCRIPTIONS 19.4 Linear Differential Equations 19.4 State Variable Descriptions 19.5 Transfer Functions 19.7 Frequency Response 19.9 ANALYSIS OF DYNAMICAL BEHAVIOR 19.10 System Response, Modes and Stability 19.10 Response of First and Second Order Systems 19.11 Transient Response Performance Specifications for a Second Order
    [Show full text]
  • Mathematical Modeling of Control Systems
    OGATA-CH02-013-062hr 7/14/09 1:51 PM Page 13 2 Mathematical Modeling of Control Systems 2–1 INTRODUCTION In studying control systems the reader must be able to model dynamic systems in math- ematical terms and analyze their dynamic characteristics.A mathematical model of a dy- namic system is defined as a set of equations that represents the dynamics of the system accurately, or at least fairly well. Note that a mathematical model is not unique to a given system.A system may be represented in many different ways and, therefore, may have many mathematical models, depending on one’s perspective. The dynamics of many systems, whether they are mechanical, electrical, thermal, economic, biological, and so on, may be described in terms of differential equations. Such differential equations may be obtained by using physical laws governing a partic- ular system—for example, Newton’s laws for mechanical systems and Kirchhoff’s laws for electrical systems. We must always keep in mind that deriving reasonable mathe- matical models is the most important part of the entire analysis of control systems. Throughout this book we assume that the principle of causality applies to the systems considered.This means that the current output of the system (the output at time t=0) depends on the past input (the input for t<0) but does not depend on the future input (the input for t>0). Mathematical Models. Mathematical models may assume many different forms. Depending on the particular system and the particular circumstances, one mathemati- cal model may be better suited than other models.
    [Show full text]
  • 12: Resonance
    12: Resonance • QuadraticFactors + • Damping Factor and Q • Parallel RLC • Behaviour at Resonance • Away from resonance • Bandwidth and Q • Power and Energy at Resonance + • Low Pass Filter • Resonance Peak for LP filter • Summary 12: Resonance E1.1 Analysis of Circuits (2017-10213) Resonance: 12 – 1 / 11 Quadratic Factors + 12: Resonance 2 • QuadraticFactors + A quadratic factor in a transfer function is: F (jω) = a (jω) + b (jω) + c. • Damping Factor and Q • Parallel RLC • Behaviour at Resonance • Away from resonance • Bandwidth and Q • Power and Energy at Resonance + • Low Pass Filter • Resonance Peak for LP filter • Summary E1.1 Analysis of Circuits (2017-10213) Resonance: 12 – 2 / 11 Quadratic Factors + 12: Resonance 2 • QuadraticFactors + A quadratic factor in a transfer function is: F (jω) = a (jω) + b (jω) + c. • Damping Factor and Q • Parallel RLC 2 • Behaviour at Resonance Case 1: If b 4ac then we can factorize it: • Away from resonance ≥ • Bandwidth and Q F (jω) = a(jω p1)(jω p2) • Power and Energy at − − Resonance + • Low Pass Filter • Resonance Peak for LP filter • Summary E1.1 Analysis of Circuits (2017-10213) Resonance: 12 – 2 / 11 Quadratic Factors + 12: Resonance 2 • QuadraticFactors + A quadratic factor in a transfer function is: F (jω) = a (jω) + b (jω) + c. • Damping Factor and Q • Parallel RLC 2 • Behaviour at Resonance Case 1: If b 4ac then we can factorize it: • Away from resonance ≥ • Bandwidth and Q F (jω) = a(jω p1)(jω p2) • Power and Energy at − − Resonance + b √b2 4ac • Low Pass Filter where p = − ± − . • Resonance Peak for LP i 2a filter • Summary E1.1 Analysis of Circuits (2017-10213) Resonance: 12 – 2 / 11 Quadratic Factors ++ 12: Resonance 2 • QuadraticFactors + A quadratic factor in a transfer function is: F (jω) = a (jω) + b (jω) + c.
    [Show full text]
  • Discussion 3B
    EECS 16B Designing Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 3B 1 Transfer Functions When we analyzed circuits in the phasor domain, we always told you what the input voltage, or the input sinusoid to the circuit was. However, sometimes we have many input sinusoids, and we want to look at how a circuit (or system) generically responds to a sinusoid input of frequency w. We want to see how an input sinusoid “transfers” into an output sinusoid. How do we do this? Let’s start with a simple RC circuit. R i(t) + + vin C vout − − Figure 1: First Order RC Low Pass Filter 1 In the phasor domain, the impedance of the capacitor is ZC = jwC and the impedance of the resistor is ZR = R. Because we treat impedances the same as resistances, this circuit looks like a voltage divider in the phasor domain. Remember we must also represent vin as a phasor V˜in; transfer functions are in the phasor domain only, not the time domain. 1 Z 1 V˜ = C V˜ = jwC V˜ = V˜ out Z + Z in 1 in jwRC + 1 in R C R + jwC We define the frequency response as V˜ 1 H(w) = out = V˜in jwRC + 1 Now, given an arbitrary input sinusoid, if we multiply it by the frequency response, we can get the output sinusoid. What this allows us to do is to model any arbitrary circuit as a 4-port (two input, two output) black box. The transfer function completely defines how our circuit works.
    [Show full text]
  • Resonance of Fractional Transfer Functions of the Second Kind Rachid Malti, Xavier Moreau, Firas Khemane
    Resonance of fractional transfer functions of the second kind Rachid Malti, Xavier Moreau, Firas Khemane To cite this version: Rachid Malti, Xavier Moreau, Firas Khemane. Resonance of fractional transfer functions of the second kind. The 3th IFAC Workshop on Fractional Differentiation and its Applications, FDA08, Nov 2008, Ankara, Turkey. pp.1-6. hal-00326418 HAL Id: hal-00326418 https://hal.archives-ouvertes.fr/hal-00326418 Submitted on 26 Jan 2009 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Resonance of fractional transfer functions of the second kind Rachid MALTI, Xavier MOREAU, and Firas KHEMANE ∗ Bordeaux University – IMS, 351, cours de la Lib´eration, 33405 Talence Cedex, France. firstname.lastname @ims-bordeaux.fr { } Abstract: Canonical fractional transfer function of the second kind is studied in this paper. Stability and resonance conditions are determined in terms of pseudo-damping factor and commensurable order. Keywords: Resonance, fractional system, second order transfer function, canonical form. 1. INTRODUCTION F (s) + + 1 1 Σ K1 ν Σ K2 Commensurable fractional systems can be represented in s sν a transfer function form as: mB − − b sνj ν j T (s ) j=0 H (s)= = , (1) ν PmA R(s ) νi 1+ ais Fig.
    [Show full text]
  • The Z-Transform
    CHAPTER 33 The z-Transform Just as analog filters are designed using the Laplace transform, recursive digital filters are developed with a parallel technique called the z-transform. The overall strategy of these two transforms is the same: probe the impulse response with sinusoids and exponentials to find the system's poles and zeros. The Laplace transform deals with differential equations, the s-domain, and the s-plane. Correspondingly, the z-transform deals with difference equations, the z-domain, and the z-plane. However, the two techniques are not a mirror image of each other; the s-plane is arranged in a rectangular coordinate system, while the z-plane uses a polar format. Recursive digital filters are often designed by starting with one of the classic analog filters, such as the Butterworth, Chebyshev, or elliptic. A series of mathematical conversions are then used to obtain the desired digital filter. The z-transform provides the framework for this mathematics. The Chebyshev filter design program presented in Chapter 20 uses this approach, and is discussed in detail in this chapter. The Nature of the z-Domain To reinforce that the Laplace and z-transforms are parallel techniques, we will start with the Laplace transform and show how it can be changed into the z- transform. From the last chapter, the Laplace transform is defined by the relationship between the time domain and s-domain signals: 4 X(s) ' x(t) e &st dt m t '&4 where x(t) and X(s) are the time domain and s-domain representation of the signal, respectively.
    [Show full text]