Boots – shoes – and leggings
Patent
1992-12-14
1994-09-13
Mai, Tan V.
Boots, shoes, and leggings
364784, G06F 752
Patent
active
053474821
ABSTRACT:
A multiplier tree sums the partial products of a multiplication operation, employing a regular hierarchical arrangement of bit adders that accept nine initial inputs and a carry input and produce three outputs and a carry output. The regularity of the structure of the bit adder allows it be used to form an array of bit adders to sum twenty-seven input bits and ten carry input bits to produce three output bits and ten carry outputs bits. These bit adders form the basis of the multiplier tree. The multiplier tree using this structure can sum the partial products from a 52 to 54 bit multiply operation in no more adder delays than a Wallace tree, but with a more regular structure. A method for reducing nine input signals to three output signals segregates the input signals into sets of signals and combines them into reduced sets of logically equivalent signals.
REFERENCES:
patent: 4799183 (1989-01-01), Nakano et al.
patent: 4823300 (1989-04-01), Malinowski
patent: 4999802 (1991-03-01), Cocanougher et al.
patent: 5132921 (1992-07-01), Kelley et al.
Wallace, C. S., "A Suggestion for a Fast Multiplier", IEEE Trans. Electron Comput. EC-13:14-17 (1964).
Dadda, L., "Some Schemes for Parallel Multipliers", Alta Freq. 34:349-356 (1965).
Dadda, L., "On Parallel Digital Multipliers", Alta Freq. 45:574-580 (1976).
HaL Computer Systems, Inc.
Mai Tan V.
Smith A. C.
LandOfFree
Multiplier tree using nine-to-three adders does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Multiplier tree using nine-to-three adders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiplier tree using nine-to-three adders will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1125591