The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Finite-state Markov modeling of fading channels - a survey of principles and applications
Abstract
This article's goal is to provide an in-depth understanding of the principles of FSMC modeling of fading channels with its applications in wireless communication systems. While the emphasis is on frequency nonselective or flat-fading channels, this understanding will be useful for future generalizations of FSMC models for frequency-selective fading channels. The target audience of this article include both theory- and practice-oriented researchers who would like to design accurate channel models for evaluating the performance of wireless communication systems in the physical or media access control layers, or those who would like to develop more efficient and reliable transceivers that take advantage of the inherent memory in fading channels. Both FSMC models and flat-fading channels will be formally introduced. FSMC models are particulary suitable to represent and estimate the relatively fast flat-fading channel gain in each subcarrier.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Random variables and stochastic processes
Larson, H. J., & Shubert, B. O. (1979) · Wiley eBooks · Cited by 4,640
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Christopoulos, C., & Wright, A. (1999) · Electrical Power System Protection · doi:10.1007/978-1-4757-5065-2_13 · Cited by 2,748
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
A Statistical Theory of Mobile-Radio Reception
Clarke, R. H. (1968) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1968.tb00069.x · Cited by 2,042
Finite-state Markov channel-a useful model for radio communication channels
Wang, H. S., & Moayeri, N. (1995) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.350282 · Cited by 1,647
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
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
Autoregressive modeling for fading channel simulation
Baddour, K. E., & Beaulieu, N. C. (2005) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2005.850327 · Cited by 617
Simulation-Based Computation of Information Rates for Channels With Memory
Arnold, D. M., Loeliger, H.-A., Vontobel, P. O., Kavcic, A., & Zeng, W. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.878110 · Cited by 563
On verifying the first-order Markovian assumption for a Rayleigh fading channel model
Wang, H. S., & Chang, P.-C. (1996) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.492909 · Cited by 531
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
Capacity of Markov channels with receiver CSI and delayed feedback
Viswanathan, H. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.749027 · Cited by 148
Feedback Capacity of Finite-State Machine Channels
Yang, S., Kavcic, A., & Tatikonda, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.842626 · Cited by 122
A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels
Vontobel, P. O., Kavcic, A., Arnold, D. M., & Loeliger, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.920243 · Cited by 118
Fast simulation of diversity nakagami fading channels using finite-state markov models
Iskander, C.-D., & Mathiopoulos, P. T. (2003) · IEEE Transactions on Broadcasting · doi:10.1109/tbc.2003.817096 · Cited by 98
Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels
Blackwell, D., Breiman, L., & Thomasian, A. J. (1958) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177706452 · Cited by 91
Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel
Eckford, A. W., Kschischang, F. R., & Pasupathy, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856934 · Cited by 79
An equivalent Markov model for burst errors in digital channels
Sivaprakasam, S., & Shanmugan, K. S. (1995) · IEEE Transactions on Communications · doi:10.1109/26.380185 · Cited by 77
On Designing Good LDPC Codes for Markov Channels
Eckford, A. W., Kschischang, F. R., & Pasupathy, S. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.887467 · Cited by 47
Sequence detection and channel state estimation over finite state Markov channels
Kong, H., & Shwedyk, E. (1999) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.765000 · Cited by 42
Cited by
Optimal Energy Allocation for Wireless Communications With Energy Harvesting Constraints
Ho, C. K., & Zhang, R. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2199984 · Cited by 698
Vehicular Communications: A Physical Layer Perspective
Liang, L., Peng, H., Li, G. Y., & Shen, X. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2750903 · Cited by 267
Training-Based Antenna Selection for PER Minimization: A POMDP Approach
Padmanabhan, S., Stephen, R. G., Murthy, C. R., & Coupechoux, M. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2455504 · Cited by 15
Metadata
- Authors
- Sadeghi, P., Kennedy, R., Rapajic, P., & Shams, R.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2008-09
- Volume
- 25
- Issue
- 5
- Pages
- 57-80
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2119683335
- Cited by
- 473
- References
- 26
- FWCI
- 14.94
- 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.