1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

; Case 0: Initialization (全0)
0.0   00000000000000000000000000000000 00000000000000000000000000000000

; Case 1: 2 * 3 = 6
; A=...0010 (2), B=...0011 (3)
5.0   00000000000000000000000000000010 00000000000000000000000000000011

; Case 2: -1 * 1 = -1
; A=FFFFFFFF (全1), B=1
10.0  11111111111111111111111111111111 00000000000000000000000000000001

; Case 3: Checkerboard Test (A=1010..., B=0101...)
15.0  10101010101010101010101010101010 01010101010101010101010101010101

; End
20.0  00000000000000000000000000000000 00000000000000000000000000000000

; Case 4: Max Positive * Max Positive
; 0x7FFFFFFF * 0x7FFFFFFF
; 验证正数最大积
25.0  01111111111111111111111111111111 01111111111111111111111111111111

; Case 5: Reset to 0 
35  00000000000000000000000000000000 00000000000000000000000000000000

; Case 6: Max Negative * Max Negative (CRITICAL CASE)
; 0x80000000 (-2^31) * 0x80000000 (-2^31)
; 这是有符号乘法器的噩梦，符号位扩展会导致压缩树负载极高
45  10000000000000000000000000000000 10000000000000000000000000000000

; Case 7: Reset to 0
55  00000000000000000000000000000000 00000000000000000000000000000000

; Case 8: All 1s (-1) * Max Positive
; 0xFFFFFFFF * 0x7FFFFFFF
; 测试反相和进位链
65  11111111111111111111111111111111 01111111111111111111111111111111

; Case 9: Random Patterns that trigger worst carry (Heuristic)
; 两个很大的质数或者非规则大数，避免 booth 编码的优化
; A = 0xAAAA5555, B = 0x5555AAAA
75  10101010101010100101010101010101 01010101010101011010101010101010

; End Simulation
80  00000000000000000000000000000000 00000000000000000000000000000000

1
2
3

; Case 2: -1 * 1 = -1
; A=FFFFFFFF (全1), B=1
10.0  11111111111111111111111111111111 00000000000000000000000000000001

1
2

; Case 3: Checkerboard Test (A=1010..., B=0101...)
15.0  10101010101010101010101010101010 01010101010101010101010101010101

1
2
3
4

; Case 4: Max Positive * Max Positive
; 0x7FFFFFFF * 0x7FFFFFFF
; 验证正数最大积
25.0  01111111111111111111111111111111 01111111111111111111111111111111

1
2
3
4

; Case 8: All 1s (-1) * Max Positive
; 0xFFFFFFFF * 0x7FFFFFFF
; 测试反相和进位链
65  11111111111111111111111111111111 01111111111111111111111111111111

1
2
3
4

; Case 9: Random Patterns that trigger worst carry (Heuristic)
; 两个很大的质数或者非规则大数，避免 booth 编码的优化
; A = 0xAAAA5555, B = 0x5555AAAA
75  10101010101010100101010101010101 01010101010101011010101010101010