MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
Which of the following is true regarding the number of computations required to compute DFT at any one value of k ? |
| A. | 4N-2 real multiplications and 4N real additions |
| B. | 4N real multiplications and 4N-4 real additions |
| C. | 4N-2 real multiplications and 4N+2 real additions |
| D. | 4N real multiplications and 4N-2 real additions |
| Answer» E. | |