jamesyu's documents

Introduction to Bayesian Statistics Harvey Thornburg Center for Computer Research in Music and Acoustics (CCRMA) Department of Music, Stanford University Stanford, California 94305 February 19, 2006 Statistical approaches to parameter estimation and hypothesis testing which use prior distributions over parameters are known as Bayesian methods. The following notes briefly summarize some importan...

PARSHL: An Analysis/Synthesis Program for Non-Harmonic Sounds Based on a Sinusoidal Representation∗ Julius O. Smith III† Xavier Serra Center for Computer Research in Music and Acoustics (CCRMA) Department of Music, Stanford University Stanford, California 94305 Abstract This paper describes a peak-tracking spectrum analyzer, called Parshl, which is useful for extracting additive synthesis para...

MUS421/EE367B Lecture 2 Review of the Discrete Fourier Transform (DFT) Julius O. Smith III (jos@ccrma.stanford.edu) Center for Computer Research in Music and Acoustics (CCRMA) Department of Music, Stanford University Stanford, California 94305 April 10, 2007 Outline • Domains of Definition • Discrete Fourier Transform • Properties of the Fourier Transform For more details, see • Mathematics of ...

MUS421/EE367B Lecture 1 Introduction and Overview Julius O. Smith III (jos@ccrma.stanford.edu) Center for Computer Research in Music and Acoustics (CCRMA) Department of Music, Stanford University Stanford, California 94305 April 10, 2007 Course Overview • The focus of this course is spectral modeling and signal processing using the short-time Fourier transform (STFT). • Applications include mu...

Music 422/ EE 367C Winter 2006/2007 Assignment #6 – Project Proposal Due February 23, 2007 Class Project: The class project is to build and tune an MDCT-based perceptual audio coder. We recommend that students form groups of 2-3 students per group to work together on the coder. The project proposal should specify the members of the group and outline a work proposal including motivations, metho...

Music 422/ EE 367C Winter 2006/2007 Assignment #7 Due March 2, 2007 Listening Test: In this exercise you will perform a listening test to compare the coders you built in the previous assignments on a variety of test samples. You will rate the coders using the ITU-R 5-point impairment scale. a) Prepare a set of short test signals to be used for your listening test. Make sure that the set includ...

Music 422/ EE 367C Winter 2006/2007 Assignment #4 Due February 9, 2007 1) Masking Curves: In this exercise you will develop the masking curve for a test signal. We will return to this test signal in the next assignment and use the masking curve to guide bit allocation for this signal. a) Use an FFT to map a 1 kHz sine wave with amplitude equal to 1.0 into the frequency domain. Use a sample rate...

Music 422/ EE 367C Winter 2006/2007 Assignment #5 Due February 16, 2007 Bit Allocation: In this exercise, you will compare bit allocation methods for the test signal studied in the exercise for Assignment #4. The goal is to gain an appreciation of how different bit allocations perform. 1) Define 25 sub-bands by mapping the N/2 frequency lines of a length N = 1024 MDCT onto the 25 critical band...

MUS 422/EE 367C Winter 2006/07 Assignment 1 Due January 19, 2007 1) Data rates and the need for compression: There has been recent discussion in the audio market about the need to move to higher bit precision and greater sample rates. In particular, sampling rates of 96 kHz and 192 kHz using 24 bits per sample have been adopted in the DVD-Audio format. Let’s look at some implications for using ...

Music 422/EE 367C Winter 2006/07 Assignment #2 Due January 26, 2007 1) Working with bits (extra credit): Text is normally stored as 8 bit ASCII codes (of which only the lowest 7 bits are used to store the basic character set). For this exercise, you will create a lossy text codec that stores text using only 5 bits per character. In doing so, you will gain experience in dealing with reading/writ...

MUS 422/EE 367C Winter 2006/2007 Assignment #3 Due February 2nd, 2007 1) CQF filter banks (extra credit): In this exercise you will design an N = 4 CQF filter bank. Recall that implementing the CQF 2-channel Filter bank requires finding a low pass prototype filter h0[n] that satisfies the power complementarity condition H0(z)H0(1/z) + H0(-z)H0(-1/z) = 2. One way to create a CQF prototype filter...