Pipelined Squarer for Unsigned Integers of Up to 12 Bits

Suggested is a pipelined squarer for a positive integer of no more than 16 bits. According to the present invention, the pipelined squarer for a positive integer of no more than 16 bits calculates a partial product matrix by connecting an inputted positive integer of no more than 16 bits with a plurality of integers which do not include symbols; the pipelined squarer comprises a multiplier with a plurality of stages, and the multiplier with a plurality of stages are used to divide the partial product matrix into a plurality of parts to process a square calculation on the positive integer of no more than 16 bits sequentially from the first stage; the parts of the partial product matrix are calculated as an intermediate value comprising a sum and a carry, and partial product matrix results of previous stages are accumulatively calculated from the second stage of the stages of the multiplier; and a sum and a carry vector from a previous stage are added up to calculate a final square value at the last stage of the stages of the multiplier, and a maximum delay time for each of the stages of the multiplier differs depending on the maximum number of bit lines of the partial product matrix to be processed at each of the stages, and a carry-save adder (CSA) tree is limited by analyzing the maximum number of bit lines of the partial product matrix to be accumulated by the CSA tree to provide an optimized squarer.