Sciweavers

236 search results - page 7 / 48
» Real Complex Reconfigurable Arithmetic Using Redundant Compl...
Sort
View
WSNA
2003
ACM
14 years 29 days ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li
GLOBECOM
2007
IEEE
14 years 2 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
14 years 1 months ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
DAIS
2010
13 years 9 months ago
A Reconfiguration Language for Virtualized Grid Infrastructures
The growing needs in computational power to answer to the increasing number of on-line services and the complexity of applications makes it mandatory to build corresponding hardwar...
Rémy Pottier, Marc Léger, Jean-Marc ...
GIS
1995
ACM
13 years 11 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...