This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: % % Write your code here: F = 1./(C.*E); F % G) Find the maximum possible frequency that could be present in A. Store % your answer in G. Use the Nyquist theorum. % % Write your code here: G = 0.5.*C.*F; G % H) Find the Fast Fourier Transform of the sound from part a. Store your % answer in H. Refer to fft.pdf. % % Write your code here: H = 2.*abs(fft(A))./C; H = H(1:end/2); H % I) Find an amplitude vector that when played will be the sound from part % a in reverse. Store your answer in I. % % Write your code here: I = A(end:1:1); I % J) Find the sampling frequency that you would use with A and sound() to % make A sound an octave higher. Store the result in J. % % Write your code here: J = B.*2; J % K) Find the amplitude vector that you would use with B and sound() to % make A sound an octave higher. Use round(linspace()). Store the result % in K. % % Write your code here: K = A(round(linspace(1,C,C./2)));...
View
Full
Document
This note was uploaded on 10/21/2010 for the course CS 1371 taught by Professor Stallworth during the Spring '08 term at Georgia Tech.
 Spring '08
 Stallworth

Click to edit the document details