O'Reilly logo

VLSI Digital Signal Processing Systems: Design and Implementation by Keshab K. Parhi

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

17.8    PROBLEMS

  1. Assuming a 1-step Markov process, prove that for a signal xi the probabilities image and image, can be expressed in terms of the conditional probabilities as

    image

  2. Assuming a 1-step Markov process, prove that for a signal xi the transition probabilities can be expressed in terms of the conditional probabilities as

    image

  3. Assuming a 1-step Markov process, prove that for a signal xi the conditional probabilities can be expressed in terms of the transition probabilities as

    image

  4. Use the expressions for the transition and conditional probabilities for a 1-bit signal xi derived in the previous 3 problems and the fact that its correlation coefficient is given by

    image

    to show that the switching activity for that signal can be computed as

    image

  5. Consider a simple AND gate with 2 inputs x and y. Assume that the gate ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required