Computer algebra and fast algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The utility of modern symbolic computation packages in a course of convolution and discrete Fourier transform (DFT) algorithms is presented. It is shown how Mathematica has been used to help illustrate the number-theoretic, polynomial, and finite-field computations involved. The result is that students are relieved of much of the algebraic drudgery and can concentrate on learning the fundamental aspects of the subject. It has been found that large problems can be successfully solved by students in a way that they find to be both interesting and satisfying. In addition, symbolic verification techniques can be used to prove the correctness of the results that are obtained.

Original languageEnglish (US)
Title of host publicationICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages89-92
Number of pages4
Volume4
ISBN (Electronic)0780305329
DOIs
StatePublished - Jan 1 1992
Event1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992 - San Francisco, United States
Duration: Mar 23 1992Mar 26 1992

Other

Other1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992
CountryUnited States
CitySan Francisco
Period3/23/923/26/92

Fingerprint Dive into the research topics of 'Computer algebra and fast algorithms'. Together they form a unique fingerprint.

  • Cite this

    Sobelman, G. E. (1992). Computer algebra and fast algorithms. In ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing (Vol. 4, pp. 89-92). [226404] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICASSP.1992.226404