Sciweavers

512 search results - page 45 / 103
» Random Access Systems with a Time Varying Channel
Sort
View
MOBIHOC
2012
ACM
13 years 16 days ago
Throughput of rateless codes over broadcast erasure channels
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Yang Yang, Ness B. Shroff
INFOCOM
2007
IEEE
15 years 4 months ago
A Cross-Layer Architecture to Exploit Multi-Channel Diversity with a Single Transceiver
—The design of multi-channel multi-hop wireless mesh networks is centered around the way nodes synchronize when they need to communicate. However, existing designs are confined ...
Jay A. Patel, Haiyun Luo, Indranil Gupta
TWC
2008
126views more  TWC 2008»
14 years 10 months ago
Quadratic forms in normal RVs: theory and applications to OSTBC over hoyt fading channels
In this paper, the statistics of quadratic forms in normal random variables (RVs) are studied and their impact on performance analysis of wireless communication systems is explored...
George A. Ropokis, Athanasios A. Rontogiannis, P. ...
ISCA
2010
IEEE
284views Hardware» more  ISCA 2010»
15 years 3 months ago
Security refresh: prevent malicious wear-out and increase durability for phase-change memory with dynamically randomized address
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
Nak Hee Seong, Dong Hyuk Woo, Hsien-Hsin S. Lee
ICC
2007
IEEE
197views Communications» more  ICC 2007»
15 years 4 months ago
A Distributed Scheduling Algorithm for Multiuser MIMO Systems with 1-bit SINR Feedback
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
Stefano Sorrentino, Umberto Spagnolini, Lino Moret...