| Summary: | 碩士 === 國立臺灣科技大學 === 工程技術研究所 === 82 === This paper presents a new fast discrete cosine transform (FDCT)
by means of the modified coset decomposition (MCD) and a
developed cosine formula. Here we consider two specific cases
are N=P1*P2 and N=(power .lambda. of 2)*P, where P1,P2,P are
all .lambda.>0 First of all, we select the proper generator
carefully by MCD to split the output indexes of DCT into
several cosets. And each of these cosets is summed by several
circular correlation (CC) or circular correlation (SCC). Among
these correlations,for a coset, there exists some subtle
relation, however, a developed formula is available to combine
them into just one which is again in the inverse transform(
IDCT). Therefore the least achieved and a unified chip is
feasible. Futhermore, the parallel computation is cerdit
because of the independence of the cosets. Since each output
can be obtained through only one CC or SCC, the modularity
design such as fast matrix processor, systolic array
distributed arithmetic (DA) is feasible.
|
|---|
