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 language | English (US) |
|---|---|
| Title of host publication | ICASSP 1992 - 1992 International Conference on Acoustics, Speech, and Signal Processing |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 89-92 |
| Number of pages | 4 |
| ISBN (Electronic) | 0780305329 |
| DOIs | |
| State | Published - 1992 |
| Event | 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992 - San Francisco, United States Duration: Mar 23 1992 → Mar 26 1992 |
Publication series
| Name | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
|---|---|
| Volume | 4 |
| ISSN (Print) | 1520-6149 |
Other
| Other | 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992 |
|---|---|
| Country/Territory | United States |
| City | San Francisco |
| Period | 3/23/92 → 3/26/92 |
Bibliographical note
Publisher Copyright:© 1992 IEEE.