Sciweavers

1053 search results - page 62 / 211
» Shape as Memory Storage
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
Efficient soft demodulation of MIMO QPSK via semidefinite relaxation
We develop a computationally efficient and memory efficient approach to (near) maximum a posteriori probability demodulation for MIMO systems with QPSK signalling, based on semi...
Mehran Nekuii, Mikalai Kisialiou, Timothy N. David...
ARCS
1997
Springer
14 years 2 months ago
A Novel Universal Sequencer Hardware
This paper introduces a powerful novel sequencer hardware for controlling computational machines and for structured DMA (direct memory access) applications. The paper introduces t...
Reiner W. Hartenstein, Jürgen Becker, Michael...
ENTCS
2008
118views more  ENTCS 2008»
13 years 8 months ago
Shared Hash Tables in Parallel Model Checking
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...
Jiri Barnat, Petr Rockai
ISSS
1999
IEEE
89views Hardware» more  ISSS 1999»
14 years 2 months ago
Loop Scheduling and Partitions for Hiding Memory Latencies
Partition Scheduling with Prefetching (PSP) is a memory latency hiding technique which combines the loop pipelining technique with data prefetching. In PSP, the iteration space is...
Fei Chen, Edwin Hsing-Mean Sha
CONNECTION
2007
87views more  CONNECTION 2007»
13 years 9 months ago
Efficient architectures for sparsely-connected high capacity associative memory models
In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory...
Lee Calcraft, Rod Adams, Neil Davey