199 search results - page 22 / 40 » Sequences of low arithmetical complexity |
HIPEAC
2005
Springer
14 years 3 months ago
2005
Springer
ions Sebastian Pop 1 , Albert Cohen 2 , and Georges-Andr´e Silber 1 1 CRI, Mines Paris, Fontainebleau, France 2 ALCHEMY group, INRIA Futurs, Orsay, France Abstract. This paper pre...
VLSISP
2002
13 years 9 months ago
2002
Abstract. This paper presents a reduced-complexity, fixed-point algorithm and efficient real-time VLSI architectures for multiuser channel estimation, one of the core baseband proc...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...