We can view y(n)=-\(\sum_{k=1}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k)\) as the computational procedure (an algorithm) for determining the output sequence y(n) of the system from the input sequence x(n).

🎲 Try a Random Question  |  Total Questions in Quiz: 109  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Digital Signal Processing Practice Test: Discrete Time Systems Implementation — practice the complete quiz, review flashcards, or try a random question.

Discrete Time Systems Implementation topics include: Realization structures for discrete time systems, FIR system structures, IIR system structures, number representation, state space system analysis, quantization error analysis and bilinear transformations. Discrete-time systems process discrete-time signals. They can be represented by a set of difference equations or a block diagram of their implementation.  The input and output of a discrete-time system are related by a linear constant coefficient difference equation. This equation defines a sequence of operations to implement the... Show more

We can view y(n)=-\(\sum_{k=1}^N a_k y(n-k)+\sum_{k=0}^N b_k x(n-k)\) as the computational procedure (an algorithm) for determining the output sequence y(n) of the system from the input sequence x(n).