08/10/2001 1 High Performance Parallel Implementation of Adaptive Beamforming Using Sinusoidal Dithers High Performance Embedded Computing Workshop Peter.

Slides:



Advertisements
Similar presentations
Chapter 16 Adaptive Filters
Advertisements

Prepared 7/28/2011 by T. O’Neil for 3460:677, Fall 2011, The University of Akron.
Filtering Filtering is one of the most widely used complex signal processing operations The system implementing this operation is called a filter A filter.
Development of Parallel Simulator for Wireless WCDMA Network Hong Zhang Communication lab of HUT.
Lincoln University Canterbury New Zealand Evaluating the Parallel Performance of a Heterogeneous System Elizabeth Post Hendrik Goosen formerly of Department.
Advanced Topics in Algorithms and Data Structures Lecture 6.1 – pg 1 An overview of lecture 6 A parallel search algorithm A parallel merging algorithm.
1/44 1. ZAHRA NAGHSH JULY 2009 BEAM-FORMING 2/44 2.
REAL-TIME INDEPENDENT COMPONENT ANALYSIS IMPLEMENTATION AND APPLICATIONS By MARCOS DE AZAMBUJA TURQUETI FERMILAB May RTC 2010.
Motion Detection And Analysis Michael Knowles Tuesday 13 th January 2004.
3/24/2006Lecture notes for Speech Communications Multi-channel speech enhancement Chunjian Li DICOM, Aalborg University.
Tutorial 5-6 Function Optimization. Line Search. Taylor Series for Rn
CS Pattern Recognition Review of Prerequisites in Math and Statistics Prepared by Li Yang Based on Appendix chapters of Pattern Recognition, 4.
1 Dong Lu, Peter A. Dinda Prescience Laboratory Computer Science Department Northwestern University Virtualized.
September 23, 2010Neural Networks Lecture 6: Perceptron Learning 1 Refresher: Perceptron Training Algorithm Algorithm Perceptron; Start with a randomly.
Math for CSTutorial 5-61 Tutorial 5 Function Optimization. Line Search. Taylor Series for R n Steepest Descent.
Lecture 10: Support Vector Machines
Advanced Topics in Optimization
Why Function Optimization ?
Adaptive Signal Processing
Normalised Least Mean-Square Adaptive Filtering
Dept. E.E./ESAT-STADIUS, KU Leuven homes.esat.kuleuven.be/~moonen/
Implementation of Digital Front End Processing Algorithms with Portability Across Multiple Processing Platforms September 20-21, 2011 John Holland, Jeremy.
Chapter 6 Time dependent reliability of components and system.
Introduction to Adaptive Digital Filters Algorithms
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Introduction SNR Gain Patterns Beam Steering Shading Resources: Wiki:
IDL GUI for Digital Halftoning Final Project for SIMG-726 Computing For Imaging Science Changmeng Liu
1 Design of an SIMD Multimicroprocessor for RCA GaAs Systolic Array Based on 4096 Node Processor Elements Adaptive signal processing is of crucial importance.
Chapter 15 Modeling of Data. Statistics of Data Mean (or average): Variance: Median: a value x j such that half of the data are bigger than it, and half.
Efficient FPGA Implementation of QR
1 Unconstrained Optimization Objective: Find minimum of F(X) where X is a vector of design variables We may know lower and upper bounds for optimum No.
CHAPTER 4 Adaptive Tapped-delay-line Filters Using the Least Squares Adaptive Filtering.
EDGE DETECTION IN COMPUTER VISION SYSTEMS PRESENTATION BY : ATUL CHOPRA JUNE EE-6358 COMPUTER VISION UNIVERSITY OF TEXAS AT ARLINGTON.
Paradyn Project Paradyn / Dyninst Week Madison, Wisconsin April 29-May 3, 2013 Mr. Scan: Efficient Clustering with MRNet and GPUs Evan Samanas and Ben.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
Image Processing Architecture, © 2001, 2002, 2003 Oleh TretiakPage 1 ECE-C490 Image Processing Architecture MP-3 Compression Course Review Oleh Tretiak.
Scalable Multi-core Sonar Beamforming with Computational Process Networks Motivation Sonar beamforming requires significant computation and input/output.
Improving I/O with Compiler-Supported Parallelism Why Should We Care About I/O? Disk access speeds are much slower than processor and memory access speeds.
LEAST MEAN-SQUARE (LMS) ADAPTIVE FILTERING. Steepest Descent The update rule for SD is where or SD is a deterministic algorithm, in the sense that p and.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Derivation Computational Simplifications Stability Lattice Structures.
Halftoning With Pre- Computed Maps Objective Image Quality Measures Halftoning and Objective Quality Measures for Halftoned Images.
Quasi-Newton Methods of Optimization Lecture 2. General Algorithm n A Baseline Scenario Algorithm U (Model algorithm for n- dimensional unconstrained.
Which one? You have a vector, a[ ], of random integers, which can modern CPUs do faster and why? //find max of vector of random ints max=0; for (inda=0;
Beamformer dimensionality ScalarVector Features1 optimal source orientation selected per location. Wrong orientation choice may lead to missed sources.
Professors: Eng. Diego Barral Eng. Mariano Llamedo Soria Julian Bruno
08/10/ NRL Hybrid QR Factorization Algorithm for High Performance Computing Architectures Peter Vouras Naval Research Laboratory Radar Division Professor.
Dongxu Yang, Meng Cao Supervisor: Prabin.  Review of the Beamformer  Realization of the Beamforming Data Independent Beamforming Statistically Optimum.
Philippe Picard 2 nd SKADS Workshop October 2007 Station Processing Philippe Picard Observatoire de Paris Meudon, 11th October 2007.
A New Class of High Performance FFTs Dr. J. Greg Nash Centar ( High Performance Embedded Computing (HPEC) Workshop.
3/12/2013Computer Engg, IIT(BHU)1 INTRODUCTION-1.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
1 VSIPL++: Parallel Performance HPEC 2004 CodeSourcery, LLC September 30, 2004.
1 Design of an MIMD Multimicroprocessor for DSM A Board Which turns PC into a DSM Node Based on the RM Approach 1 The RM approach is essentially a write-through.
High Performance Flexible DSP Infrastructure Based on MPI and VSIPL 7th Annual Workshop on High Performance Embedded Computing MIT Lincoln Laboratory
Spatial vs. Blind Approaches for Speaker Separation: Structural Differences and Beyond Julien Bourgeois RIC/AD.
Motorola presents in collaboration with CNEL Introduction  Motivation: The limitation of traditional narrowband transmission channel  Advantage: Phone.
D Nagesh Kumar, IISc Water Resources Systems Planning and Management: M2L2 Introduction to Optimization (ii) Constrained and Unconstrained Optimization.
Environmental Data Analysis with MatLab 2 nd Edition Lecture 22: Linear Approximations and Non Linear Least Squares.
Department of Computer Science, Johns Hopkins University Lecture 7 Finding Concurrency EN /420 Instructor: Randal Burns 26 February 2014.
Auburn University
Estimation Techniques for High Resolution and Multi-Dimensional Array Signal Processing EMS Group – Fh IIS and TU IL Electronic Measurements and Signal.
Auburn University COMP7330/7336 Advanced Parallel and Distributed Computing Mapping Techniques Dr. Xiao Qin Auburn University.
Motion Detection And Analysis
Chapter 16 Adaptive Filters
Color Error Diffusion with Generalized Optimum Noise Shaping
Analysis of Adaptive Array Algorithm Performance for Satellite Interference Cancellation in Radio Astronomy Lisha Li, Brian D. Jeffs, Andrew Poulsen, and.
Learning Theory Reza Shadmehr
VSIPL++: Parallel Performance HPEC 2004
Neuro-Computing Lecture 2 Single-Layer Perceptrons
Mathematical Foundations of BME
Chapter 6 Time dependent reliability of components and system
Presentation transcript:

08/10/ High Performance Parallel Implementation of Adaptive Beamforming Using Sinusoidal Dithers High Performance Embedded Computing Workshop Peter Vouras and Trac D. Tran Johns Hopkins University September 19, 2007

08/10/ Overview n Gradient Estimation Using Sinusoidal Dithers n Application to Adaptive Beamforming n Parallel Implementation n Results n Conclusion

08/10/ Gradient Estimation Using Dithers n Consider any objective function f(x) where x is an N-by-1 vector. For each component of x, superimpose a sinusoidal dither of different frequency, as in where α is a small scalar. The Taylor series expansion of f(x) yields,

08/10/ Gradient Estimation Using Dithers - 2 n The components of the gradient vector can be determined exactly after we multiply f(x') by cos(ω j t), for j = 1, 2, …, N. The result after using trigonometric identities is, n Note that the only constant term on the right hand side is the jth component of the gradient vector scaled by the factor α/2, and can be recovered exactly by low-pass filtering f(x')cos(ω j t).

08/10/ Dither Application n Dithers can be applied sequentially or in parallel n If applied in parallel, care must be taken to avoid crosstalk between adjacent channels which may corrupt the gradient estimate l Requires high sampling rate, and narrow low pass filter with steep transition regions

08/10/ Advantages of Using Dithers in Adaptive Beamforming PROs n Estimates gradient exactly and results in higher SINR than other recursive algorithms n Very scalable algorithm l Each dither computation is independent of others and can therefore be distributed across parallel processors CONs n Increased computations and FLOP count

08/10/ Brief Overview of Adaptive Beamforming n Linearly Constrained Minimum Variance (LCMV) Beamformer n Minimize output power of an array, y(n) = w H u(n), subject to a set of linear constraints

08/10/ Adaptive Array Configuration With Dithers n Separate dither must be applied to real and imaginary part of each array element weight

08/10/ Adaptive Array Performance Jammer at 44º azimuth

08/10/ Adaptive Array Performance - 2

08/10/ Subarray Architecture For this study, techniques to minimize grating lobes were not considered

08/10/ Software Design MPI Implementation on Cray XD1

08/10/ Measured Results Scalability Speed-Up Load is perfectly balanced

08/10/ Conclusions n Directly estimating the components of the gradient vector using sinusoidal dithers may improve the performance of steepest descent algorithms l Adaptive beamforming n Subarray implementation of adaptive beamformer evaluated on Cray XD1 using parallel processors l Convolution (dot product) and mixing operations may be implemented on FPGAs for further performance improvements