Home › Entities › academia › 29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees

29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees

Research article (2023 IEEE International Solid- State Circuits Conference (ISSCC), 2023) · cited 23× · AI/ML
academia openalex:W4360605392
Press Enter · cited answer in seconds

29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees

Summary

29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees is a scholarly article[1].

Key Facts

  • 29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). 29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees. Retrieved May 24, 2026, from https://4ort.xyz/entity/29-3-an-8-09tops-w-neural-engine-leveraging-bit-sparsified-sign-magnitude-multiplications-and-dual-adder-trees
MLA “29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/29-3-an-8-09tops-w-neural-engine-leveraging-bit-sparsified-sign-magnitude-multiplications-and-dual-adder-trees.
BibTeX @misc{4ortxyz_29-3-an-8-09tops-w-neural-engine-leveraging-bit-sparsified-sign-magnitude-multiplications-and-dual-adder-trees_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees}}, year = {2026}, url = {https://4ort.xyz/entity/29-3-an-8-09tops-w-neural-engine-leveraging-bit-sparsified-sign-magnitude-multiplications-and-dual-adder-trees}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): 29.3 An 8.09TOPS/W Neural Engine Leveraging Bit-Sparsified Sign-Magnitude Multiplications and Dual Adder Trees — https://4ort.xyz/entity/29-3-an-8-09tops-w-neural-engine-leveraging-bit-sparsified-sign-magnitude-multiplications-and-dual-adder-trees (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/29-3-an-8-09tops-w-neural-engine-leveraging-bit-sparsified-sign-magnitude-multiplications-and-dual-adder-trees · Last refreshed: