This book is intended for those wishing to acquire a working knowledge of orthogonal transforms in the area of digital signal processing. The authors hope that their introduction will enhance the opportunities for interdiscipli nary work in this field. The book consists of ten chapters. The first seven chapters are devoted to the study of the background, motivation and development of orthogonal transforms, the prerequisites for which are a basic knowledge of Fourier series transform (e.g., via a course in differential equations) and matrix al gebra. The last three chapters are relatively specialized in that they are di rected toward certain applications of orthogonal transforms in digital signal processing. As such, a knowlegde of discrete probability theory is an essential additional prerequisite. A basic knowledge of communication theory would be helpful, although not essential. Much of the material presented here has evolved from graduate level courses offered by the Departments of Electrical Engineering at Kansas State University and the University of Texas at Arlington, during the past five years. With advanced graduate students, all the material was covered in one semester. In the case of first year graduate students, the material in the first seven chapters was covered in one semester. This was followed by a prob lems project-oriented course directed toward specific applications, using the material in the last three chapters as a basis.

Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research. Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions Provides engineers and scientists with a needed reference for the use of Boolean functions in cryptography Addresses the issues of cryptographic Boolean functions theory and applications in one concentrated resource Organized logically to help the reader easily understand the topic

Spectral techniques facilitate the design and testing of today's increasingly complex digital devices There is heightened interest in spectral techniques for the design of digital devices dictated by ever increasing demands on technology that often cannot be met by classical approaches. Spectral methods provide a uniform and consistent theoretic environment for recent achievements in this area, which appear divergent in many other approaches. Spectral Logic and Its Applications for the Design of Digital Devices gives readers a foundation for further exploration of abstract harmonic analysis over finite groups in the analysis, design, and testing of digital devices. After an introduction, this book provides the essential mathematical background for discussing spectral methods. It then delves into spectral logic and its applications, covering: * Walsh, Haar, arithmetic transform, Reed-Muller transform for binary-valued functions and Vilenkin-Chrestenson transform, generalized Haar, and other related transforms for multiple-valued functions * Polynomial expressions and decision diagram representations for switching and multiple-value functions * Spectral analysis of Boolean functions * Spectral synthesis and optimization of combinational and sequential devices * Spectral methods in analysis and synthesis of reliable devices * Spectral techniques for testing computer hardware This is the authoritative reference for computer science and engineering professionals and researchers with an interest in spectral methods of representing discrete functions and related applications in the design and testing of digital devices. It is also an excellent text for graduate students in courses covering spectral logic and its applications.

The book explains the classification of a set of Walsh functions into distinct self-similar groups and subgroups, where the members of each subgroup possess distinct self-similar structures. The observations on self-similarity presented provide valuable clues to tackling the inverse problem of synthesis of phase filters. Self-similarity is observed in the far-field diffraction patterns of the corresponding self-similar filters. Walsh functions form a closed set of orthogonal functions over a prespecified interval, each function taking merely one constant value (either +1 or −1) in each of a finite number of subintervals into which the entire interval is divided. The order of a Walsh function is equal to the number of zero crossings within the interval. Walsh functions are extensively used in communication theory and microwave engineering, as well as in the field of digital signal processing. Walsh filters, derived from the Walsh functions, have opened up new vistas. They take on values, either 0 or π phase, corresponding to +1 or -1 of the Walsh function value.