DOCSLIB.ORG

A Real-Time Variable Resolution Chirp Z-Transform

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Real-Time Variable Resolution Chirp Z-Transform Rochester Institute of Technology RIT Scholar Works Theses 7-1-2007 A real-time variable resolution Chirp z-Transform Christopher Felder Follow this and additional works at: https://scholarworks.rit.edu/theses Recommended Citation Felder, Christopher, "A real-time variable resolution Chirp z-Transform" (2007). Thesis. Rochester Institute of Technology. Accessed from This Thesis is brought to you for free and open access by RIT Scholar Works. It has been accepted for inclusion in Theses by an authorized administrator of RIT Scholar Works. For more information, please contact [email protected]. A Real-Time Variable Resolution Chirp z-Transform by Christopher E. Felder A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Engineering Supervised by Dr. Juan C. Cockburn Department of Computer Engineering Kate Gleason College of Engineering Rochester Institute of Technology Rochester, NY July 2007 Approved By: Dr. Juan C. Cockburn Primary Advisor - R.I. T. Dept. of Computer Engineering Dr. Marcin Lukowiak Secondary Advisor - R.I. T. Dept. of Computer Engineering Dr. Raymond Ptucha Secondary Advisor - R.1. T. Dept. of Computer Engineering Thesis Release Permission Form Rochester Institute of Technology Kate Gleason College of Engineering Title: A Real-Time Variable Resolution Chirp z-Transform I, Christopher E. Felder, hereby grant permission to the Wallace Memorial Library to reproduce my thesis in whole or part. Christopher E. Felder Date Felder A Real -Time Variable Resolution Chirp z-Transform 2 Acknowledgements The author would like to thank the following for their contributions to this work: Juan Cockburn Marcin Lukowiak Raymond Ptucha Andreas Savakis Marty Grove Allen Montijo Felder A Real-Time Variable Resolution Chirp z-Transform Abstract An algorithm is introduced which performs real time, high-resolution Fourier transforms of large amounts of input data over an adjustable output band. The algorithm combines recent Fast Fourier and Chirp z-Transform developments to segment input data and boost output spectrum resolution. The target application is in test and measurement, where large numbers of input samples must be processed in real time, and a given frequency range of interest is usually involved. Because the application often runs on embedded hardware with limited resources, the algorithm dynamically attempts to optimize performance for available memory. Results are evaluated on hardware and resource requirements for achieving high resolution and real time operation. The feasibility of the algorithm's implementation in DSP hardware due to these requirements is discussed, along with its usefulness based on performance. Felder A Real-Time Variable Resolution Chirp z-Transform Table of Contents Acknowledgements 3 Abstract 4 List of Figures 6 List of Tables 7 Glossary 8 Background 9 a. Discrete Fourier Transform 9 b. Fast Fourier Transform 10 Definition 10 Algorithms 11 Programming Considerations 11 c. Chirp z-Transform 13 d. Interlaced Chirp z-Transform 15 e. Segmented Chirp z-Transform 17 II. Proposed Algorithm 19 a. Overview 19 b. Implementation 21 c. Test Program Implementation 28 III. Results 29 a. Test Data Sets 29 b. Test Environment 33 c. Resource Requirements 33 d. Algorithm Performance 37 i. Foundation Algorithms 37 ii. Data Set 1 40 iii. Data Set 2 43 iv. Data Set 3 44 v. Data Set 4 45 vi. Data Set 5 46 IV. Conclusions and Future Work 48 Biblography 50 Appendix A - Data Set Result Plots 52 a. Data Set 1 Result Plots 52 b. Data Set 2 Result Plots 56 c. Data Set 3 Result Plots 57 d. Data Set 4 Result Plots 58 e. Data Set 5 Result Plots 60 Felder A Real-Time Variable Resolution Chirp z-Transform List of Figures Page Figure Number Description 1 16 Interlaced CZT procedure, skipping two samples each step (g=2). 2 17 Segmentation of a periodic input signal. 3 20 The proposed algorithm. 4 21 Oshana's FFT algorithm function stub. 5 22 Ooura's FFT algorithm function stub. 6 23 Chirp z-Transform function stubs. 7 23 The Segmented CZT function stub (for testing and analysis purposes). 8 24 The Interlaced CZT function stub. 9 25 Interlaced CZT return value struct and helper functions. SCZT" 10 26 The "interlaced function. 11 27 The proposed algorithm's structure and flow. 12 28 Constants. h flags. 13 29 Data set input samples. 14 30 Data set 1. 15 31 Data set 2. 16 31 Data set 3. 17 32 Data set 4. 18 32 Data set 5. 19 34 CZT memory usage, N=256. 20 34 CZT memory usage, M=1024. 21 35 SCZT memory usage, M=1024. 22 36 iCZT memory usage, 10 interlacing steps. 23 36 iCZT memory usage, g=16. 24 37 FFT algorithm performance, data set 1. 25 37 FFT algorithm performance. 26 38 CZT algorithm performance. 27 39 Segmented CZT performance. 28 39 Interlaced CZT performance. 29 40 Interlaced CZT performance. 30 41 Data set 1 run 3 algorithm progression. 31 41 Data set 1 run 1 algorithm progression, segment size=32. 32 42 Data set 1 results for M values, Mem=1024B. 33 42 Data set 1 results for Mem values, M=256. 34 43 Data set 2 results for M values, Mem=65535B, Target=4.5-5.5Hz. 35 44 Data set 2 results for Mem values, M=1024, Target=0.9-l.lHz. 36 45 Data set comparison, N=65535, M=1024. 37 46 Data set 4 windowing performance. 38 47 Data set 5 run 6 algorithm progression. 39 47 Data set 5 performance for segment sizes, M=4096. Felder A Real-Time Variable Resolution Chirp z-Transform List of Tables Page Table Number Description 1 27 Thesis input arguments. 2 29 Test data sets. 3 33 Development and test machine specifications. 4 40 Data set 1 results. 5 43 Data set 2 results. 6 44 Data set 3 results. 7 45 Data set 4 results. 8 46 Data set 5 results. Felder A Real-Time Variable Resolution Chirp z-Transform Glossary Chirp z-Transform Computes DFTs of arbitrary sizes using a convolution. CZT See Chirp z-Transform. DFT See Discrete Fourier Transform. Discrete Fourier Transform Converts discrete time-domain signals to the frequency domain. 2n Fast Fourier Transform An efficient algorithm for computing the DFT, usually requiring input samples. FFT See Fast Fourier Transform. iCZT The Interlaced Chirp z-Transform algorithm. IFFT Inverse Fast Fourier Transform. Interlacing Insertion of samples at intervals such that resolution is increased. Leakage Signal energy at frequencies that do not exist in the original waveform. Sample Rate The frequency at which samples are taken. SCZT The Segmented Chirp z-Transform algorithm. Segmentation Division of data into pieces ("segments") of equal size. Spectrum A range of frequencies. Windowing Application of a function to input data to reduce leakage. Felder A Real-Time Variable Resolution Chirp z-Transform Chapter 1 Background a. Discrete Fourier Transform The frequency spectrum of a continuous signal in time is given by the Fourier transform (FT), or Fourier integral, defined as ..co e~iwt X(co) = x(t) dt (1) J CO where x(t) is a time signal and X(oj) is a function of angular frequency for the spectrum [18]. If the input signal is discrete in time, the discrete Fourier transform (DFT) is used instead, typically defined as w-i Z.Znnk.2nnk (2) n=0 where x(n) is a sequence of N samples, and X(k) is an N-point discrete frequency spectrum, ranging from zero to half the sampling frequency. Oftentimes, the DFT is written for convenience as w-i .271 Wnk > = W = e n X(k) V x(n) , (3) n=0 This W term is often used in Fourier equations. Note that the Fourier transforms in Equations 1-3 involve complex numbers; specifically, a straightforward DFT computation requires 0(N2) complex addition and multiplication operations. Felder A Real-Time Variable Resolution Chirp z-Transform b. Fast Fourier Transform i. Definition In 1965, Cooley and Tukey introduced the now popular fast Fourier transform (FFT), reducing the number of computations required (and associated rounding error) to 0(N-log2N) [1]. For a large data set of N = 1 Megapoints, for example, the number of complex operations is reduced from 1E12 to 2E7 operations. This advance has been quite significant in its contributions to developments in signal Algorithms" processing; Computing in Science & Engineering included the FFT in its "Top 10 issue, stating that "the FFT is perhaps the most ubiquitous algorithm used today to analyze and manipulate digital or discrete data," [2]. time," Cooley and Tukey's FFT algorithm is typically called "decimation in and begins with the N=2n observation that samples, XN can be divided into even and odd sets of terms, written Yk %2k k = 0,1, 1 (4) ?k = %2k+l The DFT of these two sequences of N/2 points, are therefore Anrk J A(k)m = X> Yke n k=0 r = 0,l --1 (5) Anrk J B(k)=m = X> Zke n k=0 The DFT of XN, expressed in terms of the split sequence DFTs in (5), can be written $-1 r Anrk + '- l) 3 = (6) X{k)= ^ Yke n +Zke N r 0, 1, 1 k=0 ^- ZAnrk ,2jrr 1 Anrk ,-.. Yke~J~N~ + e~J^T ) Zke~J~*T V) k=0 k=0 Substituting A(k) and B(k) from (5), we have 277T /V ' X(k) = A(k) + e n B(k), 0 < r < - (8) Felder A Real-Time Variable Resolution Chirp z-Transform 10 Finally, due to the periodic nature of the DFT for values of r > N/2, (8) can be rewritten using (3) as X(k) =A(k) + WrB(k) Xlk + 0<r<- (9) -) =A(k)-WB(k) 2n two- Because the input signal contains points, this decomposition can be carried out n times until a point function is obtained; this is referred to as a radix-2 FFT algorithm, and can be visually represented "butterfly" with what is known as an FFT diagram [1].
Load more

Recommended publications
  • Bring Down the Two-Language Barrier with Julia Language for Efficient
    AbstractSDRs: Bring down the two-language barrier with Julia Language for efficient SDR prototyping Corentin Lavaud, Robin Gerzaguet, Matthieu Gautier, Olivier Berder To cite this version: Corentin Lavaud, Robin Gerzaguet, Matthieu Gautier, Olivier Berder. AbstractSDRs: Bring down the two-language barrier with Julia Language for efficient SDR prototyping. IEEE Embedded Systems Letters, Institute of Electrical and Electronics Engineers, 2021, pp.1-1. 10.1109/LES.2021.3054174. hal-03122623 HAL Id: hal-03122623 https://hal.archives-ouvertes.fr/hal-03122623 Submitted on 27 Jan 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. AbstractSDRs: Bring down the two-language barrier with Julia Language for efficient SDR prototyping Corentin LAVAUD∗, Robin GERZAGUET∗, Matthieu GAUTIER∗, Olivier BERDER∗. ∗ Univ Rennes, CNRS, IRISA, [email protected] Abstract—This paper proposes a new methodology based glue interface [8]. Regarding programming semantic, low- on the recently proposed Julia language for efficient Software level languages (e.g. C++/C, Rust) offers very good runtime Defined Radio (SDR) prototyping. SDRs are immensely popular performance but does not offer a good prototyping experience. as they allow to have a flexible approach for sounding, monitoring or processing radio signals through the use of generic analog High-level languages (e.g.
    [Show full text]
  • SEISGAMA: a Free C# Based Seismic Data Processing Software Platform
    Hindawi International Journal of Geophysics Volume 2018, Article ID 2913591, 8 pages https://doi.org/10.1155/2018/2913591 Research Article SEISGAMA: A Free C# Based Seismic Data Processing Software Platform Theodosius Marwan Irnaka, Wahyudi Wahyudi, Eddy Hartantyo, Adien Akhmad Mufaqih, Ade Anggraini, and Wiwit Suryanto Seismology Research Group, Physics Department, Faculty of Mathematics and Natural Sciences, Universitas Gadjah Mada, Sekip Utara Bulaksumur, Yogyakarta 55281, Indonesia Correspondence should be addressed to Wiwit Suryanto; [email protected] Received 4 July 2017; Accepted 24 December 2017; Published 30 January 2018 Academic Editor: Filippos Vallianatos Copyright © 2018 Teodosius Marwan Irnaka et al. Tis is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Seismic refection is one of the most popular methods in geophysical prospecting. Nevertheless, obtaining high resolution and accurate results requires a sophisticated processing stage. Tere are many open-source seismic refection data processing sofware programs available; however, they ofen use a high-level programming language that decreases its overall performance, lacks intuitive user-interfaces, and is limited to a small set of tasks. Tese shortcomings reveal the need to develop new sofware using a programming language that is natively supported by Windows5 operating systems, which uses a relatively medium-level programming language (such as C#) and can be enhanced by an intuitive user interface. SEISGAMA was designed to address this need and employs a modular concept, where each processing group is combined into one module to ensure continuous and easy development and documentation.
    [Show full text]
  • Julia: a Modern Language for Modern ML
    Julia: A modern language for modern ML Dr. Viral Shah and Dr. Simon Byrne www.juliacomputing.com What we do: Modernize Technical Computing Today’s technical computing landscape: • Develop new learning algorithms • Run them in parallel on large datasets • Leverage accelerators like GPUs, Xeon Phis • Embed into intelligent products “Business as usual” will simply not do! General Micro-benchmarks: Julia performs almost as fast as C • 10X faster than Python • 100X faster than R & MATLAB Performance benchmark relative to C. A value of 1 means as fast as C. Lower values are better. A real application: Gillespie simulations in systems biology 745x faster than R • Gillespie simulations are used in the field of drug discovery. • Also used for simulations of epidemiological models to study disease propagation • Julia package (Gillespie.jl) is the state of the art in Gillespie simulations • https://github.com/openjournals/joss- papers/blob/master/joss.00042/10.21105.joss.00042.pdf Implementation Time per simulation (ms) R (GillespieSSA) 894.25 R (handcoded) 1087.94 Rcpp (handcoded) 1.31 Julia (Gillespie.jl) 3.99 Julia (Gillespie.jl, passing object) 1.78 Julia (handcoded) 1.2 Those who convert ideas to products fastest will win Computer Quants develop Scientists prepare algorithms The last 25 years for production (Python, R, SAS, DEPLOY (C++, C#, Java) Matlab) Quants and Computer Compress the Scientists DEPLOY innovation cycle collaborate on one platform - JULIA with Julia Julia offers competitive advantages to its users Julia is poised to become one of the Thank you for Julia. Yo u ' v e k i n d l ed leading tools deployed by developers serious excitement.
    [Show full text]
  • Praktikum Iz Softverskih Alata U Elektronici
    PRAKTIKUM IZ SOFTVERSKIH ALATA U ELEKTRONICI 2017/2018 Predrag Pejović 31. decembar 2017 Linkovi na primere: I OS I LATEX 1 I LATEX 2 I LATEX 3 I GNU Octave I gnuplot I Maxima I Python 1 I Python 2 I PyLab I SymPy PRAKTIKUM IZ SOFTVERSKIH ALATA U ELEKTRONICI 2017 Lica (i ostali podaci o predmetu): I Predrag Pejović, [email protected], 102 levo, http://tnt.etf.rs/~peja I Strahinja Janković I sajt: http://tnt.etf.rs/~oe4sae I cilj: savladavanje niza programa koji se koriste za svakodnevne poslove u elektronici (i ne samo elektronici . ) I svi programi koji će biti obrađivani su slobodan softver (free software), legalno možete da ih koristite (i ne samo to) gde hoćete, kako hoćete, za šta hoćete, koliko hoćete, na kom računaru hoćete . I literatura . sve sa www, legalno, besplatno! I zašto svake godine (pomalo) updated slajdovi? Prezentacije predmeta I engleski I srpski, kraća verzija I engleski, prezentacija i animacije I srpski, prezentacija i animacije A šta se tačno radi u predmetu, koji programi? 1. uvod (upravo slušate): organizacija nastave + (FS: tehnička, ekonomska i pravna pitanja, kako to uopšte postoji?) (≈ 1 w) 2. operativni sistem (GNU/Linux, Ubuntu), komandna linija (!), shell scripts, . (≈ 1 w) 3. nastavak OS, snalaženje, neki IDE kao ilustracija i vežba, jedan Python i jedan C program . (≈ 1 w) 4.L ATEX i LATEX 2" (≈ 3 w) 5. XCircuit (≈ 1 w) 6. probni kolokvijum . (= 1 w) 7. prvi kolokvijum . 8. GNU Octave (≈ 1 w) 9. gnuplot (≈ (1 + ) w) 10. wxMaxima (≈ 1 w) 11. drugi kolokvijum . 12. Python, IPython, PyLab, SymPy (≈ 3 w) 13.
    [Show full text]
  • Introduction to Matlab
    Introduction to Numerical Libraries Shaohao Chen High performance computing @ Louisiana State University Outline 1. Introduction: why numerical libraries? 2. Fast Fourier transform: FFTw 3. Linear algebra libraries: LAPACK 4. Krylov subspace solver: PETSc 5. GNU scientific libraries: GSL 1. Introduction It is very easy to write bad code! • Loops : branching, dependencies • I/O : resource conflicts, • Memory : long fetch-time • Portability : code and data portable? • Readability : Can you still understand it? A solution: look for existing libraries! Why numerical libraries? • Many functions or subroutines you need may have already been coded by others. Just use them. • Not necessary to code every line by yourself. • Check available libs before starting to write your program. • Save your time and efforts! Advantages of using numerical libraries: • Computing optimizations • Portability • Easy to debug • Easy to read What you will learn in this training • General knowledge of numerical libs. • How to check available libs on HPC systems and the web. • How to use numerical libs on HPC systems. • Basic programming with numerical libs. List of notable numerical libraries • Linear Algebra Package (LAPACK): computes matrix and vector operations. [Fortran] • Fastest Fourier Transform in the West (FFTW): computes Fourier and related transforms. [C/C++] • GNU Scientific Library (GSL): provides a wide range of mathematical routines. [C/C++] • Portable, Extensible Toolkit for Scientific Computation (PETSc): a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations. [C/C++] • NumPy: adds support for the manipulation of large, multi-dimensional arrays and matrices; also includes a large collection of high-level mathematical functions.
    [Show full text]
  • Fastest Fourier Transform in the West
    Fastest Fourier Transform in the West Devendra Ghate and Nachi Gupta [email protected], [email protected] Oxford University Computing Laboratory MT 2006 Internal Seminar – p. 1/33 Cooley-Tukey Algorithm for FFT N 1 2πi − nk Xk = X xne− N ; k = 0; : : : ; N − 1 n=0 2 If we solve for Xk directly then O(N ) operations required for the solution. If N = p × q, then this transformation can be split into two separate transformations... ...recursively, we get the FFT algorithm. N If N is split into r intervals of r each then the complexity is r × N × logr N. This can be generalised to mixed-radix algorithms. MT 2006 Internal Seminar – p. 2/33 Overview of FFT algorithms Cooley-Tukey FFT algorithm (popularized in 1965), known by Gauss in 1805. Prime-factor FFT algorithm ± a.k.a. Good-Thomas (1958-1963), N = N1N2 becomes 2D N1 by N2 DFT for only relatively prime N1; N2. Bruun's FFT algorithm (1978, generalized to arbitrary even composite sizes by H. Murakami in 1996), recursive polynomial factorization approach. Rader's FFT algorithm (1968), for prime size by expressing DFT as a convolution. Bluestein's FFT algorithm (1968) ± a.k.a. chirp z-transform algorithm (1969), for prime sizes by expressing DFT as a convolution. Rader-Brenner (1976) ± Cooley-Tukey like, but purely imag twiddle factors MT 2006 Internal Seminar – p. 3/33 What is FFTW? FFTW is a package for computing a one or multidimensional complex discrete Fourier transform (DFT) of arbitrary size. At the heart of FFTW lies a philosophy geared towards speed, portability, and elegance – achieved via an adaptive software architecture.
    [Show full text]
  • A New Set of Efficient SMP-Parallel 2D Fourier Subroutines
    Graphical Abstract A new set of efficient SMP-parallel 2D Fourier subroutines Alexander O. Korotkevich 60000 new lib FFTW 50000 40000 30000 MFLOPs 20000 10000 0 0 5 10 15 20 25 30 35 40 45 50 Threads arXiv:2008.07031v1 [physics.comp-ph] 17 Aug 2020 Highlights A new set of efficient SMP-parallel 2D Fourier subroutines Alexander O. Korotkevich • New set of efficient SMP-parallel DFTs • Free software license • Significant performance boost for large sizes of arrays. A new set of efficient SMP-parallel 2D Fourier subroutines Alexander O. Korotkevicha,b aDepartment of Mathematics & Statistics, The University of New Mexico, MSC01 1115, 1 University of New Mexico, Albuquerque, New Mexico, 87131-0001, USA bL. D. Landau Institute for Theoretical Physics, 2 Kosygin Str., Moscow, 119334, Russian Federation Abstract Extensive set of tests on different platforms indicated that there is a per- formance drop of current standard de facto software library for the Dis- crete Fourier Transform (DFT) in case of large 2D array sizes (larger than 16384 × 16384). Parallel performance for Symmetric Multi Processor (SMP) systems was seriously affected. The remedy for this problem was proposed and implemented as a software library for 2D out of place complex to complex DFTs. Proposed library was thoroughly tested on different available architec- tures and hardware configurations and demonstrated significant (38 − 94%) performance boost on vast majority of them. The new library together with the testing suite and results of all tests is published as a project on GitHub.com platform under free software license (GNU GPL v3). Com- prehensive description of programming interface as well as provided testing programs is given.
    [Show full text]
  • 2019 Julia User & Developer Survey
    User & Developer Survey 2019 Viral B. Shah Andrew Claster Abhijith Chandraprabhu Methodology We conducted 1,834 interviews online among Julia users and developers June 12-24, 2019 Margin of error is +/- 2.3 percentage points We recruited respondents online using Slack, Discourse, Twitter, email, JuliaLang.org and JuliaComputing.com The survey was administered only in English, but more than half of respondents come from non-English speaking countries 2 56% of Respondents Use Julia a ‘Great Deal’ While 38% Use Julia ‘Some’ Python and Bash/Shell/PowerShell are 2nd and 3rd among Julia Users and Developers How frequently do you use each of the following languages? Great deal Some Julia 56% 38% 94% Python 39% 42% 81% Bash/Shell/PowerShell 23% 46% 69% MATLAB 16% 27% 43% C++ 11% 29% 40% C 8% 32% 40% R 15% 23% 38% SQL 11% 23% 34% JavaScript 6% 21% 27% Java 5% 13% 18% C# 2% 6% 8% Scala 1%5 % 6% 3 93% of Respondents Like Julia or Say Julia Is One of Their Favorite Languages Python Comes Second Among Julia Users and Developers How much do you like each of the following languages? One of my favorite languages Like Julia 73% 20% 93% Python 26% 35% 61% C 6% 21% 27% R 9% 14% 23% Matlab 8% 15% 23% C++ 6% 17% 23% Bash/Shell/PowerShell 4% 18% 22% SQL 3% 13% 16% JavaScript 2% 9% 11% Java 2% 8% 10% C# 2% 7% 9% Scala 2% 5% 7% 4 The MOST Popular TECHNICAL Features of Julia Are Speed/Performance, Ease of Use, Open Source, Multiple Dispatch and Solving the Two Language Problem Thinking only about the TECHNICAL aspects or features of Julia, what are the TECHNICAL
    [Show full text]
  • Pipenightdreams Osgcal-Doc Mumudvb Mpg123-Alsa Tbb
    pipenightdreams osgcal-doc mumudvb mpg123-alsa tbb-examples libgammu4-dbg gcc-4.1-doc snort-rules-default davical cutmp3 libevolution5.0-cil aspell-am python-gobject-doc openoffice.org-l10n-mn libc6-xen xserver-xorg trophy-data t38modem pioneers-console libnb-platform10-java libgtkglext1-ruby libboost-wave1.39-dev drgenius bfbtester libchromexvmcpro1 isdnutils-xtools ubuntuone-client openoffice.org2-math openoffice.org-l10n-lt lsb-cxx-ia32 kdeartwork-emoticons-kde4 wmpuzzle trafshow python-plplot lx-gdb link-monitor-applet libscm-dev liblog-agent-logger-perl libccrtp-doc libclass-throwable-perl kde-i18n-csb jack-jconv hamradio-menus coinor-libvol-doc msx-emulator bitbake nabi language-pack-gnome-zh libpaperg popularity-contest xracer-tools xfont-nexus opendrim-lmp-baseserver libvorbisfile-ruby liblinebreak-doc libgfcui-2.0-0c2a-dbg libblacs-mpi-dev dict-freedict-spa-eng blender-ogrexml aspell-da x11-apps openoffice.org-l10n-lv openoffice.org-l10n-nl pnmtopng libodbcinstq1 libhsqldb-java-doc libmono-addins-gui0.2-cil sg3-utils linux-backports-modules-alsa-2.6.31-19-generic yorick-yeti-gsl python-pymssql plasma-widget-cpuload mcpp gpsim-lcd cl-csv libhtml-clean-perl asterisk-dbg apt-dater-dbg libgnome-mag1-dev language-pack-gnome-yo python-crypto svn-autoreleasedeb sugar-terminal-activity mii-diag maria-doc libplexus-component-api-java-doc libhugs-hgl-bundled libchipcard-libgwenhywfar47-plugins libghc6-random-dev freefem3d ezmlm cakephp-scripts aspell-ar ara-byte not+sparc openoffice.org-l10n-nn linux-backports-modules-karmic-generic-pae
    [Show full text]
  • FFTW User's Manual
    FFTW User's Manual For version 2.1.5, 16 March 2003 Matteo Frigo Steven G. Johnson Copyright c 1997{1999 Massachusetts Institute of Technology. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the con- ditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another lan- guage, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Free Software Foundation. i Table of Contents 1 Introduction............................... 1 2 Tutorial ................................... 3 2.1 Complex One-dimensional Transforms Tutorial ............ 3 2.2 Complex Multi-dimensional Transforms Tutorial ........... 4 2.3 Real One-dimensional Transforms Tutorial ................ 6 2.4 Real Multi-dimensional Transforms Tutorial ............... 7 2.5 Multi-dimensional Array Format ........................ 11 2.5.1 Row-major Format ............................ 11 2.5.2 Column-major Format ......................... 11 2.5.3 Static Arrays in C ............................. 11 2.5.4 Dynamic Arrays in C .......................... 12 2.5.5 Dynamic Arrays in C|The Wrong Way ......... 12 2.6 Words of Wisdom ...................................... 13 2.6.1 Caveats in Using Wisdom ...................... 14 2.6.2 Importing and Exporting Wisdom .............. 14 3 FFTW Reference ......................... 17 3.1 Data Types ............................................ 17 3.2 One-dimensional Transforms Reference................... 18 3.2.1 Plan Creation for One-dimensional Transforms ..
    [Show full text]
  • Introduction to Matlab
    Numerical Libraries with C or Fortran Shaohao Chen Research Computing, IS&T, Boston University Outline 1. Overview: What? Why? How to? 2. Fast Fourier transform: FFTw 3. Linear algebra libraries: LAPACK/BLAS 4. Intel Math Kernel Library (MKL) 5. Krylov subspace solver: PETSc 6. GNU scientific libraries (GSL) 1. Overview What you will learn today • Basic knowledge of numerical libraries. • How to check available libraries on BU SCC. • How to use numerical libraries on BU SCC. • Basic programming with several numerical libraries: FFTw, LAPACK/BLAS, MKL, PETSc, GSL What is numerical library? • What is the definition of a library in computer science? In computer science, a library is a collection of non-volatile resources used by computer programs, often to develop software. These may include configuration data, documentation, help data, message templates, pre-written code and subroutines, classes, values or type specifications. (from wiki) • What is numerical library? Numerical library is collection of functions, subroutines or classes that implement mathematical or numerical methods for a certain subject. Usually these functions or routines are common and can be used to build computer programs for various research fields. Several widely-used numerical libraries • Fastest Fourier Transform in the West (FFTW) computes Fourier and related transforms. Written in C. Fortran interface is available. • Basic Linear Algebra Subprograms (BLAS) performs basic vector and matrix operations. Linear Algebra Package (LAPACK) provides linear algebra routines based on BLAS. Written in Fortran. C interface (CBLAS/LAPACKE) is available. • Intel Math Kernel Library (MKL) includes optimized LAPACK, BLAS, FFT, Vector Math and Statistics functions. C/C++ and Fortran interfaces are available.
    [Show full text]
  • Parallelized Simulation Code for Multiconjugate Adaptive Optics
    PROCEEDINGS OF SPIE SPIEDigitalLibrary.org/conference-proceedings-of-spie Parallelized simulation code for multiconjugate adaptive optics Aron J. Ahmadia, Brent L. Ellerbroek Aron J. Ahmadia, Brent L. Ellerbroek, "Parallelized simulation code for multiconjugate adaptive optics," Proc. SPIE 5169, Astronomical Adaptive Optics Systems and Applications, (24 December 2003); doi: 10.1117/12.506553 Event: Optical Science and Technology, SPIE's 48th Annual Meeting, 2003, San Diego, California, United States Downloaded From: https://www.spiedigitallibrary.org/conference-proceedings-of-spie on 6/29/2018 Terms of Use: https://www.spiedigitallibrary.org/terms-of-use Parallelized Simulation Code for Multiconjugate Adaptive Optics A.J. Ahmadiaa and B.L. Ellerbroekb aGemini Observatory, 670 N. A’ohoku Place, Hilo, HI 96720 bAURA New Initiatives Offices, 950 N. Cherry Avenue, Tucson, AZ 85719 ABSTRACT Advances in adaptive optics (AO) systems are necessary to achieve optical performance that is suitable for future extremely large telescopes (ELTs). Accurate simulation of system performance during the design process is essential. We detail the current implementation and near-term development plans for a coarse-grain parallel code for simulations of multiconjugate adaptive optics (MCAO). Included is a summary of the simulation’s computationally intensive mathematical subroutines and the associated scaling laws that quantify the size of the computational burden as a function of the simulation parameters. The current state of three different approaches to parallelizing the original serial code is outlined, and the timing results of all three approaches are demonstrated. The first approach, coarse- grained parallelization of the atmospheric propagations, divides the tasks of propagating wavefronts through the atmosphere among a group of processors.
    [Show full text]