This book presents the algebraic fundamentals of switching theory with applications to the field of telecommunications. In addition, applications are described in such areas as multi-processor interconnections, hardware sorting, fast Fourier transform, and convolution decoding. By linking switching theory to industrial practice throughout the book, readers benefit from exposure to more than a pure mathematical treatment. Algebraic Switching Theory and Broadband Applications is unique in its focus on developing an algebraic foundation for switching networks. This focus will be of great value to researchers and distinguishes it from others in the field. Key Features * More than 250 illustrations * Most relevant mathematical tools are all provided * Parallel attention to applications and implemental feasibility throughout * Some applications to parallel computing, multi-processor interconnection, and hardware sorting besides telecommunications * Topics follow a continuous flow, motivate one another, and pin down basic principles, useful techniques, and feasible designs * The book contains a large amount of original results accrued during 1986-99 that have not been previously published

The Algebraic Theory of Switching Circuits covers the application of various algebraic tools to the delineation of the algebraic theory of switching circuits for automation with contacts and relays. This book is organized into five parts encompassing 31 chapters. Part I deals with the principles and application of Boolean algebra and the theory of finite fields (Galois fields). Part II emphasizes the importance of the sequential operation of the automata and the variables associated to the current and to the contacts. This part also tackles the recurrence relations that describe operations of the network and the principles of the so-called characteristic equations. Part III reviews the study of networks with secondary elements other than ordinary relays, while Part IV focuses on the fundamentals and application of multi-position contacts. Part V considers several topics related to circuit with electronic elements, including triodes, pentodes, transistors, and cryotrons. This book will be of great value to practicing engineers, mathematicians, and workers in the field of computers.

The first edition of this book was the first to cover in depth the mathematical theory of nonblocking multistage interconnecting networks, which is applicable to both communication and computer networks. This comprehensively updated new edition not only introduces the classical theory of the fundamental point-to-point network but also has a renewed emphasis on the latest multicast and multirate networks. The book can serve as either a one- or two-semester textbook for graduate students of information science, (electronic) communications, and applied mathematics. In addition, as all the relevant literature is organized and evaluated under one structured framework, the volume is an essential reference for researchers in those areas.

The first edition of this book covered in depth the mathematical theory of nonblocking multistage interconnecting networks, which is applicable to both communication and computer networks. This comprehensively updated version puts more emphasis to the multicast and multirate networks which are under fast development recently due to their wide applications. This comprehensively updated new edition not only introduces the classical theory of the fundamental point-to-point network but also has a renewed emphasis on the latest multicast and multirate networks. The book can serve as either a one- or two-semester textbook for graduate students of information science, (electronic) communications, and applied mathematics. In addition, as all the relevant literature is organized and evaluated under one structured framework, the volume is an essential reference for researchers in those areas.

Modeling Digital Switching Circuits with Linear Algebra describes an approach for modeling digital information and circuitry that is an alternative to Boolean algebra. While the Boolean algebraic model has been wildly successful and is responsible for many advances in modern information technology, the approach described in this book offers new insight and different ways of solving problems. Modeling the bit as a vector instead of a scalar value in the set {0, 1} allows digital circuits to be characterized with transfer functions in the form of a linear transformation matrix. The use of transfer functions is ubiquitous in many areas of engineering and their rich background in linear systems theory and signal processing is easily applied to digital switching circuits with this model. The common tasks of circuit simulation and justification are specific examples of the application of the linear algebraic model and are described in detail. The advantages offered by the new model as compared to traditional methods are emphasized throughout the book. Furthermore, the new approach is easily generalized to other types of information processing circuits such as those based upon multiple-valued or quantum logic; thus providing a unifying mathematical framework common to each of these areas. Modeling Digital Switching Circuits with Linear Algebra provides a blend of theoretical concepts and practical issues involved in implementing the method for circuit design tasks. Data structures are described and are shown to not require any more resources for representing the underlying matrices and vectors than those currently used in modern electronic design automation (EDA) tools based on the Boolean model. Algorithms are described that perform simulation, justification, and other common EDA tasks in an efficient manner that are competitive with conventional design tools. The linear algebraic model can be used to implement common EDA tasks directly upon a structural netlist thus avoiding the intermediate step of transforming a circuit description into a representation of a set of switching functions as is commonly the case when conventional Boolean techniques are used. Implementation results are provided that empirically demonstrate the practicality of the linear algebraic model.

Surveys recent advances in combinatorial properties of switching fabrics Written by an expert in the area of switching fabrics

This book is an evolution from my book A First Course in Information Theory published in 2002 when network coding was still at its infancy. The last few years have witnessed the rapid development of network coding into a research ?eld of its own in information science. With its root in infor- tion theory, network coding has not only brought about a paradigm shift in network communications at large, but also had signi?cant in?uence on such speci?c research ?elds as coding theory, networking, switching, wireless c- munications,distributeddatastorage,cryptography,andoptimizationtheory. While new applications of network coding keep emerging, the fundamental - sults that lay the foundation of the subject are more or less mature. One of the main goals of this book therefore is to present these results in a unifying and coherent manner. While the previous book focused only on information theory for discrete random variables, the current book contains two new chapters on information theory for continuous random variables, namely the chapter on di?erential entropy and the chapter on continuous-valued channels. With these topics included, the book becomes more comprehensive and is more suitable to be used as a textbook for a course in an electrical engineering department.

When you think about how far and fast computer science has progressed in recent years, it's not hard to conclude that a seven-year old handbook may fall a little short of the kind of reference today's computer scientists, software engineers, and IT professionals need. With a broadened scope, more emphasis on applied computing, and more than 70 chap

The uniqueness of this book is that it covers such important aspects of modern signal processing as block transforms from subband filter banks and wavelet transforms from a common unifying standpoint, thus demonstrating the commonality among these decomposition techniques. In addition, it covers such "hot" areas as signal compression and coding, including particular decomposition techniques and tables listing coefficients of subband and wavelet filters and other important properties. The field of this book (Electrical Engineering/Computer Science) is currently booming, which is, of course, evident from the sales of the previous edition. Since the first edition came out there has been much development, especially as far as the applications. Thus, the second edition addresses new developments in applications-related chapters, especially in chapter 4 "Filterbrook Families: Design and Performance," which is greatly expanded. Unified and coherent treatment of orthogonal transforms, subbands, and wavelets Coverage of emerging applications of orthogonal transforms in digital communications and multimedia Duality between analysis and synthesis filter banks for spectral decomposition and synthesis and analysis transmultiplexer structures Time-frequency focus on orthogonal decomposition techniques with applications to FDMA, TDMA, and CDMA

Accessible but rigorous, this outstanding text encompasses all of the topics covered by a typical course in elementary abstract algebra. Its easy-to-read treatment offers an intuitive approach, featuring informal discussions followed by thematically arranged exercises. This second edition features additional exercises to improve student familiarity with applications. 1990 edition.