Cart (Loading....) | Create Account
Close category search window

On Symbol Versus Bit Interleaving for Block-Coded Binary Markov Channels

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

3 Author(s)
Al-Lawati, H. ; Dept. of Math. & Stat., Queen''s Univ., Kingston, ON, Canada ; Alajaji, F. ; Pimentel, C.

We examine bit- and symbol-interleaving strategies for linear nonbinary block codes (under bounded-distance decoding) over the family of binary additive noise finite-state Markov channel (FSMC) models with memory. We derive a simple analytical sufficient condition under which perfect (i.e., with infinite interleaving depth) symbol interleaving outperforms perfect bit interleaving in terms of the probability of codeword error (PCE). It is shown that the well-known Gilbert-Elliott channel (GEC) with positive noise-correlation coefficient and the recently introduced Markovian queue-based channel (QBC) of memory M satisfy this condition. This result has widely been illustrated numerically (without proof) in the literature, particularly for the GEC. We also provide examples of binary FSMC models for which the reverse result holds, i.e., perfect bit interleaving outperforming perfect symbol interleaving. Finally, a numerical PCE study of imperfect symbol-interleaved nonbinary codes over the QBC indicates that there is a linear relationship between the optimal interleaving depth and a function of a single parameter of the QBC.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:59 ,  Issue: 5 )

Date of Publication:

Jun 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.