Conference Proceeding

When Can Interleaving Be Avoided for Reed-Solomon Coded Binary Markov Channels?

Queen's Univ., Kingston
09/2007; DOI:10.1109/PACRIM.2007.4313290 ISBN: 978-1-4244-1190-0 pp.530 - 533 In proceeding of: Communications, Computers and Signal Processing, 2007. PacRim 2007. IEEE Pacific Rim Conference on
Source: IEEE Xplore

ABSTRACT The performance of Reed-Solomon codes over the binary additive Markov noise channel (BAMNC) is analyzed. A recursive expression for the probability of m error symbols in a block of n symbols is derived using the generating series approach, thus facilitating the exact calculation of the probability of codeword error under bounded distance decoding. An approximation to this probability is obtained, and it is shown to be tight when the noise correlation is not very large. In this case, interleaving the channel at the symbol level can be avoided. Furthermore, a wide range of channel conditions, under which channel interleaving at the bit level can be avoided, is identified.

0 0
·
0 Bookmarks
·
34 Views

Available from

Keywords

approximation

bit level

bounded distance decoding

channel conditions

channel interleaving

codeword error

error symbols

exact calculation

generating series approach

n symbols

Reed-Solomon codes

symbol level

wide range