24421 search results - page 64 / 4885 » Communicating Complex Systems |
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
CISS
2007
IEEE
14 years 2 months ago
2007
IEEE
Relay-based cooperative communications can achieve spatial diversity gains, enhance coverage and potentially increase capacity. If considered for large networks, traditional relayi...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
— Iterative equalization has emerged as an efficient means of achieving near-capacity detection performance in multiple-antenna (MIMO) systems. However, many proposed detection ...
VTC
2007
IEEE
14 years 2 months ago
2007
IEEE
— A novel scheduling for turbo equalization with turbo decoding is proposed. The use of turbo codes associated to turbo equalizers has been frequently investigated in the literat...