Squarers for binary numbers in serial form

The problem of designing squarers for binary number in serial form (with the condition of the least possible delay between input and output) is treated. Several schemes are Illustrated, derived from fast multipliers for binary numbers in serial form, described in a previous paper. It is shown that some of such multipliers offer a considerable saving in components when they are reduced to squarers. Some schemes are illustrated, both for positive and for two´s-complement numbers.