The algorithms of triple matrix product (TMP) realization are proposed in vectormatrix notation. This approach enables us to represent adequately the space-time structures of an implemented computational process and directly maps these structures into the hardware and software realization space. Thus, proposed representation offers not only a formalism for describing the algorithm, but it enables the derivation by pure algebraic manipulations of an algorithm that is well suited to be implemented in vector and matrix digital signal processors with various levels of parallelism.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.