Balanced dense polynomial multiplication on multi-cores

To this end, using low weight Dickson polynomials, we formulate the problem of field multiplica- tion as a product of a Toeplitz or Hankel matrix and a vector, and apply

Many chaos-based secure data transmission systems have been proposed, which can be roughly classified at least into the following cat- egories: chaotic masking (Kovarev et al.,

The second approach consists of first imputing the missing values using a standard random imputation method, and then adjusting the imputed val- ues in such a way that the

• The proposed block diagonal matrix based massive MIMO uplink detection scheme and the block Gauss-Seidel method for V2I communications have shown much reduced processing delay

In Section 5 we analyze the complexity of the blockwise product for two polynomials supported by monomials of degree at most d − 1: if A contains Q in its center, then we show

Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu - 35042 Rennes Cedex (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau - Rocquencourt -

(Although it does not change the number of threads for k = 3, those remaining partial products should be considered independently as it allows a finer task scheduling for larger

Provide a direct method to multiply polynomials given in Chebyshev basis which reduces to monomial basis multiplication:. better complexity than using basis conversions,