Efficient prime factor algorithm and address generation techniquesfor the discrete cosine transform

摘要

Proposes an efficient prime factor algorithm for the discretencosine transform. In the proposal, we formulate the decompositionndirectly, by using the proposed input and output mapping, a novelnin-place address generation scheme for input index mapping is derived,nwhile the formulations in the literature require a table to store thenindex mapping. The approach requires one output index mapping only whilenthe conventional algorithms require two index mappings. Hence, by usingnthe proposed mappings and address generation techniques, less temporarynstorage is required, such that a reduction of memory requirement can benachieved during the implementation. A comparison of the addressngeneration time between our approach and the conventional approach isnalso shown