Hello
Please I would like some one to write code about multiplication 2 polynomial by using (Discrete Fourier transform)
Pleeeeeeease if you don't have any idea about DFT,DON'T SEND ME MSG,,,,,,,,,,
Regards,,
I'm a JAVA professional works in 2nd most valuable IT company in the world i.e Tata Consultancy Services and I have good experience in live JAVA projects(from our clients) and thus can handle this project very easily and can provide you a efficient and highly optimized code in 2 days.
I am not a newbie in JAVA. I am an Btech (Electronics) Graduate and have a very good understanding of DFT, IDFT and other DSP concepts.
I can implement an efficient code for this. Please provide me a chance.
Thanks-
This is for creation of matrix multiplication, not any explanation of any code, mine or someone else's. I will give you: my java program, instructions how to run it, and 2 example runs
• Highly motivated professional with 4 years of experience as a Software Engineer primarily in development of web-based Solutions & Application development.
• Has exposure in the Design, development and maintenance of commercial projects.
• Has good knowledge of J2EE application model to develop web-based solutions using Spring Framework, JDBC, Struts and Hibernate Frameworks.
• Has worked on Swing and AWT for Desktop Applications
• Has knowledge of J2EE Design Patterns (Singleton, DTO, DAO, MVC)
• Has knowledge of J2EE Web Services (SOAP, RESTful)