Multiple-symbol differential detection based on combinatorial geometry

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2008-10, Vol.56 (10), p.1596-1600
Main Authors: Pauli, V., Lampe, L., Schober, R., Fukuda, K.
Format: Article
Language:English
Subjects:
Applied sciences
Asymptotic properties
Autocorrelation
Bandwidth
Channels
Character generation
Coding, codes
Combinatorial analysis
combinatorial geometry
Complexity
Computational complexity
Decoding
Detectors
Differential geometry
Exact sciences and technology
Exact solutions
Fading
fading channels
Geometry
Information, signal and communications theory
Mathematical analysis
Multiple-symbol differential detection (MSDD)
Polynomials
Signal and communications theory
Signal to noise ratio
sphere decoding
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 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.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2008.060533