Fast Squaring Technique for Radix Vicinity Numbers for Radix 2n ± M with Reduced Computational Complexity

A fast squaring technique for the operands nearer to a particular radix is reported in this paper. The technique offers significantly less computational complexity which reduces the processing time to a large extent. Considering the applicability of the technique for a particular set of numbers which are in the vicinity of the corresponding radix, it is shown that the technique is equally acceptable for very large radix number. The proposed approach has been verified using Xilinx ISE Vertex-7 FPGA device. Simulated findings showed that with a significant increment in radix value (99.87%), the change of propagation delay is extremely small (2.33%), and corresponding increase in power dissipation is within tolerable range (29.84%). The results show the improvement in speed and computational complexity.