Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Mathematics and Engineering Communications Laboratory
 

Summary: Mathematics and Engineering
Communications Laboratory
Technical Report
Performance of Interleaved Non-Binary Block
Codes Over Binary Channels with Memory
H. Al-Lawati, F. Alajaji, and C. Pimentel
September 2007
1
Performance of Interleaved Non-Binary Block
Codes Over Binary Channels with Memory
Haider Al-Lawati, Fady Alajaji and Cecilio Pimentel
Abstract
The performance of Reed-Solomon codes over two classes of binary channels with memory,
the queue-based channel (QBC) and the Gilbert-Elliott channel (GEC) is analyzed under the
assumption of bounded distance decoding. In particular, we examine two interleaving strate-
gies encountered when dealing with non-binary codes over a binary channel; namely, symbol
interleaving and bit interleaving. An analytical proof is given demonstrating that perfect (i.e.,
with infinite interleaving depth) symbol interleaving results in a better performance compared
to perfect bit interleaving for any non-binary block code over either the QBC or the GEC with
positive noise correlation coefficient. Next, the effect of imperfect interleaving on the code per-

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)
Linder, Tamás - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering