Fast algorithms for N-point shifted discrete Fourier transform (SDFT) are proposed by efficient matrix factorization¡DThe resulted matrix decomposition is realized by a cascade of several basic computation blocks with each block implemented by a parameterized IP module¡DBy combining these modules with different parameters, it is easy to implement a wide variety of digital transforms, such as DCT/IDCT in image/video coding, and modified DCT (MDCT) in audio coding¡D The transform processors realized using the parameterized IP modules have advantages of locality¡Amodularity¡Aregularity¡Alow-cost¡Aand high-throughput¡D Furthermore ¡Athe computation accuracy can be easily controlled by selecting different numbers of IP modules with proper parameters in the processors.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0816104-104016 |
| Date | 16 August 2004 |
| Creators | Lee, Chung-Han |
| Contributors | Shen-Fu Hsiao, Wei-Chih Hsu, Yun-Nan Chang, Chien-Hsing Wu, Shiann-Rong Kuang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0816104-104016 |
| Rights | restricted, Copyright information available at source archive |
Page generated in 0.0023 seconds