Title :
Improved smart greedy space-time codes for both slow and fast fading channels
Author :
Wu, Gang ; Chen, Ming ; Wang, Haifeng ; Cheng, Shixin
Author_Institution :
Nat. Mobile Commun. Res. Lab., Southeast Univ., Nanjing, China
Abstract :
Smart greedy space-time codes are used to combat both slow and fast Rayleigh fading in wireless communication systems. An improved method to design smart greedy space-time codes is proposed. Firstly, for fast Rayleigh fading, a concise proof of the upper bound on the pairwise error probability of space-time trellis codes is given. Next, based on the upper bound, a practical method of designing smart greedy space-time trellis codes is present. Simulation results show that the code constructions designed by our method have substantial performance gain compared with the old design.
Keywords :
Rayleigh channels; error statistics; radiocommunication; trellis codes; channel coding; code construction; fast Rayleigh fading channels; improved code design; pairwise error probability; simulation results; slow Rayleigh fading channels; smart greedy space-time codes; space-time trellis codes; upper bound; wireless communication systems; Channel coding; Convolutional codes; Design methodology; Fading; Modulation coding; Pairwise error probability; Rayleigh channels; Space time codes; Upper bound; Wireless communication;
Conference_Titel :
Military Communications Conference, 2001. MILCOM 2001. Communications for Network-Centric Operations: Creating the Information Force. IEEE
Print_ISBN :
0-7803-7225-5
DOI :
10.1109/MILCOM.2001.986068