This work represents an investigation on the use of p-adic transforms to perform convolution of sequences. First, p-adic transforms are described and then are used to study cyclic convolution of short and long sequences. It is shown that to obtain error free results, usual restrictions on the nature of input and output data have to be made. In contrast to former number theoretic transforms, in general, p-adic transforms yield better dynamic ranges. As for long sequences, most relevant aspects, such as technical derivation of various computational techniques, the number of multiplications needed resemble and/or remain at least
in principle as compatible as other number theoretic transforms.
