scientific article; zbMATH DE number 926141

zbMATH Open0876.68059MaRDI QIDQ4891607FDOQ4891607

Authors:

Publication date: 7 November 1996

Title of this publication is not available (Why is that?)

Recommendations

• Efficient prime factor algorithm and address generation techniques for the discrete cosine transform
• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
• Prime factor algorithm for multidimensional discrete cosine transform
• An Efficient Unified Framework for Implementation of a Prime-Length DCT/IDCT With High Throughput
• Integer DCTs and fast algorithms
• Hardware-Efficient Realization of Prime-Length DCT Based on Distributed Arithmetic
• Symmetric Prime Factor Fast Fourier Transform Algorithms
• Invertible integer DCT algorithms
• A pipeline design of a fast prime factor DFT on a finite field

zbMATH Keywords

VLSI architecturesDFT prime factor computation

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited In (5)

• Improved DCT-DST prime factor algorithms.
• Efficient prime factor algorithm and address generation techniques for the discrete cosine transform
• On the computation of the prime factor DST
• An Efficient Unified Framework for Implementation of a Prime-Length DCT/IDCT With High Throughput
• A pipeline design for the realization of the prime factor algorithm using the extended diagonal structure

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4891607)