- Assuming a 1-step Markov process, prove that for a signal
*x*the probabilities and , can be expressed in terms of the conditional probabilities as_{i} - Assuming a 1-step Markov process, prove that for a signal
*x*the transition probabilities can be expressed in terms of the conditional probabilities as_{i} - Assuming a 1-step Markov process, prove that for a signal
*x*the conditional probabilities can be expressed in terms of the transition probabilities as_{i} - Use the expressions for the transition and conditional probabilities for a 1-bit signal
*x*derived in the previous 3 problems and the fact that its correlation coefficient is given by_{i}to show that the switching activity for that signal can be computed as

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

Start Free Trial

No credit card required