The pipeline form of the serial/parallel multiplier for constant numbers, w
hich operates without insertion of zero words between successive data, is p
resented. The constant number is in Canonical Signed Digit (CSD) form and t
he other factor in two's complement form. The CSD form was chosen because i
t yields significant hardware reduction. Also, for the above data forms the
Lyon's serial pipeline multiplier is examined. For these designs, a specia
l algorithm for the multiplication of two's complement numbers with constan
t numbers in CSD representation was developed. The proposed serial pipeline
multipliers are compared with the existing schemes from the point of hardw
are complexity.