|
Volumn 4, Issue , 2004, Pages
|
An exponential lower bound on the expected complexity of sphere decoding
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMMUNICATION CHANNELS (INFORMATION THEORY);
COMPUTATIONAL COMPLEXITY;
MATRIX ALGEBRA;
POLYNOMIALS;
PROBLEM SOLVING;
SIGNAL TO NOISE RATIO;
VECTORS;
DIGITAL COMMUNICATION SYSTEM;
POLYNOMIAL COMPLEXITY;
SPHERE DECODERS;
WIRELESS TELECOMMUNICATION SYSTEMS;
|
EID: 4544278544
PISSN: 15206149
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (57)
|
References (11)
|