On the performance of iterative noncoherent detection of coded M-PSK signals

Marsland, Ian; Mathiopoulos, P. Takis

doi:10.1109/26.843126

Cited by 61 publications

(36 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This idea has been successfully applied e.g. in [2] and has its roots in multiple-symbol detection of M -DPSK [1]. This approach in fact leads to a receiver previously described by Hansson and Aulin [6] for minimum-shift keying and can basically be described by the following approximation p(r k |s , s, r …”

Section: App-demodulation Of M -Dpskmentioning

confidence: 99%

“…Hence, the generated APPs are only approximate, which is made up for by feeding back extrinsic information from the channel decoder. Only AWGN is considered in [2]. A similar approach is taken in [3], where the focus lies on turbo-decoding.…”

mentioning

confidence: 99%

“…Several publications adopted the idea of MSDD to implement iterative strategies, in order to combine the benefits of coding and multiple symbol observations. In [2] a noncoherent BCJRtype algorithm is derived which introduces a MSDD-like transition metric by truncating the observations for a transition to a few previous symbols. Hence, the generated APPs are only approximate, which is made up for by feeding back extrinsic information from the channel decoder.…”

mentioning

confidence: 99%

“…A similar approach is taken in [3], where the focus lies on turbo-decoding. Unlike [2], the alphabet is not restricted to PSK, but also only AWGN is considered. [4] advances the scheme of [3] by incorporating block fading.…”

mentioning

confidence: 99%

See 3 more Smart Citations

A Multiple-Symbol Turbo Detector for Coded M-DPSK Over Time-Varying Rayleigh Flat Fading Channels

Klenner

Kammeyer

2006

IEEE Vehicular Technology Conference

View full text Add to dashboard Cite

Abstract-In the past few years, a number of publications concentrated on developing soft-in-soft-out algorithms for coded noncoherent detection, thereby enabling iterative processing and avoiding the need of channel estimation. This paper focuses on iterative noncoherent detection of convolutionally coded M -DPSK signals for time-variant Rayleigh flat fading channels without the receiver having channel state information (CSI). Specifically we show that a noncoherent soft demodulator for minimum-shift keying, which was previously reported in the literature, lends itself quite naturally for soft demodulation of DPSK. We present an extension of this receiver in terms of persurvivor processing and examine the influence of different symbol labelings.I. INTRODUCTION DPSK is well-known as a robust means to transmit data because it renders the need of carrier phase tracking unnecessary and eludes the problem of phase ambiguities, thus allowing for a simple receiver design. To overcome the entailed penalty in shape of a loss in SNR (approx. 2-3dB for QDPSK against QPSK), multiple symbol differential detection (MSDD) schemes were introduced. Numerous publications center around the idea to extend the observation interval of two symbols for conventional detection of DPSK to larger intervals. Thus e.g. for the AWGN channel, it is possible to attain the performance of differentially encoded and coherently detected M -PSK. In [1] it is shown, how MSDD is implemented for AWGN as well as Rayleigh fading channels. There, a number of maximum-likelihood metrics are derived from the multivariate Gaussian distribution. Several publications adopted the idea of MSDD to implement iterative strategies, in order to combine the benefits of coding and multiple symbol observations. In[2] a noncoherent BCJRtype algorithm is derived which introduces a MSDD-like transition metric by truncating the observations for a transition to a few previous symbols. Hence, the generated APPs are only approximate, which is made up for by feeding back extrinsic information from the channel decoder. Only AWGN is considered in [2]. A similar approach is taken in [3], where the focus lies on turbo-decoding. Unlike [2], the alphabet is not restricted to PSK, but also only AWGN is considered. [4] advances the scheme of [3] by incorporating block fading. Although minimum-shift keying is considered, the described transition metric is generally applicable.

show abstract

Section: App-demodulation Of M -Dpskmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

A Multiple-Symbol Turbo Detector for Coded M-DPSK Over Time-Varying Rayleigh Flat Fading Channels

Klenner

Kammeyer

2006

IEEE Vehicular Technology Conference

View full text Add to dashboard Cite

show abstract

“…The second class of algorithms is related to the work in [8], [13], and [14], where the infinite memory of the channel is "a priori" truncated. Once the memory truncation is performed, the system given by the channel and a possible channel encoder collapses to a finite state machine (FSM) and an FB algorithm can be derived accordingly.…”

mentioning

confidence: 99%

Adaptive Iterative Detection for the Phase-Uncertain Channel: Limited-Tree-Search Versus Truncated-Memory Detection

Ferrari

Anastasopoulos

Colavolpe

et al. 2004

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-In this paper, we consider iterative detection over bandpass channels that introduce an unknown phase rotation in the transmitted signal. This work focuses on the comparison between two adaptive detection strategies for trellis-based coded modulation: limited-tree-search (LTS) detection, obtained by reducing a tree search to a limited trellis search, and truncated-memory (TM) detection, based on channel-memory truncation, which automatically leads to a trellis search. Both strategies are used to derive trellis-based forward-backward (FB) algorithms. A quantitative analysis based on simulations, with various coding and modulation schemes, is carried out to evaluate and compare the two approaches. The results show that the channel-phase dynamics should significantly influence the choice of the detection strategy: For low-phase variations, LTS algorithms are a simple and reasonable choice, while for moderate to fast phase variations, TM algorithms show a considerable robustness.

show abstract

On Coded and Interleaved Noncoherent Multiple Symbol Detected MPSK

Peleg

Shitz

1999

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Abstract. The performance of multiple symbol noncoherent detection of MPSK combined with coding and interleaving is examined in terms of the cut-off rate bound. It is shown that, within this approach, inner modulation coding improves on standard DPSK when both are combined with an external error correcting code, such as the industry standard, li = 7 R = l/? convolutional code. Some modulation codes over BPSK and QPSK are examined and a reduced complexity decoder is presented. The results and conclusions are verified by some simulations.

show abstract

On the performance of iterative noncoherent detection of coded M-PSK signals

Cited by 61 publications

References 16 publications

A Multiple-Symbol Turbo Detector for Coded M-DPSK Over Time-Varying Rayleigh Flat Fading Channels

A Multiple-Symbol Turbo Detector for Coded M-DPSK Over Time-Varying Rayleigh Flat Fading Channels

Adaptive Iterative Detection for the Phase-Uncertain Channel: Limited-Tree-Search Versus Truncated-Memory Detection

On Coded and Interleaved Noncoherent Multiple Symbol Detected MPSK

Contact Info

Product

Resources

About