We consider some canonical forms for pseudo-Boolean functions and give a fast algorithm for the determination of these forms. We also show that the coefficients of all $m^n$ possible different canonical forms may be computed simultaneously by using the fast convolution algorithms.