We'll go over FFT. I'll let you decide whether it counts as "in detail."
If people are having trouble with the part about complex numbers, it may be helpful for you to first go through the "n=1" case in detail. For this case, the "2n"th complex roots of unity are +1 and -1, which are both real numbers, so only real arithmetic is needed. This case also has a close connection to the Karatsuba algorithm in section 5.5.
Please tell me we'll be going over the section on the FFT in detail... not only is it fascinating but also really hard!
ReplyDeleteoh yes... and there will be algorithms.
ReplyDeleteWe'll go over FFT. I'll let you decide whether it counts as "in detail."
ReplyDeleteIf people are having trouble with the part about complex numbers, it may be helpful for you to first go through the "n=1" case in detail. For this case, the "2n"th complex roots of unity are +1 and -1, which are both real numbers, so only real arithmetic is needed. This case also has a close connection to the Karatsuba algorithm in section 5.5.