In late 1950s and early 1960s, Gilbert and Elliott at Bell Labs were modeling burst-noise telephone circuits with a very simple two-state channel model with memory. This simple model allowed them to evaluate channel capacity and error rate performance through bursty wireline telephone circuits. However, it took another 30 years for the so-called Gilbert-Elliott channel (GEC) and its generalized finite-state Markov channel (FSMC) to be applied in the design of second-generation (2G) wireless communication systems. Since the mid 1990s, the GEC and FSMC models have been widely used for modeling wireless flat-fading channels in a variety of applications, ranging from modeling channel error bursts to decoding at the receiver. FSMC models are versatile, and with suitable choices of model parameters, can capture the essence of time-varying fading channels. 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. Digital Object Identifier 10.1109/MSP.2008 [ Parastoo Sadeghi, Rodney A. Kennedy, Predrag B. Rapajic, and Ramtin Shams ] 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. However, a background in time-varying fading communication channels is beneficial.We consider the FSMC modeling of fading channels from five distinct viewpoints. First, we provide a brief history of FSMC models and the FSMC modeling of flat-fading channels. Second, we define the parameters of FSMC models and discuss how these parameters can be derived from flat-fading channel statistics. We point out the trade-offs between model accuracy and complexity. Third, we categorize applications of FSMC models for fading channels into four categories and discuss the FSMC model applicability and accuracy in each application. We pay special attention to the effect of FSMC memory order on the model accuracy. Fourth, we consider the information-theoretical aspects of FSMC models and the FSMC modeling of fading channels. Finally, we present open questions and directions for future research. For easier access to the technical contents, the reader can refer to the "List of Acronyms" and "Notational Conventions." THE HISTORY OF FSMC 1957-1968: DEVELOPMENT OF FSMC MODELSThe study of finite-state communication channels with memory dates back to the work by Shannon in 1957 [1]. In [1], Shannon proved coding theorems for finite-state channels (FSCs) with discret...
Abstract-We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in its possession (or a combination thereof) via a noiseless broadcast channel of capacity one packet per channel use. The goal is to minimize the total number of transmissions needed to satisfy the demands of all the nodes, assuming that they can cooperate with each other and are fully aware of the packet sets available to other nodes. This problem arises in several practical settings, such as peer-to-peer systems and wireless data broadcast. In this paper, we establish upper and lower bounds on the optimal number of transmissions and present an efficient algorithm with provable performance guarantees. The effectiveness of our algorithms is established through numerical simulations.
This lively and accessible book describes the theory and applications of Hilbert spaces and also presents the history of the subject to reveal the ideas behind theorems and the human struggle that led to them. The authors begin by establishing the concept of 'countably infinite', which is central to the proper understanding of separable Hilbert spaces. Fundamental ideas such as convergence, completeness and dense sets are first demonstrated through simple familiar examples and then formalised. Having addressed fundamental topics in Hilbert spaces, the authors then go on to cover the theory of bounded, compact and integral operators at an advanced but accessible level. Finally, the theory is put into action, considering signal processing on the unit sphere, as well as reproducing kernel Hilbert spaces. The text is interspersed with historical comments about central figures in the development of the theory, which helps bring the subject to life.
We study the dimensions or degrees of freedom of farfield multipath that is observed in a limited, source-free region of space. The multipath fields are studied as solutions to the wave equation in an infinite-dimensional vector space. We prove two universal upper bounds on the truncation error of fixed and random multipath fields. A direct consequence of the derived bounds is that both fixed and random multipath fields have an effective finite dimension. For circular and spherical spatial regions, we show that this finite dimension is proportional to the radius and area of the region, respectively. We use the Karhunen-Loeve (KL) expansion of random multipath fields to quantify the notion of multipath richness. The multipath richness is defined as the number of significant eigenvalues in the KL expansion that achieves 99% of the total multipath energy.We prove a lower bound on the largest eigenvalue. This lower bound quantifies, to some extent, the well-known reduction of multipath richness with reducing the angular spread of multipath angular power spectrum. We also provide a numerical algorithm to find multipath eigenvalues, which unlike the Fredholm equation method, does not require selecting quadrature points.
We consider scenarios where wireless clients are missing some packets, but they collectively know every packet. The clients collaborate to exchange missing packets over an error-free broadcast channel with capacity of one packet per channel use. First, we present an algorithm that allows each client to obtain missing packets, with minimum number of transmissions. The algorithm employs random linear coding over a sufficiently large field. Next, we show that the field size can be reduced while maintaining the same number of transmissions. Finally, we establish lower and upper bounds on the minimum number of transmissions that are easily computable and often tight as demonstrated by numerical simulations.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.