2,364 research outputs found

    Computational Complexity of Iterated Maps on the Interval (Extended Abstract)

    Full text link
    The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented. The correctness of the algorithm is shown and the computational complexity is analyzed. As a main result, the computational complexity measure considered here is related to the Ljapunow exponent of the dynamical system under consideration

    A new approach to the realization of low-sensitivity IIR digital filters

    Get PDF
    A new implementation of an IIR digital filter transfer function is presented that is structurally passive and, hence, has extremely low pass-band sensitivity. The structure is based on a simple parallel interconnection of two all-pass sections, with each section implemented in a structurally lossless manner. The structure shares a number of properties in common with wave lattice digital filters. Computer simulation results verifying the low-sensitivity feature are included, along with results on roundoff noise/dynamic range interaction. A large number of alternatives is available for the implementation of the all-pass sections, giving rise to the well-known wave lattice digital filters as a specific instance of the implementation

    Circulant and skew-circulant matrices as new normal-form realization of IIR digital filters

    Get PDF
    Normal-form fixed-point state-space realization of IIR (infinite-impulse response) filters are known to be free from both overflow oscillations and roundoff limit cycles, provided magnitude truncation arithmetic is used together with two's-complement overflow features. Two normal-form realizations are derived that utilize circulant and skew-circulant matrices as their state transition matrices. The advantage of these realizations is that the A-matrix has only N (rather than N2) distinct elements and is amenable to efficient memory-oriented implementation. The problem of scaling the internal signals in these structures is addressed, and it is shown that an approximate solution can be obtained through a numerical optimization method. Several numerical examples are included
    corecore