Professional Documents
Culture Documents
Dataset Option #1 : Spooky ! Mysterious Phone Dialing Sound in Disney VHS Tapes
According to the definition of discrete time Fourier transform (DTFT) and inverse discrete time Fourier transform (IDTFT),
+∞
DTFT: X(ω) = ∑𝑛=−∞ 𝑥(𝑛)𝑒 −𝑗𝜔𝑛
1 𝜋
IDTFT: 𝑥(𝑛) = 2𝜋 ∫−𝜋 X(ω)𝑒 𝑗𝜔𝑛 𝑑ω
Sinc X(ω) has a continuous variable ω , It includes infinite numbers. In digital systems, X(k) where 0 ≤ k ≤ M − 1 is computed to
represent X(ω). What would be the right choice for M will be discussed in lectures of discrete Fourier transform (DFT) and Fast Fourier
transform (FFT). A segmented signal from dataset#1 is processed for the purpose of demonstration. Running concept_demo.m
generates the figures below.
M = 44100
With peaks at 1211 Hz and 854 Hz, the 5th digit is the number 7
M = 5000
With peaks at 1208 Hz and 855 Hz, the 5th digit is the number 7
The dataset #1 is provided to test your MATLAB codes and understand the concept. The dataset2 and dataset3
are corrupted data with the “sean” noise. In order to detect the dialed numbers from these two datasets, one
may have to segment the data carefully, then examine its frequency information.
Task: Write your MATLAB codes to perform DTMF detection on the recorded data. You may choose option #1
or #2 for the data used in your project. Two students per group.
Submission Requirements:
(1) Demonstrate your work to the course instructor / Record your demon
(2) Submit all your MATLAB codes
(3) Submit the detected digits from your dataset
(4) Submit an “independent work” statement