Sciweavers

155 search results - page 5 / 31
» Reducing Design Complexity of the Load Store Queue
Sort
View
JCM
2008
104views more  JCM 2008»
13 years 8 months ago
An OFDM Symbol Design for Reduced Complexity MMSE Channel Estimation
In this paper we revisit the minimum mean square error (MMSE) pilot-aided channel estimation for broadband orthogonal frequency division multiplexing (OFDM) systems. The careful de...
Carlos Ribeiro, Atílio Gameiro
ISCA
2002
IEEE
108views Hardware» more  ISCA 2002»
14 years 29 days ago
A Scalable Instruction Queue Design Using Dependence Chains
Increasing the number of instruction queue (IQ) entries in a dynamically scheduled processor exposes more instruction-level parallelism, leading to higher performance. However, in...
Steven E. Raasch, Nathan L. Binkert, Steven K. Rei...
CC
2004
Springer
14 years 1 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
MICRO
2005
IEEE
114views Hardware» more  MICRO 2005»
14 years 1 months ago
Address-Indexed Memory Disambiguation and Store-to-Load Forwarding
This paper describes a scalable, low-complexity alternative to the conventional load/store queue (LSQ) for superscalar processors that execute load and store instructions speculat...
Sam S. Stone, Kevin M. Woley, Matthew I. Frank
JSA
2010
102views more  JSA 2010»
13 years 6 months ago
On reducing load/store latencies of cache accesses
— Effective address calculation for load and store instructions needs to compete for ALU with other instructions and hence extra latencies might be incurred to data cache accesse...
Yuan-Shin Hwang, Jia-Jhe Li