.png){kind=icon}
Return
Multiple-symbol differential sphere decoding
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2005.860092.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In multiple-symbol differential detection (MSDD) for power-efficient transmission over Rayleigh fading channels without channel state information, blocks of N received symbols are jointly processed to decide on N - I data symbols. The search space for the maximum-likelihood (NIL) estimate is therefore (complex) (N - 1)-dimensional, and maximum-likelihood MSDD (ML-MSDD) quickly becomes computationally intractable as N grows. Mackenthun's low-complexity MSDD algorithm finds the ML estimate only for Rayleigh fading channels that are time-invariant over an N symbol period. For the general time-varying fading case, however, low-complexity ML-MSDD is an unsolved problem. In this letter, we solve this problem by applying sphere decoding (SD) to ML-MSDD for time-varying Rayleigh fading channels. The resulting technique is referred to as multiple-symbol differential sphere decoding (MSDSD).
Keywords:
maximum-likelihood (ML) decoding
multiple-symbol differential detection (MSDD)
Rayleigh fading channels
sphere decoding (SD)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
no more
no more