Reduced complexity algorithms in multistage decoding of multilevel codes

Author

Bobrowski, Ryszard ; Holubowicz, Witold

Author_Institution

Franco-Polish Sch. of New Inf. & Commun. Technol., Poznan, Poland

fYear

1995

fDate

17-22 Sep 1995

Firstpage

67

Abstract

We investigate the applicability of simplified decoders of convolutional codes to the case of multilevel coding. The objective is to examine the use of reduced complexity algorithms for the decoding of multilevel codes combined with multiresolution QAM, as proposed for the terrestrial transmission of HDTV signals in Europe. The main purpose is to see if there is an additional coding gain achievable via the use of the multistage decoders based on the M-algorithm and RSSE approach and if so, how large it is. The analysis is done on the basis of the asymptotic coding gain (minimum distances) and simulation

Keywords

convolutional codes; decoding; high definition television; modulation coding; quadrature amplitude modulation; HDTV signals; M-algorithm; RSSE algorithm; asymptotic coding gain; coding gain; convolutional codes; decoders; minimum distances; multilevel coding; multiresolution QAM; multistage decoders; reduced complexity algorithms; simulation; terrestrial transmission; Analytical models; Bit error rate; Communications technology; Computational modeling; Convolutional codes; Decoding; HDTV; Modulation coding; Quadrature amplitude modulation; Rayleigh channels;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Conference_Location

Whistler, BC

Print_ISBN

0-7803-2453-6

Type

conf

DOI

10.1109/ISIT.1995.531169

Filename

531169