Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues

Computer Science – Other Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to CAS-I, July 07; 11 pages, 5 figures, 3 tables

Scientific paper

This paper focuses on the design of multiplier-less decimation filters suitable for oversampled digital signals. The aim is twofold. On one hand, it proposes an optimization framework for the design of constituent decimation filters in a general multistage decimation architecture. The basic building blocks embedded in the proposed filters belong, for a simple reason, to the class of cyclotomic polynomials (CPs): the first 104 CPs have a z-transfer function whose coefficients are simply {-1,0,+1}. On the other hand, the paper provides a bunch of useful techniques, most of which stemming from some key properties of CPs, for designing the proposed filters in a variety of architectures. Both recursive and non-recursive architectures are discussed by focusing on a specific decimation filter obtained as a result of the optimization algorithm. Design guidelines are provided with the aim to simplify the design of the constituent decimation filters in the multistage chain.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-449491

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.