The document describes a new recursive barrel shifter algorithm for multiplication and its FPGA implementation. It analyzes existing multiplication algorithms like Booth, Wallace tree, Karatsuba and their limitations. The proposed algorithm uses a barrel shifter recursively by counting the number of ones in each number, shifting the multiplicand by powers of two, and adding the results. This is implemented on a Xilinx FPGA for performance analysis in terms of speed, power and area.