The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Finite-state Markov channel-a useful model for radio communication channels
Abstract
The authors first study the behavior of a finite-state channel where a binary symmetric channel is associated with each state and Markov transitions between states are assumed. Such a channel is referred to as a finite-state Markov channel (FSMC). By partitioning the range of the received signal-to-noise ratio into a finite number of intervals, FSMC models can be constructed for Rayleigh fading channels. A theoretical approach is conducted to show the usefulness of FSMCs compared to that of two-state Gilbert-Elliott channels. The crossover probabilities of the binary symmetric channels associated with its states are calculated. The authors use the second-order statistics of the received SNR to approximate the Markov transition probabilities. The validity and accuracy of the model are confirmed by the state equilibrium equations and computer simulation.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
Microwave Mobile Communications
Jakes, W. C. (1994) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470545287 · Cited by 9,747
Haykin, S. (1988) · Virtual Defense Library (Ministerio de Defensa) · Cited by 3,028
Capacity of a Burst-Noise Channel
Gilbert, E. N. (1960) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1960.tb03959.x · Cited by 2,313
Quantizing for minimum distortion
Max, J. (1960) · IEEE Transactions on Information Theory · doi:10.1109/tit.1960.1057548 · Cited by 2,038
Estimates of error rates for codes on burst-noise channels
Elliott, E. O. (1963) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1963.tb00955.x · Cited by 1,321
The land mobile satellite communication channel-recording, statistics, and channel model
Lutz, E., Cygan, D., Dippold, M., Dolainsky, F., & Papke, W. (1991) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.289418 · Cited by 783
A binary channel characterization using partitioned Markov chains
Fritchman, B. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053975 · Cited by 433
Optimal quantizer design for noisy channels: An approach to combined source - channel coding
Farvardin, N., & Vaishampayan, V. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057373 · Cited by 332
Markov characterization of channels with soft decision outputs
Swarts, F., & Ferreira, H. C. (1993) · IEEE Transactions on Communications · doi:10.1109/26.225482 · Cited by 61
The Comparison of Measured and Calculated Solar Radiations in Trabzon, Turkey
Kaygusuz, K. (1999) · Energy Sources · doi:10.1080/00908319950014830 · Cited by 44
Cited by
Variable-rate variable-power MQAM for fading channels
Goldsmith, A. J., & Chua, S.-G. (1997) · IEEE Transactions on Communications · doi:10.1109/26.634685 · Cited by 2,296
Finite-state Markov model for Rayleigh fading channels
Zhang, Q., & Kassam, S. A. (1999) · IEEE Transactions on Communications · doi:10.1109/26.803503 · Cited by 815
Recent and Emerging Topics in Wireless Industrial Communications: A Selection
Willig, A. (2008) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2008.923194 · Cited by 656
Fair scheduling in wireless packet networks
Lu, S., Bharghavan, V., & Srikant, R. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793003 · Cited by 638
On coding for reliable communication over packet networks
Lun, D. S., Médard, M., Koetter, R., & Effros, M. (2008) · Physical Communication · doi:10.1016/j.phycom.2008.01.006 · Cited by 559
Metadata
- Authors
- Wang, H. S., & Moayeri, N.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 1995-02
- Volume
- 44
- Issue
- 1
- Pages
- 163-171
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2164599584
- Cited by
- 1,647
- References
- 12
- FWCI
- 10.06
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.