Alias-Free Digital Synthesis of Classic Analog Waveforms

Total Page:16

File Type:pdf, Size:1020Kb

Alias-Free Digital Synthesis of Classic Analog Waveforms Alias-Free Digital Synthesis of Classic Analog Waveforms Tim [email protected] rd.edu Julius Smith [email protected] u CCRMA http://www-ccrma.stanford.edu/ Music Department, Stanford University Abstract Techniques are reviewed and presented for alias-free digital synthesis of classical analog synthesizer waveforms such as pulse train and sawtooth waves. Techniquesdescribed include summation of bandlim- ited primitive waveforms as well as table-lookup techniques. Bandlimited pulse and triangle waveforms are obtained by integrating the difference of two out-of-phase bandlimited impulse trains. Bandlimited impulse trains are generated as a superposition of windowed sinc functions. Methods for more general bandlimited waveform synthesis are also reviewed. Methods are evaluated from the perspectives of sound quality, computational economy, and ease of control. 1 Introduction impulse train Any analog signal with a discontinuity in the wave- 1 form (such as pulse train or sawtooth) or in the wave- 0.8 form slope (such as triangle wave) must be bandlim- 0.6 ited to less than half the sampling rate before sampling 0.4 to obtain a corresponding discrete-time signal. Simple methods of generating these waveforms digitally con- 0.2 tain aliasing due to having to round off the discontinuity 0 0 5 10 15 20 time to the nearest available sampling instant. The sig- nals primarily addressed here are the impulse train, rect- Box Train, and Sample Positions angular pulse, and sawtooth waveforms. Because the 1 latter two signals can be derived from the ®rst by inte- 0.8 gration, only the algorithm for the impulse train is de- 0.6 veloped in detail. 0.4 0.2 2 Why Simple Discrete-Time Pulse 0 0 5 10 15 20 Trains are Aliased Rounded−Time Pulse Train The ªobviousº way to generate a discrete-time ver- 1 sion of an impulse train is to approximate it by a unit- 0.8 δ sample-pulse train. The unit sample pulse n is de- 0.6 ®ned as 0.4 = δ ∆ 1; n 0 = n 0.2 j j = ; ; ;::: 0; n 1 2 3 0 The unit-sample pulse is only de®ned for integer n,so 0 5 10 15 20 we have a problem: Suppose the desired impulse-train = frequency is f1 = 1 T1, then the period in samples has to Figure 1: Rounded-Time Impulse Train as a Sampled Version = = = = = be P = T1 Ts Fs f1,whereFs 1 Ts is the sampling of an Ideal Rectangular Pulse Train rate, and P is rarely an integer. Because pitch perception Stilson and Smith 1 Alias-Free Synthesis ∞ is so accurate , it does not work to round M to the near- jωTs ∝ ω + π Y e ∑ X k2 Fs est integer, except at frequencies so low that the error is ∞ k = on the order of a tenth of a percent (around 100 Hz or ∞ ω + π below for a 50 kHz sampling rate). Therefore, to make = ∑ P k2 Fs ∞ the pitch right, it is necessaryto compute the impulse ar- k = ∞ rival times very accurately and round each arrival time δω + π ω ∑ k2 F l to the nearest sample instant. This process can be mod- s 1 ∞ l = eled as pitch-period jitter which obviously adds noise to the signal. It can also be modeled as a uniform sampling The desired pulse-train spectrum is only the k = 0term of a periodic sequence of rectangular pulses one sample above. Each nonzero k term contributes a string of wide (Figure 1): aliased of harmonics across the entire frequency band. The amount of aliasing is highly signi®cant and audible, j j = ∆ 1; t Ts2as can be predicted from looking at Fig. 6. = pt j j> = 0; tTs2The only frequency which does not suffer aliasing is DC since the sinc spectral envelope goes through zero The Fourier transform of this pulse is a sinc function at all multiples of the sampling rate. For this reason, the Z ∞ aliasing is reduced at very low frequencies relative to the ∆ ω j t ω = = P p t e dt Ts sinc fTs sampling rate. This provides another explanation why ∞ the aliasing is not as objectionable for low fundamental π frequencies (where the nearest-integer roundoff is an in- where ω = 2 f ,and signi®cant fraction of the period): The aliased frequen- π ∆ sin x cies that would tend to be most noticeable (those near or = : sincx πx below the fundamental frequency) are most attenuated. The above analysis extends immediately to rectangle A periodic sequence of these rectangular pulses is con- waves. structed as ∞ ∆ Trivial Sawtooth Trivial Square = + xt ∑ p t lT1 ∞ l = and its Fourier transform is, by the shift theorem and properties of delta functions, ∞ ∆ jωlT1 ω = ω X ∑ e P ∞ l = ∞ Saw. Spec. Sq. Spec. ω δω ω ∝ P ∑ l 1 0 0 ∞ l= ω ; ω = ω P l l ∝ −20 −20 ω 6= ω ; 8 0; l l δ ∆ −40 −40 ω ω = π where denotes the delta function, and l 2 lF1. Thus, the rectangular-pulse train has an in®nite har- −60 −60 monic spectrum weighted by a sinc function having ze- 0 0.2 0.4 0 0.2 0.4 freq (norm) freq (norm) ros at multiples of the sampling rate Fs (because the original rectangular pulse was taken to be one sampling Figure 2: Spectra of Trivial Sawtooth and Square-Wave Sig- interval wide). Since the sinc function has a lot of en- nals, Low Frequency ergy above its ®rst zero crossing, sampling xt will cause aliasing of an in®nite number of harmonics whose A similar argument applies to explain why sawtooth amplitudes fall off at 6 dB per octave (since sinc fTs signals alias: If the unit-amplitude sawtooth is gener- falls off as 1 = f ). (Harmonics under the outer half of the main lobe of the sinc function also alias.) Sampling, we ated by = get sn f1nTs mod1 where f1 is the desired frequency, then it can be shown ∆ = $ yn x nTs to be simply a sampling of a continuous-time (ªanalogº) Stilson and Smith 2 Alias-Free Synthesis Trivial Sawtooth Trivial Square it appears not to be done in practice. 3 Bandlimited Synthesis In this section, various preexisting methods for syn- thesis of bandlimited waveforms will be reviewed. Saw. Spec. Sq. Spec. 0 0 3.1 Additive Synthesis Additive synthesis is trivially bandlimited simply by not −20 −20 generating harmonics higher than Fs =2; typically this also presents a computational savings. Additive synthe- −40 −40 sis systems that use the inverse FFT to compute the os- cillators are bandlimited by de®nition because the in- −60 −60 0 0.2 0.4 0 0.2 0.4 verse FFT only generates frequencies up to Fs =2. In freq (norm) freq (norm) inverse-FFT synthesis, time-aliasing becomes the error to minimize. Figure 3: Spectra of Trivial Sawtooth and Square-Wave Sig- nals, High Frequency 3.2 Wavetable Synthesis One of the very earliest synthesis techniques used sawtooth of equivalent slope. Since the analog sawtooth in computer music was periodic wavetable synthesis is not bandlimited, the sampled version will be aliased. [Mathews 1969] (not to be confused with sample play- This is slightly different from a rounded-time retrig- back synthesis which is also called wavetable synthe- gered sawtooth which is better described as the convolu- sis these days). In this technique, a wavetable contains tion of a single cycle of a sawtooth wave with a rounded- only one period of the desired tone, sampled at a high time impulse train, which was just shown to be aliased rate, such as N = 512 samples per period. Playing out as well. Since a single cycle of a sawtooth has a Fourier the table repeatedly generates a periodic waveform with transform which falls off at 6 dB per octave (all dis- fundamental frequency Fs =N,whereFs is the sampling continuous waveforms have spectral fall-offs no faster rate. Skipping every other sample on playback yields a than 6 dB per octave [Papoulis 1991]), it follows that fundamental frequency of 2Fs =N and so on. Intermedi- the spectrum of the rounded-time retriggered sawtooth ate frequencies f0 are obtained using a non-integer skip- = also falls off at 6 dB per octave. Therefore, sampling it factor, or ªphase increment,º given by Inc = Nf0 Fs;in causes aliasing in an amount similar to that in the sam- such cases, the wavetable address has a fractional part pled rectangular pulse train. which is often either discarded or used to round to the By convolving the rounded-time impulse train (sam- nearest integer (reasonable for very large N and/or heav- pled rectangular pulse train, with pulses of width ily oversampled waveforms), or it is used to determine Ts) with an arbitrary ®xed ®lter, formant synthesis an interpolated table value. By far the most common such as VOSIM [Kaegi and and S. Tempelaars 1978], interpolation technique is linear interpolation. How- Chant [Rodet et al. 1989] (see also [Roads 1996]) is de- ever, higher order interpolation methods, especially La- scribed. By multiplying the rounded-time impulse train grange [Schafer and Rabiner 1973] and bandlimited in- by a periodic amplitude envelope and convolving it with terpolation [Smith and Gossett 1984], have been used a Blackman FFT window, window-function synthesis commercially. is described [Goeddel and Bass 1984] (summarized in Interpolated wavetable synthesis is not guaranteed to [Roads 1996]). In all these cases, a pitch-period is as- be bandlimited when the phase increment is larger than sociated with the impulse response of the formant ®lter one sample. In these cases, one is performing the equiv- (or lowpass ®lter in the case of window-function syn- alent of a decimation of the waveform, with the decima- thesis), perhaps overlapping with those of other periods, tion factor being equal to the phase increment in sam- and the impulse-responsestart times are quantized to the ples.
Recommended publications
  • Sampling Signals on Graphs from Theory to Applications
    1 Sampling Signals on Graphs From Theory to Applications Yuichi Tanaka, Yonina C. Eldar, Antonio Ortega, and Gene Cheung Abstract The study of sampling signals on graphs, with the goal of building an analog of sampling for standard signals in the time and spatial domains, has attracted considerable attention recently. Beyond adding to the growing theory on graph signal processing (GSP), sampling on graphs has various promising applications. In this article, we review current progress on sampling over graphs focusing on theory and potential applications. Although most methodologies used in graph signal sampling are designed to parallel those used in sampling for standard signals, sampling theory for graph signals significantly differs from the theory of Shannon–Nyquist and shift-invariant sampling. This is due in part to the fact that the definitions of several important properties, such as shift invariance and bandlimitedness, are different in GSP systems. Throughout this review, we discuss similarities and differences between standard and graph signal sampling and highlight open problems and challenges. I. INTRODUCTION Sampling is one of the fundamental tenets of digital signal processing (see [1] and references therein). As such, it has been studied extensively for decades and continues to draw considerable research efforts. Standard sampling theory relies on concepts of frequency domain analysis, shift invariant (SI) signals, and bandlimitedness [1]. Sampling of time and spatial domain signals in shift-invariant spaces is one of the most important building blocks of digital signal processing systems. However, in the big data era, the signals we need to process often have other types of connections and structure, such as network signals described by graphs.
    [Show full text]
  • Lecture19.Pptx
    Outline Foundations of Computer Graphics (Fall 2012) §. Basic ideas of sampling, reconstruction, aliasing CS 184, Lectures 19: Sampling and Reconstruction §. Signal processing and Fourier analysis §. http://inst.eecs.berkeley.edu /~cs184 Implementation of digital filters §. Section 14.10 of FvDFH (you really should read) §. Post-raytracing lectures more advanced topics §. No programming assignment §. But can be tested (at high level) in final Acknowledgements: Thomas Funkhouser and Pat Hanrahan Some slides courtesy Tom Funkhouser Sampling and Reconstruction Sampling and Reconstruction §. An image is a 2D array of samples §. Discrete samples from real-world continuous signal (Spatial) Aliasing (Spatial) Aliasing §. Jaggies probably biggest aliasing problem 1 Sampling and Aliasing Image Processing pipeline §. Artifacts due to undersampling or poor reconstruction §. Formally, high frequencies masquerading as low §. E.g. high frequency line as low freq jaggies Outline Motivation §. Basic ideas of sampling, reconstruction, aliasing §. Formal analysis of sampling and reconstruction §. Signal processing and Fourier analysis §. Important theory (signal-processing) for graphics §. Implementation of digital filters §. Also relevant in rendering, modeling, animation §. Section 14.10 of FvDFH Ideas Sampling Theory Analysis in the frequency (not spatial) domain §. Signal (function of time generally, here of space) §. Sum of sine waves, with possibly different offsets (phase) §. Each wave different frequency, amplitude §. Continuous: defined at all points; discrete: on a grid §. High frequency: rapid variation; Low Freq: slow variation §. Images are converting continuous to discrete. Do this sampling as best as possible. §. Signal processing theory tells us how best to do this §. Based on concept of frequency domain Fourier analysis 2 Fourier Transform Fourier Transform §. Tool for converting from spatial to frequency domain §.
    [Show full text]
  • And Bandlimiting IMAHA, November 14, 2009, 11:00–11:40
    Time- and bandlimiting IMAHA, November 14, 2009, 11:00{11:40 Joe Lakey (w Scott Izu and Jeff Hogan)1 November 16, 2009 Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting sampling theory and history Time- and bandlimiting, history, definitions and basic properties connecting sampling and time- and bandlimiting The multiband case Outline Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting Time- and bandlimiting, history, definitions and basic properties connecting sampling and time- and bandlimiting The multiband case Outline sampling theory and history Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting connecting sampling and time- and bandlimiting The multiband case Outline sampling theory and history Time- and bandlimiting, history, definitions and basic properties Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting The multiband case Outline sampling theory and history Time- and bandlimiting, history, definitions and basic properties connecting sampling and time- and bandlimiting Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting Outline sampling theory and history Time- and bandlimiting, history, definitions and basic properties connecting sampling and time- and bandlimiting The multiband case Joe Lakey (w Scott Izu and Jeff Hogan) Time- and bandlimiting R −2πitξ Fourier transform: bf (ξ) = f (t) e dt R _ Bandlimiting:
    [Show full text]
  • Lab 4: Using the Digital-To-Analog Converter
    ECE2049 – Embedded Computing in Engineering Design Lab 4: Using the Digital-to-Analog Converter In this lab, you will gain experience with SPI by using the MSP430 and the MSP4921 DAC to create a simple function generator. Specifically, your function generator will be capable of generating different DC values as well as a square wave, a sawtooth wave, and a triangle wave. Pre-lab Assignment There is no pre-lab for this lab, yay! Instead, you will use some of the topics covered in recent lectures and HW 5. Lab Requirements To implement this lab, you are required to complete each of the following tasks. You do not need to complete the tasks in the order listed. Be sure to answer all questions fully where indicated. As always, if you have conceptual questions about the requirements or about specific C please feel free to as us—we are happy to help! Note: There is no report for this lab! Instead, take notes on the answers to the questions and save screenshots where indicated—have these ready when you ask for a signoff. When you are done, you will submit your code as well as your answers and screenshots online as usual. System Requirements 1. Start this lab by downloading the template on the course website and importing it into CCS—this lab has a slightly different template than previous labs to include the functionality for the DAC. Look over the example code to see how to use the DAC functions. 2. Your function generator will support at least four types of waveforms: DC (a constant voltage), a square wave, sawtooth wave, and a triangle wave, as described in the requirements below.
    [Show full text]
  • Fourier Series
    Chapter 10 Fourier Series 10.1 Periodic Functions and Orthogonality Relations The differential equation ′′ y + 2y = F cos !t models a mass-spring system with natural frequency with a pure cosine forcing function of frequency !. If 2 = !2 a particular solution is easily found by undetermined coefficients (or by∕ using Laplace transforms) to be F y = cos !t. p 2 !2 − If the forcing function is a linear combination of simple cosine functions, so that the differential equation is N ′′ 2 y + y = Fn cos !nt n=1 X 2 2 where = !n for any n, then, by linearity, a particular solution is obtained as a sum ∕ N F y (t)= n cos ! t. p 2 !2 n n=1 n X − This simple procedure can be extended to any function that can be repre- sented as a sum of cosine (and sine) functions, even if that summation is not a finite sum. It turns out that the functions that can be represented as sums in this form are very general, and include most of the periodic functions that are usually encountered in applications. 723 724 10 Fourier Series Periodic Functions A function f is said to be periodic with period p> 0 if f(t + p)= f(t) for all t in the domain of f. This means that the graph of f repeats in successive intervals of length p, as can be seen in the graph in Figure 10.1. y p 2p 3p 4p 5p Fig. 10.1 An example of a periodic function with period p.
    [Show full text]
  • Information Theory
    Information Theory Professor John Daugman University of Cambridge Computer Science Tripos, Part II Michaelmas Term 2016/17 H(X,Y) I(X;Y) H(X|Y) H(Y|X) H(X) H(Y) 1 / 149 Outline of Lectures 1. Foundations: probability, uncertainty, information. 2. Entropies defined, and why they are measures of information. 3. Source coding theorem; prefix, variable-, and fixed-length codes. 4. Discrete channel properties, noise, and channel capacity. 5. Spectral properties of continuous-time signals and channels. 6. Continuous information; density; noisy channel coding theorem. 7. Signal coding and transmission schemes using Fourier theorems. 8. The quantised degrees-of-freedom in a continuous signal. 9. Gabor-Heisenberg-Weyl uncertainty relation. Optimal \Logons". 10. Data compression codes and protocols. 11. Kolmogorov complexity. Minimal description length. 12. Applications of information theory in other sciences. Reference book (*) Cover, T. & Thomas, J. Elements of Information Theory (second edition). Wiley-Interscience, 2006 2 / 149 Overview: what is information theory? Key idea: The movements and transformations of information, just like those of a fluid, are constrained by mathematical and physical laws. These laws have deep connections with: I probability theory, statistics, and combinatorics I thermodynamics (statistical physics) I spectral analysis, Fourier (and other) transforms I sampling theory, prediction, estimation theory I electrical engineering (bandwidth; signal-to-noise ratio) I complexity theory (minimal description length) I signal processing, representation, compressibility As such, information theory addresses and answers the two fundamental questions which limit all data encoding and communication systems: 1. What is the ultimate data compression? (answer: the entropy of the data, H, is its compression limit.) 2.
    [Show full text]
  • Lecture 16 Bandlimiting and Nyquist Criterion
    ELG3175 Introduction to Communication Systems Lecture 16 Bandlimiting and Nyquist Criterion Bandlimiting and ISI • Real systems are usually bandlimited. • When a signal is bandlimited in the frequency domain, it is usually smeared in the time domain. This smearing results in intersymbol interference (ISI). • The only way to avoid ISI is to satisfy the 1st Nyquist criterion. • For an impulse response this means at sampling instants having only one nonzero sample. Lecture 12 Band-limited Channels and Intersymbol Interference • Rectangular pulses are suitable for infinite-bandwidth channels (practically – wideband). • Practical channels are band-limited -> pulses spread in time and are smeared into adjacent slots. This is intersymbol interference (ISI). Input binary waveform Individual pulse response Received waveform Eye Diagram • Convenient way to observe the effect of ISI and channel noise on an oscilloscope. Eye Diagram • Oscilloscope presentations of a signal with multiple sweeps (triggered by a clock signal!), each is slightly larger than symbol interval. • Quality of a received signal may be estimated. • Normal operating conditions (no ISI, no noise) -> eye is open. • Large ISI or noise -> eye is closed. • Timing error allowed – width of the eye, called eye opening (preferred sampling time – at the largest vertical eye opening). • Sensitivity to timing error -> slope of the open eye evaluated at the zero crossing point. • Noise margin -> the height of the eye opening. Pulse shapes and bandwidth • For PAM: L L sPAM (t) = ∑ai p(t − iTs ) = p(t)*∑aiδ (t − iTs ) i=0 i=0 L Let ∑aiδ (t − iTs ) = y(t) i=0 Then SPAM ( f ) = P( f )Y( f ) BPAM = Bp.
    [Show full text]
  • Frames and Other Bases in Abstract and Function Spaces Novel Methods in Harmonic Analysis, Volume 1
    Applied and Numerical Harmonic Analysis Isaac Pesenson Quoc Thong Le Gia Azita Mayeli Hrushikesh Mhaskar Ding-Xuan Zhou Editors Frames and Other Bases in Abstract and Function Spaces Novel Methods in Harmonic Analysis, Volume 1 Applied and Numerical Harmonic Analysis Series Editor John J. Benedetto University of Maryland College Park, MD, USA Editorial Advisory Board Akram Aldroubi Gitta Kutyniok Vanderbilt University Technische Universität Berlin Nashville, TN, USA Berlin, Germany Douglas Cochran Mauro Maggioni Arizona State University Duke University Phoenix, AZ, USA Durham, NC, USA Hans G. Feichtinger Zuowei Shen University of Vienna National University of Singapore Vienna, Austria Singapore, Singapore Christopher Heil Thomas Strohmer Georgia Institute of Technology University of California Atlanta, GA, USA Davis, CA, USA Stéphane Jaffard Yang Wang University of Paris XII Michigan State University Paris, France East Lansing, MI, USA Jelena Kovaceviˇ c´ Carnegie Mellon University Pittsburgh, PA, USA More information about this series at http://www.springer.com/series/4968 Isaac Pesenson • Quoc Thong Le Gia Azita Mayeli • Hrushikesh Mhaskar Ding-Xuan Zhou Editors Frames and Other Bases in Abstract and Function Spaces Novel Methods in Harmonic Analysis, Volume 1 Editors Isaac Pesenson Quoc Thong Le Gia Department of Mathematics School of Mathematics and Statistics Temple University University of New South Wales Philadelphia, PA, USA Sydney, NSW, Australia Azita Mayeli Hrushikesh Mhaskar Department of Mathematics Institute of Mathematical
    [Show full text]
  • Tektronix Signal Generator
    Signal Generator Fundamentals Signal Generator Fundamentals Table of Contents The Complete Measurement System · · · · · · · · · · · · · · · 5 Complex Waves · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 15 The Signal Generator · · · · · · · · · · · · · · · · · · · · · · · · · · · · 6 Signal Modulation · · · · · · · · · · · · · · · · · · · · · · · · · · · 15 Analog or Digital? · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 7 Analog Modulation · · · · · · · · · · · · · · · · · · · · · · · · · 15 Basic Signal Generator Applications· · · · · · · · · · · · · · · · 8 Digital Modulation · · · · · · · · · · · · · · · · · · · · · · · · · · 15 Verification · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 8 Frequency Sweep · · · · · · · · · · · · · · · · · · · · · · · · · · · 16 Testing Digital Modulator Transmitters and Receivers · · 8 Quadrature Modulation · · · · · · · · · · · · · · · · · · · · · 16 Characterization · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 8 Digital Patterns and Formats · · · · · · · · · · · · · · · · · · · 16 Testing D/A and A/D Converters · · · · · · · · · · · · · · · · · 8 Bit Streams · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 17 Stress/Margin Testing · · · · · · · · · · · · · · · · · · · · · · · · · · · 9 Types of Signal Generators · · · · · · · · · · · · · · · · · · · · · · 17 Stressing Communication Receivers · · · · · · · · · · · · · · 9 Analog and Mixed Signal Generators · · · · · · · · · · · · · · 18 Signal Generation Techniques
    [Show full text]
  • Ideal C/D Converter
    Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.341: Discrete-Time Signal Processing OpenCourseWare 2006 Lecture 4 DT Processing of CT Signals & CT Processing of DT Signals: Fractional Delay Reading: Sections 4.1 - 4.5 in Oppenheim, Schafer & Buck (OSB). A typical discrete-time system used to process a continuous-time signal is shown in OSB Figure 4.15. T is the sampling/reconstruction period for the C/D and the D/C converters. When the input signal is bandlimited, the effective system in Figure 4.15 (b) is equivalent to the continuous-time system shown in Figure 4.15 (a). Ideal C/D Converter The relationship between the input and output signals in an ideal C/D converter as depicted in OSB Figure 4.1 is: Time Domain: x[n] = xc(nT ) j! 1 P1 ! 2¼k Frequency Domain: X(e ) = T k=¡1 Xc(j( T ¡ T )); j! where X(e ) and Xc(jΩ) are the DTFT and CTFT of x[n], xc(t). These relationships are illustrated in the figures below. See Section 4.2 of OSB for their derivations and more detailed descriptions of C/D converters. Time/Frequency domain representation of C/D conversion 1 In the frequency domain, a C/D converter can be thought of in three stages: periodic 1 repetition of the spectrum at 2¼, normalization of frequency by , and scaling of the amplitude T 1 ! by . The CT frequency Ω is related to the DT frequency ! by Ω = . If x (t) is not T T c ­s ­s bandlimited to ¡ 2 < Ωmax < 2 , repetition at 2¼ will cause aliasing.
    [Show full text]
  • Focm 2017 Foundations of Computational Mathematics Barcelona, July 10Th-19Th, 2017 Organized in Partnership With
    FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th-19th, 2017 http://www.ub.edu/focm2017 Organized in partnership with Workshops Approximation Theory Computational Algebraic Geometry Computational Dynamics Computational Harmonic Analysis and Compressive Sensing Computational Mathematical Biology with emphasis on the Genome Computational Number Theory Computational Geometry and Topology Continuous Optimization Foundations of Numerical PDEs Geometric Integration and Computational Mechanics Graph Theory and Combinatorics Information-Based Complexity Learning Theory Plenary Speakers Mathematical Foundations of Data Assimilation and Inverse Problems Multiresolution and Adaptivity in Numerical PDEs Numerical Linear Algebra Karim Adiprasito Random Matrices Jean-David Benamou Real-Number Complexity Alexei Borodin Special Functions and Orthogonal Polynomials Mireille Bousquet-Mélou Stochastic Computation Symbolic Analysis Mark Braverman Claudio Canuto Martin Hairer Pierre Lairez Monique Laurent Melvin Leok Lek-Heng Lim Gábor Lugosi Bruno Salvy Sylvia Serfaty Steve Smale Andrew Stuart Joel Tropp Sponsors Shmuel Weinberger 2 FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th{19th, 2017 Books of abstracts 4 FoCM 2017 Contents Presentation . .7 Governance of FoCM . .9 Local Organizing Committee . .9 Administrative and logistic support . .9 Technical support . 10 Volunteers . 10 Workshops Committee . 10 Plenary Speakers Committee . 10 Smale Prize Committee . 11 Funding Committee . 11 Plenary talks . 13 Workshops . 21 A1 { Approximation Theory Organizers: Albert Cohen { Ron Devore { Peter Binev . 21 A2 { Computational Algebraic Geometry Organizers: Marta Casanellas { Agnes Szanto { Thorsten Theobald . 36 A3 { Computational Number Theory Organizers: Christophe Ritzenhaler { Enric Nart { Tanja Lange . 50 A4 { Computational Geometry and Topology Organizers: Joel Hass { Herbert Edelsbrunner { Gunnar Carlsson . 56 A5 { Geometric Integration and Computational Mechanics Organizers: Fernando Casas { Elena Celledoni { David Martin de Diego .
    [Show full text]
  • Aliasing Reduction in Clipped Signals
    This is an electronic reprint of the original article. This reprint may differ from the original in pagination and typographic detail. Author(s): Fabián Esqueda, Stefan Bilbao and Vesa Välimäki Title: Aliasing reduction in clipped signals Year: 2016 Version: Author accepted / Post print version Please cite the original version: Fabián Esqueda, Stefan Bilbao and Vesa Välimäki. Aliasing reduction in clipped signals. IEEE Transactions on Signal Processing, Vol. 64, No. 20, pp. 5255-5267, October 2016. DOI: 10.1109/TSP.2016.2585091 Rights: © 2016 IEEE. Reprinted with permission. In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of Aalto University's products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink. This publication is included in the electronic version of the article dissertation: Esqueda, Fabián. Aliasing Reduction in Nonlinear Audio Signal Processing. Aalto University publication series DOCTORAL DISSERTATIONS, 74/2018. All material supplied via Aaltodoc is protected by copyright and other intellectual property rights, and duplication or sale of all or part of any of the repository collections is not permitted, except that material may be duplicated by you for your research use or educational purposes in electronic or print form. You must obtain permission for any other use. Electronic or print copies may not be offered, whether for sale or otherwise to anyone who is not an authorised user.
    [Show full text]