|
Volumn , Issue , 2009, Pages 2725-2728
|
Low complexity essentially maximum likelihood decoding of perfect space-time block codes
a a b |
Author keywords
Fast maximum likelihood decoding; Perfect space time codes; Sphere decoding
|
Indexed keywords
EXHAUSTIVE SEARCH;
FAST MAXIMUM LIKELIHOOD DECODING;
FULL DIVERSITY;
FULL RATE;
HIGH PROBABILITY;
LIKELIHOOD FUNCTIONS;
LOW COMPLEXITY;
MAXIMUM LIKELIHOOD DECODERS;
MAXIMUM LIKELIHOOD DECODING;
NONVANISHING DETERMINANT;
PERFECT SPACE-TIME CODES;
PERFECT STBC;
REDUCED COMPLEXITY;
SIGNAL POINT;
SPACE-TIME BLOCK CODE;
SPHERE DECODERS;
SPHERE DECODING;
SPHERE DECODING ALGORITHM;
WORST-CASE COMPLEXITY;
ACOUSTICS;
ALGORITHMS;
BLOCK CODES;
CHANNEL CAPACITY;
COMMUNICATION CHANNELS (INFORMATION THEORY);
COMPUTATIONAL COMPLEXITY;
DECODING;
MODULATION;
SIGNAL PROCESSING;
SPACE TIME ADAPTIVE PROCESSING;
SPHERES;
WIRELESS TELECOMMUNICATION SYSTEMS;
MAXIMUM LIKELIHOOD;
|
EID: 70349210153
PISSN: 15206149
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICASSP.2009.4960186 Document Type: Conference Paper |
Times cited : (16)
|
References (8)
|