.png){kind=icon}
Return
Multiple-Symbol Differential Detection Based on Combinatorial Geometry
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2008.060533.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the application of combinatorial geometry to oncoherent multiple-symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as CG-MSDD. Analytical expressions for the complexity of CG-MSDD are derived and it is shown that it is polynomial in the length N of the MSDD observation window if the rank of the N x N channel autocorrelation matrix is fixed, but in fact exponential in N if standard fading models are considered. Compared to popular sphere-decoder based MSDD, CG-MSDD is superior (i) in low-signal-to-noise power ratio (SNR) slow-fading channels as its complexity is independent of the SNR, (ii) as its complexity is constant, i.e., independent of the particular channel and noise realization, and (iii) asymptotically, as its complexity exponent only scales linearly with the bandwidth of the fading process.
Keywords:
Multiple-symbol differential detection (MSDD)
fading channels
combinatorial geometry
sphere decoding
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
View more organizations
Cited Papers
Hydrogen quantum yields in the 360 nm photolysis of Eu2+ solutions and their relationship to photochemical fuel formation.png)
Solar Energy
Solar EnergyIF0
PREAI
ShareSaveShareSave
ShareSave View more