Reduced-search trellis decoding of coded 8-PSK over flat fading channels

Author

Simmons, S.J. ; Ho, S.

Author_Institution

Dept. of Electr. & Comput. Eng., Queen´´s Univ., Kingston, Ont., Canada

fYear

1995

fDate

17-19 May 1995

Firstpage

241

Lastpage

244

Abstract

Families of codes that offer improved time-diversity for fading channel applications have been proposed earlier. Codes with a large number of states offer the best performance, but at the cost of high decoding effort when the Viterbi algorithm is used. In this paper, it is shown that high-diversity codes, combined with single-stage reduced-computation decoders, can offer improved performance compared to Viterbi decoding for a given decoding complexity. In addition, upper bounds have been derived for T-algorithm decoding of these codes over Rayleigh fading channels

Keywords

Rayleigh channels; Viterbi decoding; computational complexity; fading; phase shift keying; trellis coded modulation; Rayleigh fading channels; T-algorithm decoding; Viterbi algorithm; coded 8-PSK; decoding complexity; flat fading channels; performance; reduced-search trellis decoding; single-stage reduced-computation decoders; time-diversity; upper bounds; Application software; Channel state information; Costs; Decoding; Differential quadrature phase shift keying; Fading; High performance computing; Interleaved codes; Upper bound; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Computers, and Signal Processing, 1995. Proceedings., IEEE Pacific Rim Conference on

Conference_Location

Victoria, BC

Print_ISBN

0-7803-2553-2

Type

conf

DOI

10.1109/PACRIM.1995.519452

Filename

519452