Discrete or

This book presents practical techniques of discrete-time control system design. In general, the design techniques lead to low-order dynamic compensators that ensure satisfactory closed-loop performance for a wide range of sampling rates. The theory is given in the form of theorems, lemmas, and propositions. The design of the control systems is presented as step-by-step procedures and algorithms. The proposed feedback control schemes are applied to well-known dynamic system models.

This stimulating textbook/reference presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reader, encouraging further study in this important skill.

This book has two main objectives, the first of which is to extend the power of numerical Fourier analysis and to show by means of theoretical examples and numerous concrete applications that when computing discrete Fourier transforms of periodic and non periodic functions, the usual kernel matrix of the Fourier transform, the discrete Fourier transform (DFT), should be replaced by another kernel matrix, the eXtended Fourier transform (XFT), since the XFT matrix appears as a convergent quadrature of a more general transform, the fractional Fourier transform.

Discrete optimization is an important area of applied mathematics which lies at the intersection of several disciplines and covers both theoretical and practical aspects. This book is the result of a Special Issue entitled ‘Advances and Novel Approaches in Discrete Optimization’. In the call for papers for this issue, I asked for submissions presenting new theoretical results, structural investigations, new models, and algorithmic approaches as well as new applications of discrete optimization problems. Among the possible subjects were integer programming, combinatorial optimization, optimization problems of graphs and networks, scheduling, logistics, and transportation, to name but a few.

This book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a clear distinction between algebraic and analytical properties of formal power series, an introduction to discrete dynamical systems with a thorough description of Sarkovskii’s theorem, symbolic calculus, and a complete description of the Euler-Maclaurin formulas and their applications.

Discrete mathematics has now established its place in most undergraduate mathematics courses. This textbook provides a concise, readable and accessible introduction to a number of topics in this area, such as enumeration, graph theory, Latin squares and designs. It is aimed at second-year undergraduate mathematics students, and provides them with many of the basic techniques, ideas and results. It contains many worked examples, and each chapter ends with a large number of exercises, with hints or solutions provided for most of them. As well as including standard topics such as binomial coefficients, recurrence, the inclusion-exclusion principle, trees, Hamiltonian and Eulerian graphs, Latin squares and finite projective planes, the text also includes material on the ménage problem, magic squares, Catalan and Stirling numbers, and tournament schedules.

Commercial applications of speech processing and recognition are fast becoming a growth industry that will shape the next decade. Now students and practicing engineers of signal processing can find in a single volume the fundamentals essential to understanding this rapidly developing field. IEEE Press is pleased to publish a classic reissue of Discrete-Time Processing of Speech Signals. Specially featured in this reissue is the addition of valuable World Wide Web links to the latest speech data references.