Sciweavers

556 search results - page 29 / 112
» Fast parallel GPU-sorting using a hybrid algorithm
Sort
View
HIPEAC
2009
Springer
14 years 3 months ago
Hybrid Super/Subthreshold Design of a Low Power Scalable-Throughput FFT Architecture
In this article, we present a parallel implementation of a 1024 point Fast Fourier Transform (FFT) operating with a subthreshold supply voltage, which is below the voltage that tur...
Michael B. Henry, Leyla Nazhandali
CC
2004
Springer
160views System Software» more  CC 2004»
14 years 2 months ago
Elkhound: A Fast, Practical GLR Parser Generator
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
Scott McPeak, George C. Necula
ICDCS
2002
IEEE
14 years 1 months ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
14 years 2 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman
TIP
2011
195views more  TIP 2011»
13 years 3 months ago
Accelerating X-Ray Data Collection Using Pyramid Beam Ray Casting Geometries
Abstract—Image reconstruction from its projections is a necessity in many applications such as medical (CT), security, inspection, and others. This paper extends the 2-D Fan-beam...
Amir Averbuch, Guy Lifschitz, Yoel Shkolnisky