|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| E.E., Jr. Swartzlander, "Merged Arithmetic," IEEE Transactions on Computers, vol. 29, no. 10, pp. 946-950, October, 1980. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1980.1675482, author = {E.E., Jr. Swartzlander}, title = {Merged Arithmetic}, journal ={IEEE Transactions on Computers}, volume = {29}, number = {10}, issn = {0018-9340}, year = {1980}, pages = {946-950}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1980.1675482}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Merged Arithmetic IS - 10 SN - 0018-9340 SP946 EP950 EPD - 946-950 A1 - E.E., Jr. Swartzlander, PY - 1980 KW - signal processing arithmetic KW - Complex multiplication KW - computer arithmetic KW - FFT butterfly operation KW - inner product computation KW - merged arithmetic KW - multiplier/adder VL - 29 JA - IEEE Transactions on Computers ER - | |||
The concept of merged arithmetic is introduced and demonstrated in the context of multiterm multiplication/addition. The merged approach involves synthesizing a composite arithmetic function (such as an inner product) directly instead of decomposing the function into discrete multiplication and addition operations. This approach provides equivalent arithmetic throughput with lower implementation complexity than conventional fast multipliers and carry look-ahead adder trees.
Index Terms:
signal processing arithmetic, Complex multiplication, computer arithmetic, FFT butterfly operation, inner product computation, merged arithmetic, multiplier/adder
Citation:
E.E., Jr. Swartzlander, "Merged Arithmetic," IEEE Transactions on Computers, vol. 29, no. 10, pp. 946-950, Oct. 1980, doi:10.1109/TC.1980.1675482
Usage of this product signifies your acceptance of the Terms of Use.

