By Topic

Turbo codes for continuous hidden Markov channels with unknown parameters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Garcia-Frias, J. ; Dept. of Electr. & Comput. Eng., Delaware Univ., Newark, DE, USA ; Villasenor, J.D.

We describe parallel concatenated codes for communications over continuous hidden Markov channels. We present three decoding systems that utilize the a priori statistics of the channel and clearly outperform systems based on the traditional approach of using a channel interleaver to create a channel which is assumed to be memoryless. Moreover, for each one of these systems, we develop a joint estimation/decoding method that allows the estimation of the parameters of the model without the need for training sequences. This joint estimation/decoding method involves little or no sacrifice in performance relative to the case where the Markov channel parameters are provided to the receiver as a priori information.

Published in:

Global Telecommunications Conference, 1999. GLOBECOM '99  (Volume:5 )

Date of Conference:

1999