For pt. I, see ibid., vol. 41, no. 10, p. 641-55 (1994). In Part Inof the research work, we introduced an extension to the well knownnChinese remainder theorem for processing polynomials with coefficientsndefined over a finite integer ring. We term this extension as thenAmerican-Indian-Chinese extension of the Chinese remainder theorem. Ansystematic procedure for factorizing a monic polynomial into pairwisenrelatively prime monic factor polynomials over integer rings wasnpresented. This factorization is based on the corresponding factornpolynomials, monic and relatively prime, over the associated finitenfield containing prime number of elements. In this paper, we study thenapplication of the theory developed in Part I to derivingncomputationally efficient algorithms for performing tasks havingnmultilinear form. Especially, we focus on the cyclic and acyclicnconvolution as they are two of the most frequently occurringncomputationally intensive tasks in digital signal processing
展开▼
