Modeling Fading Channels With Binary Erasure Finite-State Markov Channels

Finite-state Markov channels (FSMCs) are commonly used to characterize the memory of binary (binary-input, binary-output) discrete fading channels (DFCs). This paper proposes a new FSMC model, called the ternary Markov channel (TMC), to characterize ternary (binary-input, ternary-output) discrete ch...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on vehicular technology 2017-05, Vol.66 (5), p.4429-4434
Main Authors: Moreira, Igor, Pimentel, Cecilio, Barros, Felipe P., Chaves, Daniel P. B.
Format: Article
Language:English
Subjects:
Block codes
burst noise
Channels
channels with memory
Codes
Correlation
Decoding
erasure channels
error probability
Fading
Fading channels
finite-state Markov channel (FSMC)
generating series
Markov chains
Markov processes
Probability
quantizer
Signal to noise ratio
soft decision
Symbols
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Finite-state Markov channels (FSMCs) are commonly used to characterize the memory of binary (binary-input, binary-output) discrete fading channels (DFCs). This paper proposes a new FSMC model, called the ternary Markov channel (TMC), to characterize ternary (binary-input, ternary-output) discrete channels with memory and soft-information. The TMC is used to model a DFC with the simplest soft-decision quantizer that labels low reliable received symbols as erasure symbols. This paper also proposes an enumerative technique to analytically evaluate the performance of a linear block code over the TMC. A new recurrence expression is developed for calculating the probability of codeword error for bounded distance error and erasure decoding.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2016.2597743