On transceiver signal linearization and the decoding delay of maximum rate complex orthogonal space-time block codes

Sarah Spence Adams, Nathaniel Karst, Mathav Kishore Murugan, Tadeusz A Wysocki

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Complex orthogonal designs (CODs) have been successfully implemented in wireless systems as complex orthogonal space-time block codes (COSTBCs). Certain properties of the underlying CODs affect the performance of the codes. In addition to the main properties of a COD's rate and decoding delay, a third consideration is whether the COD can achieve transceiver signal linearization, a property that facilitates practical implementation by, for example, significantly simplifying the receiver structure for iterative decoding. It has been shown that a COD can achieve this transceiver signal linearization if the nonzero entries in any given row of the matrix are either all conjugated or all nonconjugated. This paper determines the conditions under which maximum rate CODs can achieve this desirable property. For an odd number of transmit antennas, it is shown that maximum rate CODs that achieve the lower bound on decoding delay can also achieve transceiver signal linearization. In contrast, for an even number of transmit antennas, maximum rate CODs that achieve the lower bound on delay cannot achieve this linearization. In this latter case, linearization is possible only if the COD achieves at least twice the lower bound on delay. This work highlights the tradeoffs among these three important properties.

Original languageEnglish (US)
Article number5773007
Pages (from-to)3618-3621
Number of pages4
JournalIEEE Transactions on Information Theory
Volume57
Issue number6
DOIs
StatePublished - Jun 1 2011

Fingerprint

Block codes
Transceivers
Linearization
Decoding
recipient
performance
Antennas
Iterative decoding
time

Keywords

  • Complex orthogonal designs (CODs)
  • iterative decoding
  • space-time block codes
  • transceiver signal linearization

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On transceiver signal linearization and the decoding delay of maximum rate complex orthogonal space-time block codes. / Adams, Sarah Spence; Karst, Nathaniel; Murugan, Mathav Kishore; Wysocki, Tadeusz A.

In: IEEE Transactions on Information Theory, Vol. 57, No. 6, 5773007, 01.06.2011, p. 3618-3621.

Research output: Contribution to journalArticle

@article{7f90008630154cfab452f47e15a0d980,
title = "On transceiver signal linearization and the decoding delay of maximum rate complex orthogonal space-time block codes",
abstract = "Complex orthogonal designs (CODs) have been successfully implemented in wireless systems as complex orthogonal space-time block codes (COSTBCs). Certain properties of the underlying CODs affect the performance of the codes. In addition to the main properties of a COD's rate and decoding delay, a third consideration is whether the COD can achieve transceiver signal linearization, a property that facilitates practical implementation by, for example, significantly simplifying the receiver structure for iterative decoding. It has been shown that a COD can achieve this transceiver signal linearization if the nonzero entries in any given row of the matrix are either all conjugated or all nonconjugated. This paper determines the conditions under which maximum rate CODs can achieve this desirable property. For an odd number of transmit antennas, it is shown that maximum rate CODs that achieve the lower bound on decoding delay can also achieve transceiver signal linearization. In contrast, for an even number of transmit antennas, maximum rate CODs that achieve the lower bound on delay cannot achieve this linearization. In this latter case, linearization is possible only if the COD achieves at least twice the lower bound on delay. This work highlights the tradeoffs among these three important properties.",
keywords = "Complex orthogonal designs (CODs), iterative decoding, space-time block codes, transceiver signal linearization",
author = "Adams, {Sarah Spence} and Nathaniel Karst and Murugan, {Mathav Kishore} and Wysocki, {Tadeusz A}",
year = "2011",
month = "6",
day = "1",
doi = "10.1109/TIT.2011.2137050",
language = "English (US)",
volume = "57",
pages = "3618--3621",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - On transceiver signal linearization and the decoding delay of maximum rate complex orthogonal space-time block codes

AU - Adams, Sarah Spence

AU - Karst, Nathaniel

AU - Murugan, Mathav Kishore

AU - Wysocki, Tadeusz A

PY - 2011/6/1

Y1 - 2011/6/1

N2 - Complex orthogonal designs (CODs) have been successfully implemented in wireless systems as complex orthogonal space-time block codes (COSTBCs). Certain properties of the underlying CODs affect the performance of the codes. In addition to the main properties of a COD's rate and decoding delay, a third consideration is whether the COD can achieve transceiver signal linearization, a property that facilitates practical implementation by, for example, significantly simplifying the receiver structure for iterative decoding. It has been shown that a COD can achieve this transceiver signal linearization if the nonzero entries in any given row of the matrix are either all conjugated or all nonconjugated. This paper determines the conditions under which maximum rate CODs can achieve this desirable property. For an odd number of transmit antennas, it is shown that maximum rate CODs that achieve the lower bound on decoding delay can also achieve transceiver signal linearization. In contrast, for an even number of transmit antennas, maximum rate CODs that achieve the lower bound on delay cannot achieve this linearization. In this latter case, linearization is possible only if the COD achieves at least twice the lower bound on delay. This work highlights the tradeoffs among these three important properties.

AB - Complex orthogonal designs (CODs) have been successfully implemented in wireless systems as complex orthogonal space-time block codes (COSTBCs). Certain properties of the underlying CODs affect the performance of the codes. In addition to the main properties of a COD's rate and decoding delay, a third consideration is whether the COD can achieve transceiver signal linearization, a property that facilitates practical implementation by, for example, significantly simplifying the receiver structure for iterative decoding. It has been shown that a COD can achieve this transceiver signal linearization if the nonzero entries in any given row of the matrix are either all conjugated or all nonconjugated. This paper determines the conditions under which maximum rate CODs can achieve this desirable property. For an odd number of transmit antennas, it is shown that maximum rate CODs that achieve the lower bound on decoding delay can also achieve transceiver signal linearization. In contrast, for an even number of transmit antennas, maximum rate CODs that achieve the lower bound on delay cannot achieve this linearization. In this latter case, linearization is possible only if the COD achieves at least twice the lower bound on delay. This work highlights the tradeoffs among these three important properties.

KW - Complex orthogonal designs (CODs)

KW - iterative decoding

KW - space-time block codes

KW - transceiver signal linearization

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

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

U2 - 10.1109/TIT.2011.2137050

DO - 10.1109/TIT.2011.2137050

M3 - Article

AN - SCOPUS:79957655305

VL - 57

SP - 3618

EP - 3621

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

M1 - 5773007

ER -