Multiple-Symbol Differential Detection Based on Combinatorial Geometry

TitleMultiple-Symbol Differential Detection Based on Combinatorial Geometry
Publication TypeConference Paper
Year of Publication2007
AuthorsPauli, V., L. Lampe, R. Schober, and K. Fukuda
Conference NameCommunications, 2007. ICC '07. IEEE International Conference on
Pagination827 -832
Date Publishedjun.
Keywordschannel autocorrelation matrix, combinatorial geometry, complexity performance, computational complexity, computational geometry, error-rate performance, fading channels, low-signal-to-noise power ratio, matrix algebra, multiple-symbol differential detection, observation window, sphere-decoder
Abstract

In this paper, the application of combinatorial geometry to noncoherent multiple-symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as CG-MSDD. Analytical expressions for both the complexity and the error-rate performance of CG-MSDD are derived and it is shown that its complexity is polynomial in the length N of the MSDD observation window if the rank of the N times 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.

URLhttp://dx.doi.org/10.1109/ICC.2007.141
DOI10.1109/ICC.2007.141

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia