Constructing of Depth-Size Optimal Parallel Prefix Circuit
博士 === 國立臺灣科技大學 === 電子工程系 === 89 === Give n values x1, x2,..., xn and an associative binary operation ⊕, the prefix problem is to compute x1 ⊕x2 ⊕...⊕xi, 1<=i<=n. Because prefix computation has numerous applications, many combinational circuits for solving the prefix problem, called prefix c...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/16399505928051677291 |