A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
From MaRDI portal
Publication:5941167
DOI10.1016/S0165-1684(00)00251-6zbMATH Open1098.94598WikidataQ127517505 ScholiaQ127517505MaRDI QIDQ5941167
Author name not available (Why is that?)
Publication date: 20 August 2001
Published in: (Search for Journal in Brave)
No records found.
This page was built for publication: A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941167)