DFT Filter Banks Steven Liddell Prof. Justin Jonas.

Slides:



Advertisements
Similar presentations
Design of Digital IIR Filter
Advertisements

DFT & FFT Computation.
Decibel values: sum and difference. Sound level summation in dB (1): Incoherent (energetic) sum of two different sounds: Lp 1 = 10 log (p 1 /p rif ) 2.
Frequency analysis.
Michael Phipps Vallary S. Bhopatkar
David Hansen and James Michelussi
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
August 2004Multirate DSP (Part 2/2)1 Multirate DSP Digital Filter Banks Filter Banks and Subband Processing Applications and Advantages Perfect Reconstruction.
ACHIZITIA IN TIMP REAL A SEMNALELOR. Three frames of a sampled time domain signal. The Fast Fourier Transform (FFT) is the heart of the real-time spectrum.
Multistage Implementation Problem: There are cases in which the filter requirements call for a digital filter of high complexity, in terms of number of.
3. Digital Implementation of Mo/Demodulators
Filtering Filtering is one of the most widely used complex signal processing operations The system implementing this operation is called a filter A filter.
Digital Signal Processing – Chapter 11 Introduction to the Design of Discrete Filters Prof. Yasser Mostafa Kadah
Digital Signal Processing
EE4H, M.Sc Computer Vision Dr. Mike Spann
1 Audio Compression Techniques MUMT 611, January 2005 Assignment 2 Paul Kolesnik.
FFT-based filtering and the Short-Time Fourier Transform (STFT) R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2003.
Chapter 15 Digital Signal Processing
Prototype SKA Technologies at Molonglo: 3. Beamformer and Correlator J.D. Bunton Telecommunications and Industrial Physics, CSIRO. Australia. Correlator.
Ninth Synthesis Imaging Summer School Socorro, June 15-22, 2004 Cross Correlators Walter Brisken.
CELLULAR COMMUNICATIONS DSP Intro. Signals: quantization and sampling.
The Nyquist–Shannon Sampling Theorem. Impulse Train  Impulse Train (also known as "Dirac comb") is an infinite series of delta functions with a period.
GallagherP188/MAPLD20041 Accelerating DSP Algorithms Using FPGAs Sean Gallagher DSP Specialist Xilinx Inc.
Representing Acoustic Information
Transition Converter " Supply signals from new antennas to old correlator. " Will be discarded or abandoned in place when old correlator is turned off.
Discrete-Time and System (A Review)
Ni.com Data Analysis: Time and Frequency Domain. ni.com Typical Data Acquisition System.
DIGITAL VOICE NETWORKS ECE 421E Tuesday, October 02, 2012.
Backend electronics for radioastronomy G. Comoretto.
Tamal Bose, Digital Signal and Image Processing © 2004 by John Wiley & Sons, Inc. All rights reserved. Figure 5-1 (p. 321) Decimation by a factor of M.
Computational Technologies for Digital Pulse Compression
Multirate Signal Processing
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
1 Prof. Dr. Nizamettin AYDIN Advanced Digital Signal Processing.
MPEG Audio coders. Motion Pictures Expert Group(MPEG) The coders associated with audio compression part of MPEG standard are called MPEG audio compressor.
Basics of Neural Networks Neural Network Topologies.
Australian Astronomy MNRF Development of Monolithic Microwave Integrated Circuits (MMIC) ATCA Broadband Backend (CABB)
Real time DSP Professors: Eng. Julian S. Bruno Eng. Jerónimo F. Atencio Sr. Lucio Martinez Garbino.
The Correlators ( Spectrometers ) Mopra Induction - May 2005.
Channel Spectral Characteristics Some Polyphase Filter Options.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
Tenth Synthesis Imaging Summer School UNM, June 13-20, 2006 Cross Correlators Walter Brisken.
Frequency Domain Adaptive Filtering Project Supervisor Dr. Edward Jones Myles Ó Fríl.
Digital Signal Processing & Digital Filters
Digital Signal Processing
Software Defined Radio PhD Program on Electrical Engineering Sampling Theory and Quantization José Vieira.
Philippe Picard 2 nd SKADS Workshop October 2007 Station Processing Philippe Picard Observatoire de Paris Meudon, 11th October 2007.
Fourier and Wavelet Transformations Michael J. Watts
Digital Signal Processing
DEPARTMENTT OF ECE TECHNICAL QUIZ-1 AY Sub Code/Name: EC6502/Principles of digital Signal Processing Topic: Unit 1 & Unit 3 Sem/year: V/III.
Professor A G Constantinides 1 Discrete Fourier Transforms Consider finite duration signal Its z-tranform is Evaluate at points on z-plane as We can evaluate.
Fast Fourier Transforms. 2 Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity: –Each DFT coefficient requires.
By Sarita Jondhale 1 Signal preprocessor: “conditions” the speech signal s(n) to new form which is more suitable for the analysis Postprocessor: operate.
M.P. Rupen, Synthesis Imaging Summer School, 18 June Cross Correlators Michael P. Rupen NRAO/Socorro.
EC1358 – DIGITAL SIGNAL PROCESSING
Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.
Real-time Digital Signal Processing Digital Filters.
FP7 Uniboard project Digital Receiver G. Comoretto, A. Russo, G. Tuccari, A Baudry, P. Camino, B. Quertier Dwingeloo, February 27, 2009.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
EEE4176 Applications of Digital Signal Processing
Software Defined Radio PhD Program on Electrical Engineering
ARTIFICIAL NEURAL NETWORKS
FFT-based filtering and the
Fourier and Wavelet Transformations
Multi Carrier Modulation and Channelizers
Digital Control Systems Waseem Gulsher
Interpolation and Pulse Shaping
Green Filters Cascade Polyphase M-to-1 Down Sample Filter, Inner Filter, and Polyphase 1-to-M Up Sample Filter fred harris.
Govt. Polytechnic Dhangar(Fatehabad)
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

DFT Filter Banks Steven Liddell Prof. Justin Jonas

Channelization A common task in radio astronomy is the channelization of a signal onto separate frequency channels. The output signal has a decreased bandwidth so the output sample rate can be decrease multirate systems.

Why Channelise a signal? Allow computation to be performed on a narrower bandwidth and in parallel. Implement the F in an FX correlator. RFI mitigation. Spectrum analysis. Pulsar dedispersion

How to Channelize a Signal Analogue filter banks. Unstable; Would rather use digital signals. Fast Fourier Transform. Fast; Not a great frequency response. Digital filter banks More computation required; Get a good response. Discrete Fourier Transform (DFT) filter banks.

FFT vs Filterbanks FFT has a higher processing loss => decreases the instruments sensitivity.

Computational Costs ≈N/2 log 2 (M) MACsM × N MACs

DFT Filter Banks DFT filter banks arise by modifying the FFT’s windowing function to provide channels with improved stop band attenuation and a narrower transition width. The modified window is based on a prototype filter which lends its frequency response to each channel. Two architectures of DFT looked at.

DFT Filter Banks Polyphase Filter Bank Weighted Overlap Add Filter Bank ≈Mlog 2 (M)+N MACs

The Polyphase Filter Bank Replace a FFT’s window with a set of polyphase filters. Create polyphase filters from a prototype filter: Prototype filter Polyphase filters (p ρ (n))

Prototype filter copied onto each channel.

Aliasing Critically sampled (output data rate 1/16 input data rate) Over Sampled (output data rate >1/16 input data rate)

Wola Filter Bank The Weighted Overlap and Add filter bank. Mathematically identical to polyphase filter. Implementation different decouple number of channels from sample rate change factor.

WOLA Filter Bank WeightedOverlapAdd :

Fixed point arithmetic leads to a errors in the system. Quantization error can be modelled as noise injected at a multiplier. Error occurs in both the FIR and FFT so need to balance the number of bits.

Fixed point error in the filter coefficients change the channels’ frequency response.

Efficient through use of FFT but with good frequency response. Easily implemented in parallel hardware. Inherent sample rate change. Replacing the stand alone FFT in signal paths requiring high accuracy channelization.