Super-pseudo-orthogonal space-time trellis codes

Author

Zhu, Yun ; Jafarkhani, Hamid

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA

Volume

3

fYear

2006

fDate

3-6 April 2006

Firstpage

1380

Lastpage

1385

Abstract

In this paper, we propose super-pseudo-orthogonal space-time trellis codes. Compared with super-orthogonal space-time trellis codes, the proposed codes provide lower decoding complexity, lower peak-to-average power ratio and better performance. Furthermore, unlike super-quasi-orthogonal space-time trellis codes, it is easy to implement a differential modulation scheme based on the proposed codes when the channel state information is not available at the transmitter and the receiver. Simulation results demonstrate the good performance of our codes

Keywords

computational complexity; decoding; matrix algebra; modulation; pseudonoise codes; space-time codes; trellis codes; channel state information; decoding complexity; differential modulation scheme; peak-to-average power ratio; space-time trellis codes; super-pseudo-orthogonal; super-quasi-orthogonal codes; Block codes; Channel state information; Convolutional codes; Decoding; Fading; Modulation coding; Peak to average power ratio; Receiving antennas; Slot antennas; Transmitting antennas;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Networking Conference, 2006. WCNC 2006. IEEE

Conference_Location

Las Vegas, NV

ISSN

1525-3511

Print_ISBN

1-4244-0269-7

Electronic_ISBN

1525-3511

Type

conf

DOI

10.1109/WCNC.2006.1696488

Filename

1696488