Multiple-symbol differential detection based on combinatorial geometry

Pauli V, Lampe L, Schober R, Fukuda K (2008)

Publication Type: Journal article

Publication year: 2008

Journal

IEEE Transactions on Communications Institute of Electrical and Electronics Engineers (IEEE)

Book Volume: 56

Pages Range: 1596-1600

Journal Issue: 10

DOI: 10.1109/TCOMM.2008.060533

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 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 × 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. © 2008 IEEE.

Authors with CRIS profile

Robert Schober

Involved external institutions

University of British Columbia CA Canada (CA) Eidgenössische Technische Hochschule Zürich (ETHZ) / Swiss Federal Institute of Technology in Zurich CH Switzerland (CH)

How to cite

APA:

Pauli, V., Lampe, L., Schober, R., & Fukuda, K. (2008). Multiple-symbol differential detection based on combinatorial geometry. IEEE Transactions on Communications, 56(10), 1596-1600. https://doi.org/10.1109/TCOMM.2008.060533

MLA:

Pauli, Volker, et al. "Multiple-symbol differential detection based on combinatorial geometry." IEEE Transactions on Communications 56.10 (2008): 1596-1600.

BibTeX: Download