Sciweavers

723 search results - page 16 / 145
» Reducing the complexity of the issue logic
Sort
View
TSP
2011
152views more  TSP 2011»
13 years 2 months ago
Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation and Switched
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
Rodrigo C. de Lamare, Raimundo Sampaio Neto, Marti...
IEEEPACT
2002
IEEE
14 years 13 days ago
Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
Soner Önder
ISLPED
2007
ACM
57views Hardware» more  ISLPED 2007»
13 years 9 months ago
Resource area dilation to reduce power density in throughput servers
Throughput servers using simultaneous multithreaded (SMT) processors are becoming an important paradigm with products such as Sun's Niagara and IBM Power5. Unfortunately, thr...
Michael D. Powell, T. N. Vijaykumar
DATE
2004
IEEE
125views Hardware» more  DATE 2004»
13 years 11 months ago
Extremely Low-Power Logic
For extremely Low-power Logic, three very new and promising techniques will be described. The first are methods on circuit and system level for reduced supply voltages. In large l...
Christian Piguet, Jacques Gautier, Christoph Heer,...
ICCAD
1997
IEEE
127views Hardware» more  ICCAD 1997»
13 years 11 months ago
OPTIMIST: state minimization for optimal 2-level logic implementation
We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addre...
Robert M. Fuhrer, Steven M. Nowick