A Markov channel is a discrete information channel that includes as special cases the finite state channels and finite state codes of information theory. Kieffer and Rahe proved that one-sided and two-sided Markov channels have the following property: If the input source to a Markov channel is asymptotically mean stationary (AMS), then so is the resulting input-output process and hence the ergodic theorem and the Shannon-McMillan-Breiman theorem hold for the input-output process. Kieffer and Rahe also provided a sufficient condition for any AMS ergodic source to yield an AMS ergodic input-output process. New conditions for a Markov channel to have this ergodicity property are presented and discussed here. Several relations are developed among various classes of channels, including weakly ergodic, indecomposable, and strongly mixing channels. Some connections between Markov channels and the theory of nonhomogeneous Markov chains are also discussed. G IVEN AN INFORMATION SOURCE (a discretetime random process) and a noisy channel (essentially a regular conditional probability measure describing a probability measure on output sequences given an input sequence), information about the source can be communicated to a receiver by first encoding the source sequence into a channel input sequence and decoding the channel output sequence into a reproduction sequence observed by the receiver. Assume that we have some measure of the quality of the reproduction sequence, that is, how well it approximates the original source sequence. The coding theorems of information theory quantify the theoretically optimum performance that can be achieved using the given source and given channel with any encoder and decoder within some constrained class, where "optimum" means that the system has the minimum possible average distortion. The design algorithms of information theory are methods for actually designing codes that work well, ideally not too badly in comparison with the theoretical optimum. The proofs of coding theorems rest primarily on the ergodic theorem and on the Shannon-McMillan-Breiman theorem. They also generally require that the appropriate sample averages converge to constants and Manuscript
In the present day technology of power semiconductor drives, d.c.-a.c. switch-mode voltage source inverters are widely used in a.c. motor servo drives. In these applications, the motor phase currents need to be controlled for high performance. Thus, the prime control issue is to obtain the switching signals for the inverter switches in order to control/regulate the inverter output current. There are various standard ways to derive the switching signals for the inverter. Undergraduate students of electrical engineering should know these basics and get hands-on experience of the inverter current control techniques while taking a course on Power Electronics and Drives. This paper discusses an efficient way of teaching current control in d.c.-a.c. voltage source inverters by computer simulation studies using the student version of PSpice (Release 9.1). Three standard methods have been demonstrated, i.e., triangular carrier method, hysteresis band method, and periodic sampling method. This paper can be used by students for self-study as well as by instructors for simulation-based laboratory experiments.
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.