Performance Comparison of Imperfect Symbol- and Bit-Interleaving of Block Codes Over&amp;gt;tex&amp;lt;$rm GF(2^m)$&amp;gt;/tex&amp;lt;on a Markovian Channel

Sakakibara, Katsumi; Yamakita, Jiro

doi:10.1109/twc.2003.821157

Cited by 3 publications

(14 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The performance is evaluated via the derivation of the probability of m errors in a block of length n, namely, P (m, n), yielding a PCE given by PCE = n m=t+1 P (m, n). For our purposes, we numerically calculate P (m, n) and the PCE using the method of [9]; however, the recent analytical method of [5] can also be used. We consider an (n, k) RS code over GF (2 b ) with codewords of length n and k information symbols.…”

Section: Performance Evaluation Under Imperfect Interleavingmentioning

confidence: 99%

“…It is also known that binary-modulated time-correlated flatfading channels used in conjunction with hard-decision demodulation can be represented by stationary binary (modulo-2) additive noise channels with memory (e.g., see [2] and [3]). When nonbinary codewords are sent over such channels, two interleaving strategies are worth considering [4], [5]: 1) interleaving the code symbols and 2) interleaving the code (or channel) bits, which, under perfect or infinite interleaving depth, reduces the channel to the memoryless binary symmetric channel (BSC) [6].…”

Section: Introductionmentioning

confidence: 99%

“…This result motivated the authors of [8] to consider only symbol interleaving in their investigations. An analytical expression for the PCE of RS codes over binary FSMC models under imperfect bit and symbol interleaving is derived in [5] for two decoding strategies (bounded-distance decoding and error-forecasting decoding). The study conducted in [5] to compare the performance of these two interleaving strategies for the GEC corroborates the superiority of symbol interleaving found in previous numerical studies.…”

Section: Introductionmentioning

confidence: 99%

“…An analytical expression for the PCE of RS codes over binary FSMC models under imperfect bit and symbol interleaving is derived in [5] for two decoding strategies (bounded-distance decoding and error-forecasting decoding). The study conducted in [5] to compare the performance of these two interleaving strategies for the GEC corroborates the superiority of symbol interleaving found in previous numerical studies. However, since there is no known analytical proof in the literature for this result, it is natural to investigate whether perfect symbol interleaving always outperforms perfect bit interleaving for a given class of binary FSMC models or if there exist conditions on the channel parameters under which bit interleaving provides better PCE performance.…”

Section: Introductionmentioning

confidence: 99%

“…Imperfect (i.e., with finite interleaving depth) interleaving is an important issue in practice. In particular, for nonbinary block codes over the GEC, it was found in [5] that perfect interleaving can be realized when the interleaving depth is a multiple of the channel's average burst length (e.g., the typical interleaving depth needed to achieve perfect symbol and bit interleaving is double and four times the average burst length of the GEC, respectively [5]). Another motivation for this work is to verify if a similar result also holds for the QBC.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Al-Lawati

Alajaji

Pimentel

2010

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-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.Index Terms-Additive noise channels, binary finite-state Markov channels (FSMCs), Gilbert-Elliott channel (GEC), Markovian queue-based channel (QBC), Reed-Solomon (RS) and nonbinary block codes, symbol and bit interleaving.

show abstract

Section: Performance Evaluation Under Imperfect Interleavingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Al-Lawati

Alajaji

Pimentel

2010

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

Performance of block‐coded land mobile satellite systems

Lee

2008

Satell Commun Network

View full text Add to dashboard Cite

SUMMARYAlthough various measurements have indicated that mobile satellite channels are not memoryless, most related coded system performance analysis assumes perfect interleaving is in place so that the effect of channel memory can be completely ignored. This paper presents a systematic method to accurately and efficiently predict the performance of errors-and-erasures or errors-only decoders for block-coded systems in general mobile satellite channels. Numerical results are provided to validate our analytic results.

show abstract

Packet-Based Modeling of Reed–Solomon Block-Coded Correlated Fading Channels Via a Markov Finite Queue Model

Pimentel

Alajaji²

2009

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

We consider the transmission of a Reed-Solomon (RS) code over a binary modulated time-correlated flat Rician fading channel with hard-decision demodulation. We define a binary packet (symbol) error sequence that indicates whether an RS symbol is successfully transmitted across the discrete (fading) channel whose input enters the modulator and whose output exits the demodulator. We then approximate the packet error sequence of the discrete channel (DC) using the recently developed queue-based channel (QBC), which is a simple finite-state Markov channel model with M th-order Markovian additive noise. In other words, we use the QBC to model the binary DC at the packet level. We propose a general framework for determining the probability of codeword error (PCE) for QBC models. We evaluate the modeling accuracy by comparing the simulated PCE for the DC with the numerically evaluated PCE for the QBC. Modeling results identify accurate low-order QBC models for a wide range of fading conditions and reveal that modeling the DC at the packet level is an efficient tool for nonbinary coding performance evaluation over binary channels with memory. Index Terms-Burst-noise channels, finite-state Markov channels (FSMCs), packet-error sequence, probability of codeword error (PCE), queue-based channel (QBC), Reed-Solomon (RS) codes, Rician fading. I. INTRODUCTIONT HE DEVELOPMENT of binary additive (first-order) Markov noise channel (BAMNC) models to represent the successes and failures of the transmission of information packets over correlated flat-fading channels was considered in [1]-[4]. In these works, the packet-error (i.e., noise) process is constructed by taking into consideration the packet length, the parameters of the fading channel, the modulation/demodulation/diversity techniques, and the coding/ decoding schemes (if coded transmission is considered).

show abstract

Performance Comparison of Imperfect Symbol- and Bit-Interleaving of Block Codes Over>tex<$rm GF(2^m)$>/tex<on a Markovian Channel

Cited by 3 publications

References 15 publications

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

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

Performance of block‐coded land mobile satellite systems

Packet-Based Modeling of Reed–Solomon Block-Coded Correlated Fading Channels Via a Markov Finite Queue Model

Contact Info

Product

Resources

About