DocumentCode
378927
Title
Searching good space-time trellis codes of high complexity
Author
Kang, Guixia ; Elena, Costa ; Qi, Binghua ; Jin, Xianglan ; Zhang, Ping
Author_Institution
Beijing Univ. of Posts & Telecommun., China
Volume
1
fYear
2002
fDate
17-21 Mar 2002
Firstpage
109
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.
Keywords
channel coding; trellis coded modulation; equal states; error state trellis; pairwise error events; performance; search complexity; space-time trellis codes; windows; Convolutional codes; Eigenvalues and eigenfunctions; Fading; Frequency; Hamming distance; Pairwise error probability; Random sequences; Rayleigh channels; Receiving antennas; Transmitting antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Networking Conference, 2002. WCNC2002. 2002 IEEE
Print_ISBN
0-7803-7376-6
Type
conf
DOI
10.1109/WCNC.2002.993473
Filename
993473
Link To Document