Searching good space-time trellis codes of high complexity

Guixia Kang; Costa Elena; Binghua Qi; Xianglan Jin; Ping Zhang

doi:10.1109/WCNC.2002.993473

Searching good space-time trellis codes of high complexity

Guixia Kang^*
, Costa Elena
, Binghua Qi
, Xianglan Jin
, Ping Zhang

^*Corresponding author for this work

Division of Electronic Engineering

Beijing University of Posts and Telecommunications
Siemens

Research output: Contribution to conference › Conference paper › peer-review

6 Scopus citations

Abstract

This paper discusses some issues in designing space-time trellis codes of high complexity, i.e., when the total number of candidate codes is large or the total number of pairwise error events is large. By adding windows in the search domain and combining the equal states in error state trellis, the complexity of search is greatly reduced. And at the same time, we can still find some codes which have very good performance. We present some new codes of high complexity at the end of this paper and show that our codes have better performance than many codes before.

Original language	English
Title of host publication	IEEE Wireless Communications and Networking Conference, WCNC
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	109-113
Number of pages	5
ISBN (Electronic)	0780373766
DOIs	https://doi.org/10.1109/WCNC.2002.993473
State	Published - 2002
Event	2002 IEEE Wireless Communications and Networking Conference, WCNC 2002 - Orlando, United States Duration: 2002.03.17 → 2002.03.21

Publication series

Name	IEEE Wireless Communications and Networking Conference, WCNC
Volume	1
ISSN (Print)	1525-3511

Conference

Conference	2002 IEEE Wireless Communications and Networking Conference, WCNC 2002
Country/Territory	United States
City	Orlando
Period	02.03.17 → 02.03.21

Access to Document

10.1109/WCNC.2002.993473

Cite this

Kang, G., Elena, C., Qi, B., Jin, X., & Zhang, P. (2002). Searching good space-time trellis codes of high complexity. In IEEE Wireless Communications and Networking Conference, WCNC (pp. 109-113). Article 993473 (IEEE Wireless Communications and Networking Conference, WCNC; Vol. 1). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WCNC.2002.993473

@inproceedings{af63b044aef548eb95381f1a3784ded2,

title = "Searching good space-time trellis codes of high complexity",

abstract = "This paper discusses some issues in designing space-time trellis codes of high complexity, i.e., when the total number of candidate codes is large or the total number of pairwise error events is large. By adding windows in the search domain and combining the equal states in error state trellis, the complexity of search is greatly reduced. And at the same time, we can still find some codes which have very good performance. We present some new codes of high complexity at the end of this paper and show that our codes have better performance than many codes before.",

author = "Guixia Kang and Costa Elena and Binghua Qi and Xianglan Jin and Ping Zhang",

note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; 2002 IEEE Wireless Communications and Networking Conference, WCNC 2002 ; Conference date: 17-03-2002 Through 21-03-2002",

year = "2002",

doi = "10.1109/WCNC.2002.993473",

language = "English",

series = "IEEE Wireless Communications and Networking Conference, WCNC",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "109--113",

booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",

}

Kang, G, Elena, C, Qi, B, Jin, X & Zhang, P 2002, Searching good space-time trellis codes of high complexity. in IEEE Wireless Communications and Networking Conference, WCNC., 993473, IEEE Wireless Communications and Networking Conference, WCNC, vol. 1, Institute of Electrical and Electronics Engineers Inc., pp. 109-113, 2002 IEEE Wireless Communications and Networking Conference, WCNC 2002, Orlando, United States, 02.03.17. https://doi.org/10.1109/WCNC.2002.993473

Searching good space-time trellis codes of high complexity. / Kang, Guixia; Elena, Costa; Qi, Binghua et al.
IEEE Wireless Communications and Networking Conference, WCNC. Institute of Electrical and Electronics Engineers Inc., 2002. p. 109-113 993473 (IEEE Wireless Communications and Networking Conference, WCNC; Vol. 1).

Research output: Contribution to conference › Conference paper › peer-review

TY - GEN

T1 - Searching good space-time trellis codes of high complexity

AU - Kang, Guixia

AU - Elena, Costa

AU - Qi, Binghua

AU - Jin, Xianglan

AU - Zhang, Ping

PY - 2002

Y1 - 2002

N2 - This paper discusses some issues in designing space-time trellis codes of high complexity, i.e., when the total number of candidate codes is large or the total number of pairwise error events is large. By adding windows in the search domain and combining the equal states in error state trellis, the complexity of search is greatly reduced. And at the same time, we can still find some codes which have very good performance. We present some new codes of high complexity at the end of this paper and show that our codes have better performance than many codes before.

AB - This paper discusses some issues in designing space-time trellis codes of high complexity, i.e., when the total number of candidate codes is large or the total number of pairwise error events is large. By adding windows in the search domain and combining the equal states in error state trellis, the complexity of search is greatly reduced. And at the same time, we can still find some codes which have very good performance. We present some new codes of high complexity at the end of this paper and show that our codes have better performance than many codes before.

UR - https://www.scopus.com/pages/publications/84875480983

U2 - 10.1109/WCNC.2002.993473

DO - 10.1109/WCNC.2002.993473

M3 - Conference paper

AN - SCOPUS:84875480983

T3 - IEEE Wireless Communications and Networking Conference, WCNC

SP - 109

EP - 113

BT - IEEE Wireless Communications and Networking Conference, WCNC

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2002 IEEE Wireless Communications and Networking Conference, WCNC 2002

Y2 - 17 March 2002 through 21 March 2002

ER -

Searching good space-time trellis codes of high complexity

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this