Title :
Computer algebra and fast algorithms
Author :
Sobelman, Gerald E.
Author_Institution :
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
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
Keywords :
computer aided instruction; educational courses; fast Fourier transforms; symbol manipulation; DFT algorithms; Mathematica; computer algebra; convolution algorithms; discrete Fourier transform; fast algorithms; finite-field computations; number-theoretic computations; polynomial computations; symbolic computation packages; Algebra; Convolutional codes; Discrete Fourier transforms; Fourier transforms; Polynomials;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7803-0532-9
DOI :
10.1109/ICASSP.1992.226404
