Application of modular computing technique for high speed implementation of cyclic convolution

This article is a continuation of research on the modular computing structures defined on the set of polynomials over finite rings of integers. Advantages of minimal redundant polynomial-scalar modular number system are demonstrated on the example of computing cyclic convolution of discrete signals. Methods of execution of ring arithmetical operations as well as coding and decoding operations are considered.