1998
DOI: 10.1109/25.704842
|View full text |Cite
|
Sign up to set email alerts
|

Modeling burst channels using partitioned Fritchman's Markov models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
33
0

Year Published

1998
1998
2009
2009

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 46 publications
(33 citation statements)
references
References 20 publications
0
33
0
Order By: Relevance
“…We define a binary error process , where indicates no symbol error at the th interval and indicates a symbol error. It can be shown that the probability of an error sequence of length , , may be expressed as [4] …”
Section: Channel Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…We define a binary error process , where indicates no symbol error at the th interval and indicates a symbol error. It can be shown that the probability of an error sequence of length , , may be expressed as [4] …”
Section: Channel Modelmentioning
confidence: 99%
“…The FSC model describes the successes and failures of the symbol transmitted over the fading channel, which is represented mathematically as a binary error sequence. The majority of models previously reported in the literature to characterize the symbol-by-symbol dynamics of the error sequence is based on a particular class of hidden Markov models called the simplified Fritchman model [4], [5]. Models based on a finite queue have been proposed recently [28].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In [15] and [16], methods for the parameter estimation of Gilbert's and Fritchman's models are presented, while in [17], [18], [19] and [20] HMMs in general are addressed. New models to describe special error characteristics of (wireless) communication links have been developed up to the present, including a three-state model for Poisson distributed burstlengths [21], a two-state model with segmented exponential distributed burst-and gaplengths [22], two-and three-state Markov models [23] and a finite state Markov channel (FSMC) [24].…”
Section: A Link Error Models -A Literature Surveymentioning
confidence: 99%
“…Progress has been achieved on the statistical and information theoretic modeling of channels with memory (e.g., see [1], [6], [10], [11]), as well as on the design of effective iterative decoders for such channels (e.g., see [2], [3], [7], [8]). However, little is known about the structure of optimal maximum likelihood (ML) decoders for such channels.…”
Section: Introductionmentioning
confidence: 99%