Further results on differential space-time modulations

Chiavaccini, E.; Vitetta, G.M.

doi:10.1109/tcomm.2003.814211

Cited by 38 publications

(14 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, as the MSD decision rule in [12] is computationally too complex, only the special case of diagonal signals is considered in [12]. A general decision metric for MSD of DUSTM is derived in [14], which uses the Viterbi algorithm for detection, resulting in high complexity for large constellation size . In both [12] and [14], a major thrust is to analyze the error performance of these schemes, as opposed to developing efficient decoders.…”

mentioning

confidence: 99%

“…A general decision metric for MSD of DUSTM is derived in [14], which uses the Viterbi algorithm for detection, resulting in high complexity for large constellation size . In both [12] and [14], a major thrust is to analyze the error performance of these schemes, as opposed to developing efficient decoders. The first important paper dealing with this decoding problem is by Clarkson et al [15], which develops a low-complexity approximate algorithm for the SSD of diagonal signals.…”

mentioning

confidence: 99%

“…In this paper, based on [12]- [14], we derive a decision metric for MSD of DUSTM over a quasi-static (QS) fading channel. The main contribution of the paper is, however, a fast exact ML detector, called the bound-intersection detector (BID), for SSD with diagonal constellations.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Bound-Intersection Detection for Multiple-Symbol Differential Unitary Space–Time Modulation

Cui

Tellambura

2005

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-This paper considers multiple-symbol differential detection (MSD) of differential unitary space-time modulation (DUSTM) over multiple-antenna systems. We derive a novel exact maximum-likelihood (ML) detector, called the bound-intersection detector (BID), using the extended Euclidean algorithm for single-symbol detection of diagonal constellations. While the ML search complexity is exponential in the number of transmit antennas and the data rate, our algorithm, particularly in high signal-to-noise ratio, achieves significant computational savings over the naive ML algorithm and the previous detector based on lattice reduction. We also develop four BID variants for MSD. The first two are ML and use branch-and-bound, the third one is suboptimal, which first uses BID to generate a candidate subset and then exhaustively searches over the reduced space, and the last one generalizes decision-feedback differential detection. Simulation results show that the BID and its MSD variants perform nearly ML, but do so with significantly reduced complexity.Index Terms-Differential space-time coding, maximum-likelihood (ML), multiple-symbol differential detection (MSD).

show abstract

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Bound-Intersection Detection for Multiple-Symbol Differential Unitary Space–Time Modulation

Cui

Tellambura

2005

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…This can be explained by regarding MSDD as detection with inherent prediction-based channel estimation (cf. [40,32]), which yields estimation with lower estimation error for symbols located in the center positions of the observation window than for symbols at its edges.…”

Section: B Evaluationmentioning

confidence: 99%

Differential Space-Frequency Modulation and Fast 2-D Multiple-Symbol Differential Detection for MIMO-OFDM

Pauli

Lampe

Huber

2008

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

The combination of differential space-frequency modulation (DSFM) with orthogonal frequency division multiplexing (OFDM) is attractive for transmission over time-and frequency-selective multiple-input multiple-output (MIMO) channels and detection without the need for channel state information (CSI) at the receiver. It is well known that simple differential detection results in a high error floor already for moderate time and frequency selectivity of the channel. More sophisticated multiple-symbol differential detection (MSDD), which jointly processes multiple received symbols, overcomes this limitation, usually at the price of higher detection complexity. In this paper we consider DSFM for MIMO-OFDM transmission and MSDD at the receiver. Inspired by previous work presented in the literature, we devise a novel DSFM scheme, which makes use of spatial and/or spectral (multipath) diversity and is particularly suited for MIMO-OFDM and power-efficient, low-delay MSDD. We further investigate the application of a two-dimensional (2D) observation window to MSDD (2D-MSDD) in order to exploit channel correlations in both time and frequency direction. We develop a representation of the detection problem that is amenable to tree-search decoding, whose application leads to a tremendous reduction in MSDD complexity or "fast" MSDD. An analytical approximation of the symbol-error rate of 2D-MSDD for MIMO-OFDM under spatially correlated fading is derived, which enables quick and accurate performance evaluations. Numerical and simulation results corroborate the efficacy of our approach and show that power efficiency close to that of coherent detection with perfect CSI is feasible in all standard fading scenarios at reasonable decoder complexity. Index TermsOrthogonal frequency division multiplexing (OFDM), multiple-input multiple-output (MIMO) transmission, differential space-frequency modulation (DSFM), differential space-time modulation (DSTM), multiple-symbol differential detection (MSDD), tree-search decoding, sphere decoding.

show abstract

“…When CSI is unavailable, OSTBC can be used in a differential encoding manner and still possess low decoding complexity [6]- [8]. Existing work on performance analysis of differential OSTBC can be found in [9]- [11], and they all assume identical channel distributions.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Differential Orthogonal Space-Time Block Codes over Semi-Identical MIMO Fading Channels

Tao

Kam

2006

2006 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-We study the performance of differential orthogonal space-time block codes over independent and semi-identically distributed Rayleigh fading channels. In this semi-identically distributed fading model, the channel gains from different transmit antennas to a common receive antenna are identically distributed, but the gains associated with different receive antennas are non-identically distributed. Arbitrary fluctuation rates of the fading processes from one transmission block to another are considered. We first derive the optimal symbolby-symbol differential detector, and show that the conventional differential detector is suboptimal. We then derive expressions of exact bit error probabilities (BEP) for both the optimal and suboptimal detectors. The results are applicable for any number of receive antennas and any number of transmit antennas for which orthogonal space-time block codes exist. For two transmit antennas, explicit and closed-form BEP expressions are obtained. A Chernoff bound on the BEP of optimal detection for any number of transmit antennas is also derived.

show abstract

Further results on differential space-time modulations

Cited by 38 publications

References 22 publications

Bound-Intersection Detection for Multiple-Symbol Differential Unitary Space–Time Modulation

Bound-Intersection Detection for Multiple-Symbol Differential Unitary Space–Time Modulation

Differential Space-Frequency Modulation and Fast 2-D Multiple-Symbol Differential Detection for MIMO-OFDM

Analysis of Differential Orthogonal Space-Time Block Codes over Semi-Identical MIMO Fading Channels

Contact Info

Product

Resources

About