Sciweavers

2392 search results - page 7 / 479
» Channel-Hopping Multiple Access
Sort
View
INFOCOM
1997
IEEE
13 years 11 months ago
Collision Avoidance and Resolution Multiple Access with Transmission Groups
The CARMA-NTG protocol is presented and analyzed. CARMA-NTG dynamically divides the channel into cycles of variable length; each cycle consists of a contention period and a group-...
Rodrigo Garcés, J. J. Garcia-Luna-Aceves
ACSC
2004
IEEE
13 years 10 months ago
On Improving the Memory Access Patterns During The Execution of Strassen's Matrix Multiplication Algorithm
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
Hossam A. ElGindy, George Ferizis
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 6 months ago
Linear Sum Capacity for Gaussian Multiple Access Channels with Feedback
The capacity region of the N-sender additive white Gaussian noise (AWGN) multiple access channel (MAC) with feedback is not known in general, despite significant contributions by C...
Ehsan Ardestanizadeh, Michele A. Wigger, Young-Han...
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 6 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir
CORR
2008
Springer
159views Education» more  CORR 2008»
13 years 6 months ago
Compound Multiple Access Channels with Partial Cooperation
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special ...
Osvaldo Simeone, Deniz Gündüz, H. Vincen...