This hands-on guide for circuit designers, technicians, and students discusses digital filter specification and design techniques. The book's coverage begins with a review of filter design fundamentals, complete with all the necessary mathematical background, and proceeds through the theory, operati
Digital Filter Designer's Handbook: With C++ Algorithms [With *]
โ Scribed by C. Britton Rorabaugh
- Leaves
- 331
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Table of Contents
Cover
Contents
List of programs
Ch1: Math review
Ch2: Filter fundamentals
Ch3: Butterworth filters
Ch4: Chebyshev filters
Ch5: Elliptical filters
Ch6: Bessel Filters
Ch7: Fundamentals of DSP
Ch8: Discrete Fourier Transform
Ch9: z Transform
Ch10: FIR filter fundamentals
Ch11: Fourier series method of FIR filter design
Ch12: FIR filter design: frequency sampling method
Ch13: FIR filter design: Remez exchange method
Ch14: IIR filters
Ch15: IIR filters via bilinear transformation
Ch16: Practical considerations
Appendices
Bibliog
Index
end
๐ SIMILAR VOLUMES
This hands-on guide for circuit designers, technicians, and students discusses digital filter specification and design techniques. The book's coverage begins with a review of filter design fundamentals, complete with all the necessary mathematical background, and proceeds through the theory, operati
This hands-on guide for circuit designers, technicians, and students discusses digital filter specification and design techniques. The book's coverage begins with a review of filter design fundamentals, complete with all the necessary mathematical background, and proceeds through the theory, operati
This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would b
This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would b
This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would b