This paper discusses the problem of fast computation of convolutions in rings. The adaptability of the well-known Winograd algorithm，FPT algorithm and FFT algorithm which are proposed for computing convolutions in complex fields is studied in the case of rings. Especially，fast algorithms for computing multiplication of matrix polynomial，matrix convolution and polynomial convolution are proposed. They are of wide practical usage.