Sciweavers

787 search results - page 2 / 158
» Digital Algebra and Circuits
Sort
View
EJC
2002
13 years 4 months ago
Bases in Orlik-Solomon Type Algebras
The Orlik-Solomon algebra of a matroid M is the quotient of the exterior algebra on the points by the ideal (M) generated by the boundaries of the circuits of the matroid. There i...
David Forge
DSD
2010
IEEE
137views Hardware» more  DSD 2010»
13 years 2 months ago
A C-to-RTL Flow as an Energy Efficient Alternative to Embedded Processors in Digital Systems
We present a high-level synthesis flow for mapping an algorithm description (in C) to a provably equivalent registertransfer level (RTL) description of hardware. This flow uses an ...
Sameer D. Sahasrabuddhe, Sreenivas Subramanian, Ku...
DAC
2007
ACM
14 years 6 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
FSTTCS
2009
Springer
13 years 11 months ago
The Power of Depth 2 Circuits over Algebras
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
13 years 9 months ago
Improving XOR-Dominated Circuits by Exploiting Dependencies between Operands
Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer ...
Ajay K. Verma, Paolo Ienne