8 search results - page 1 / 2 » On the OBDD complexity of the most significant bit of intege... |
ECCC
2008
13 years 5 months ago
2008
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
CHES
2005
Springer
13 years 10 months ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
ACMSE
2006
ACM
13 years 8 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
—The IEEE 802.15.3 has introduced a type of time division multiple access (TDMA) which allocates the variable length of timeslot within a constant time interval. However, it need...