Noncoherent receivers for differential space-time modulation

Schober, Robert; Lampe, Lutz

doi:10.1109/glocom.2001.965655

Cited by 38 publications

(113 citation statements)

References 17 publications

Supporting

Mentioning

112

Contrasting

Order By: Relevance

“…Similar to [12], we first need to find the probability density function (PDF) function of λ(l 0 ). At the high SNR region, the second-order noise term can be ignored and then (11) becomes…”

Section: B Statistics Of the Initial Radiusmentioning

confidence: 99%

“…By using the same approach as in [9], [11], the joint ML estimates ofV [k] and ε can be derived as in (30), where…”

Section: A Multiple Symbol Detectionmentioning

confidence: 99%

“…If CFO remains constant across more than two blocks or varies very slowly among several blocks, multiple symbol detection (MSD) can also be applied for DUSTM as in [9], [11]. In MSD, the transmitted symbols in N consecutive intervals are estimated using N + 1 received blocks.…”

Section: A Multiple Symbol Detectionmentioning

confidence: 99%

See 2 more Smart Citations

Reduced Complexity ML Detection for Differential Unitary Space-Time Modulation with Carrier Frequency Offset

Gao

Nallanathan

Tellambura

2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-Recently, a maximum likelihood (ML) detection rule for differential unitary space time modulation (DUSTM) under the existence of unknown carrier frequency offset (CFO) has been derived. However, the ML detection is based on the exhaustive search over all the unitary group codes. In this paper, we design an efficient detection algorithm for newly derived ML rule, by modifying the bound intersection detector (BID). Our proposed algorithm is seen as a generalization of the existing BID that is known to be an optimal detector for the conventional DUSTM. The simulation results show that the proposed algorithm can save a large portion of the computational complexity compared to the naive searching method.

show abstract

Section: B Statistics Of the Initial Radiusmentioning

confidence: 99%

“…By using the same approach as in [9], [11], the joint ML estimates ofV [k] and ε can be derived as in (30), where…”

Section: A Multiple Symbol Detectionmentioning

confidence: 99%

See 1 more Smart Citation

Reduced Complexity ML Detection for Differential Unitary Space-Time Modulation with Carrier Frequency Offset

Gao

Nallanathan

Tellambura

2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

show abstract

“…When the channel changes in each time slot, the MSDD metric is derived in [6] for diagonal constellations. It can be readily verified that C R [k] in (12) is the same as (19) in [6].…”

Section: Multiple-symbol Differential Space-time Demodulationmentioning

confidence: 99%

“…For a moderate number of symbols, MSD bridges the performance gap between M -PSK and M -DPSK. In [6], MSD and decision-feedback differential detection (DF-DD) [7] are applied to DSTM to overcome the performance loss in fast fading channels and the decision rules are derived. However, the rules can only be applied to diagonal constellations and when the constellation size L is very large, even DF-DD is intractable.…”

Section: Introductionmentioning

confidence: 99%

Multiple-symbol differential unitary space-time demodulation with reduced-complexity

Cui

Tellambura

2005

IEEE International Conference on Communications, 2005. ICC 2005. 2005

View full text Add to dashboard Cite

Abstract-We derive a new decision rule for multiple-symbol detection (MSD) of differential unitary space-time modulation (DUSTM). It is valid for both diagonal and non-diagonal constellations, and for quasi-static fading channels. We then present a fast algorithm based on the Extended Euclidean algorithm and bound principles for single symbol detection (SSD) with diagonal constellations. We call it bound-intersection detection (BID) and it is exact maximum likelihood (ML). In high SNR, the complexity of our algorithm is much less than that of the brute-force ML search. We also develop two BID variants for MSD. They are ML but with significantly reduced complexity using branch-and-bound (BnB).

show abstract