Question: (c) (10 points) Describe how to do a polynomial multiplication using the FFT (d) (15 points) How can you modify the polynomial multiplication algorithm (e)
(c) (10 points) Describe how to do a polynomial multiplication using the FFT (d) (15 points) How can you modify the polynomial multiplication algorithm (e) (5 points) What kind of problems can occur in the previous approach to and IFFT for polynomials A(a) and B(z) of degree S n -1. Make sure that you describe the length of the FFT and IFFT needed for this task based on FFT and IFFT to do multiplication of long integers in base 10? Make sure that you take care of carries in a proper way multiply long integers and how would you overcome them? (Hint: How does the idealized FFT algorithm differ from a version implemented on a computer?)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
