A binary channel characterization using partitioned Markov chains

Authors:
B. Fritchman
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 6

Pushback: A hidden Markov model based scheme for energy efficient data transmission in sensor networks

Ad Hoc Networks
Performance response of wireless channels for quantitatively different loss and arrival statistics

Performance Evaluation
Markov jump linear systems and filtering through network transmitted measurements

Signal Processing
Techniques: Error control in digital satellite networks using retransmission schemes

Computer Communications
Survey: Performance models for wireless channels

Computer Science Review
Cross-Layer Modeling of Wireless Channels: An Overview of Basic Principles

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	754.84

Visualization

Abstract

The characterization of binary communication channels using functions of finite-state Markov chains is considered. Two distributions which are relevant to code evaluation, i.e., the error-free run and error-cluster distributions, are derived. It is shown for anN-state model, partitioned into a group ofkerror-free states andN-kerror states, that the general form of the error-free run distribution is the weighted sum of at mostkexponentials, and that of the error-cluster distribution the weighted sum of at mostN-kexponentials. As evidence of the capability of such models to characterize real communication channels, a simple class of models is investigated and shown experimentally to be capable of representing HF radio statistics.