| 摘要 |
PROBLEM TO BE SOLVED: To provide a multiplication circuit which performs the multiplication of m/2 bits×n/2 bits parallelly for four sets and performs the multiplication of (m) bits×(n) bits as well without increasing the circuit area and operation time. SOLUTION: Multiplication circuits MA1, MB2, MA3 and MA4 respectively execute both the 16 bits×16 bits multiplication with codes and without codes. Selector circuits Sel1, Sel3, Sel5 and Sel7 for selecting the data of multiplicands and selector circuits Sel2, Sel4, Sel6 and Sel8 for selecting the data of multipliers are respectively added to the multiplication circuits MA 1, MA 2, MA 3 and MA 4. A connector circuit Con 1 connects an output out 16-3 from the multiplication circuit MA 3 and an output out 16-4 from the multiplication circuit MA 4 and an adder circuit Add 1 adds this connected value with data, for which an output out 16-1 from the multiplication circuit MA 1 and an output out 16-2 from the multiplication circuit MA 2 are shifted prescribed bits, and outputs the result.
|
