Discrete-time Fourier Analysis

Thread starter Eng67
Start date Sep 9, 2006
Tags

Analysis Fourier Fourier analysis

Click For Summary

The discussion focuses on computing the Discrete-Time Fourier Transform (DTFT) of the signal x[n] = n(0.5)^n u[n]. The contributor shares their solution, which is 0.5 e^(-jw)/((1-0.5e^(-jw))^2). They express frustration that this topic seems to confuse many people. The solution appears to be correct based on the context provided. The thread highlights the challenges of understanding DTFT calculations in discrete-time signals.

Sep 9, 2006

Eng67

I am trying to compute the DTFT of x[n]=n(.5)^n u[n].

This is my work so far.

Is this correct?

Physics news on Phys.org

Sep 11, 2006

Eng67

I see that this topic totally stumps everyone! LOL

I have solved ths with an answer of

0.5 e^(-jw)/((1-0.5e^(-jw))^2)

Thread 'Distance between a Clock's hands when the distance is increasing most rapidly'

Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

View full post »