Fixed-Point Design of Generalized Comb Filters: A Statistical Approach

Computer Science – Other Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

10 pages, 10 figures

Scientific paper

This paper is concerned with the problem of designing computationally efficient Generalized Comb Filters (GCF). Basically, GCF filters are anti-aliasing filters that guarantee superior performance in terms of selectivity and quantization noise rejection compared to classical comb filters, when used as decimation filters in multistage architectures. Upon employing a partial polyphase (PP) architecture proposed in a companion paper, we develop a sensitivity analysis in order to investigate the effects of the coefficients' quantization on the frequency response of the designed filters. We show that the sensitivity of the filter response to errors in the coefficients is dependent on the particular split of the decimation factor between the two sub-filters constituting the PP architecture. The sensitivity analysis is then used for developing a fixed-point implementation of a sample filter from the class of GCF filters, used as reference filter throughout the paper. Finally, we present computer simulations in order to evaluate the performance of the designed fixed-point filters.

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

Fixed-Point Design of Generalized Comb Filters: A Statistical Approach 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 Fixed-Point Design of Generalized Comb Filters: A Statistical Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-Point Design of Generalized Comb Filters: A Statistical Approach will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-580897

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