2002 Fiscal Year Final Research Report Summary
COMPOSITE LENGTH FAST ALGORITHM USING RECURSIVE FACTORIZATION OF POLYNOMIALS
| Project/Area Number |
13650438
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
情報通信工学
|
|---|
| Research Institution | KANAZAWA INSTITUTE OF TECHNOLOGY |
|---|
Principal Investigator |
MURAKAMI Hideo KANAZAWA INSTITUTE OF TECHNOLOGY, ENGINEERING, PROFESSOR, 工学部, 教授 (90113034)
|
|---|
| Project Period (FY) |
2001 – 2002
|
| Keywords | Fast algorithm / Discrete Fourier transform / Recursive polynomial factorization |
|---|
| Research Abstract |
Computing Discrete Fourier Transform (DFT) and cyclic convolutions is important in digital signal processing as well as communications. One class of fast algorithms is based on a recursive polynomial factorization. This research derives a new fast algorithm based on a recursive polynomial factorization using only real arithmetic that can be applied for sequences whose lengths are not a power of two. Content of the report is as follows :
1. Polynomial Expansions for Finite Sequences
2. Generalized Cyclic Convolution and Is Applications
3. Sampling Rate Conversion Systems for Complex Signals
4. Real-Valued Block Sampling Rate Conversion Systems
5. Parallel Module Decomposition for Filter Banks
6. PR Condition for Complex-valued Block Filter Banks
7. Real Module Decomposition of Block Filter Bank
8. PR Condition for the Real-valued Block Filter Bank
9. Prime-Length Real-Valued Polynomial Residue Division Algorithms
10. Discrete Wavelet Transform Based on Cyclic Convolutions
|
