Differential space-time multi-block decoding

Pingan Li, Khaled Letaief

Research output: Contribution to journalArticle

Abstract

In this paper, we consider the maximum-likelihood multi-block decoding in differential space-time block coding systems. Since the computational complexity of the maximum-likelihood multi-block detector increases exponentially as a function of the number of signal blocks used in the decoding, a trellis-based Viterbi algorithm is proposed to implement multi-block space-time decoding without an increase in the computational complexity in each new branch-metric evaluation stage. It is demonstrated that by increasing the number of blocks, one can more efficiently utilize the differential coding relationship in the decoding process. A forgetting factor is further introduced into the maximum-likelihood decoding and the corresponding branch-metric is derived. Numerical results are presented to demonstrate the effects of fading rate, the value of the forgetting factor, and the number of comparative paths on the performance of the proposed approaches.

Original languageEnglish
Article number993498
Pages (from-to)239-243
Number of pages5
JournalIEEE Wireless Communications and Networking Conference, WCNC
Volume1
DOIs
Publication statusPublished - 2002
Externally publishedYes

Fingerprint

Decoding
Maximum likelihood
Computational complexity
Space-time block coding (STBC)
Viterbi algorithm
Detectors

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Differential space-time multi-block decoding. / Li, Pingan; Letaief, Khaled.

In: IEEE Wireless Communications and Networking Conference, WCNC, Vol. 1, 993498, 2002, p. 239-243.

Research output: Contribution to journalArticle

@article{60921b092f37492ab4fdf38a5d49487b,
title = "Differential space-time multi-block decoding",
abstract = "In this paper, we consider the maximum-likelihood multi-block decoding in differential space-time block coding systems. Since the computational complexity of the maximum-likelihood multi-block detector increases exponentially as a function of the number of signal blocks used in the decoding, a trellis-based Viterbi algorithm is proposed to implement multi-block space-time decoding without an increase in the computational complexity in each new branch-metric evaluation stage. It is demonstrated that by increasing the number of blocks, one can more efficiently utilize the differential coding relationship in the decoding process. A forgetting factor is further introduced into the maximum-likelihood decoding and the corresponding branch-metric is derived. Numerical results are presented to demonstrate the effects of fading rate, the value of the forgetting factor, and the number of comparative paths on the performance of the proposed approaches.",
author = "Pingan Li and Khaled Letaief",
year = "2002",
doi = "10.1109/WCNC.2002.993498",
language = "English",
volume = "1",
pages = "239--243",
journal = "IEEE Wireless Communications and Networking Conference, WCNC",
issn = "1525-3511",

}

TY - JOUR

T1 - Differential space-time multi-block decoding

AU - Li, Pingan

AU - Letaief, Khaled

PY - 2002

Y1 - 2002

N2 - In this paper, we consider the maximum-likelihood multi-block decoding in differential space-time block coding systems. Since the computational complexity of the maximum-likelihood multi-block detector increases exponentially as a function of the number of signal blocks used in the decoding, a trellis-based Viterbi algorithm is proposed to implement multi-block space-time decoding without an increase in the computational complexity in each new branch-metric evaluation stage. It is demonstrated that by increasing the number of blocks, one can more efficiently utilize the differential coding relationship in the decoding process. A forgetting factor is further introduced into the maximum-likelihood decoding and the corresponding branch-metric is derived. Numerical results are presented to demonstrate the effects of fading rate, the value of the forgetting factor, and the number of comparative paths on the performance of the proposed approaches.

AB - In this paper, we consider the maximum-likelihood multi-block decoding in differential space-time block coding systems. Since the computational complexity of the maximum-likelihood multi-block detector increases exponentially as a function of the number of signal blocks used in the decoding, a trellis-based Viterbi algorithm is proposed to implement multi-block space-time decoding without an increase in the computational complexity in each new branch-metric evaluation stage. It is demonstrated that by increasing the number of blocks, one can more efficiently utilize the differential coding relationship in the decoding process. A forgetting factor is further introduced into the maximum-likelihood decoding and the corresponding branch-metric is derived. Numerical results are presented to demonstrate the effects of fading rate, the value of the forgetting factor, and the number of comparative paths on the performance of the proposed approaches.

UR - http://www.scopus.com/inward/record.url?scp=84907567386&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84907567386&partnerID=8YFLogxK

U2 - 10.1109/WCNC.2002.993498

DO - 10.1109/WCNC.2002.993498

M3 - Article

VL - 1

SP - 239

EP - 243

JO - IEEE Wireless Communications and Networking Conference, WCNC

JF - IEEE Wireless Communications and Networking Conference, WCNC

SN - 1525-3511

M1 - 993498

ER -