Sciweavers

64 search results - page 1 / 13
» Reducing computational complexity with array predicates
Sort
View
APL
1998
ACM
13 years 8 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
MICRO
2006
IEEE
107views Hardware» more  MICRO 2006»
13 years 4 months ago
Dataflow Predication
Predication facilitates high-bandwidth fetch and large static scheduling regions, but has typically been too complex to implement comprehensively in out-of-order microarchitecture...
Aaron Smith, Ramadass Nagarajan, Karthikeyan Sanka...
ISCAS
2006
IEEE
147views Hardware» more  ISCAS 2006»
13 years 10 months ago
Triangular systolic array with reduced latency for QR-decomposition of complex matrices
- The novel CORDIC-based architecture of the these weights (combiner unit). The implementation of the Triangular Systolic Array for QRD of large size complex combiner unit is rathe...
Alexander Maltsev, V. Pestretsov, Roman Maslenniko...
DCC
2004
IEEE
14 years 4 months ago
Reduced Complexity Wavelet-Based Predictive Coding of Hyperspectral Images for FPGA Implementation
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
Agnieszka C. Miguel, Amanda R. Askew, Alexander Ch...
COMPGEOM
1997
ACM
13 years 8 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...