Invention Grant
- Patent Title: Booth multiplier with enhanced reduction tree circuitry
- Patent Title (中): 具有增强的减少树电路的展位乘数
-
Application No.: US11355397Application Date: 2006-02-15
-
Publication No.: US07809783B2Publication Date: 2010-10-05
- Inventor: Shankar Krithivasan , Christopher Edward Koob
- Applicant: Shankar Krithivasan , Christopher Edward Koob
- Applicant Address: US CA San Diego
- Assignee: QUALCOMM Incorporated
- Current Assignee: QUALCOMM Incorporated
- Current Assignee Address: US CA San Diego
- Agent Peter M. Kamarchik; Nicholas J. Pauley; Sam Talpalatsky
- Main IPC: G06F7/52
- IPC: G06F7/52

Abstract:
Techniques for the design and use of a digital signal processor, including processing transmissions in a communications (e.g., CDMA) system. A modified Booth multiplication system and process determine a multiplicand, A, and a multiplier, B. Radix-m, (e.g., radix-4) Booth recoding on B generates “n” multiplication factors, where “n,” an integer, is approximating one half of the number of the multiplier bits. “n” partial products are generated using the “n” multiplication factors as multipliers of A. Then, a multiplication tree is formed using radix-m Booth encoding. The multiplication tree includes multiplier bits associated to generate a multiplication factors. In the event of a negative multiplication factor, a two's complement of A is formed by inverting the bits of A and associating a sticky “1” to complete the two's complementation. Furthermore, multiplication factors are reduced in multiple stages to a form sum and carry components of a pre-determined length. The additive inverse of A×B is formed by using novel techniques to calculate the product of A and −B.
Public/Granted literature
- US20070192398A1 Booth multiplier with enhanced reduction tree circuitry Public/Granted day:2007-08-16
Information query