A unified fast MDCT/MDST computation in the evenly stacked analysis/synthesis system

DOI10.1007/S00034-002-0315-6zbMATH Open1008.68050OpenAlexW1970734091MaRDI QIDQ1851460

Yanyan Li

Publication date: 8 January 2003

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-002-0315-6

zbMATH Keywords

modified discrete cosine transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

New recursive algorithms for the unified forward and inverse MDCT/MDST

Recommendations

• Title not available (Why is that?) 👍 👎
• The fast DCT-IV/DST-IV computation via the MDCT 👍 👎
• An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa 👍 👎
• A fast algorithm for the computation of 2-D forward and inverse MDCT 👍 👎
• Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks 👍 👎
• New recursive algorithms for the unified forward and inverse MDCT/MDST 👍 👎
• A new fast algorithm for the unified forward and inverse MDCT/MDST computation 👍 👎
• Fast IMDCT and MDCT algorithms - a matrix approach 👍 👎
• Analytical reconstruction algorithm for multiple source-translation computed tomography (mSTCT) 👍 👎

This page was built for publication: A unified fast MDCT/MDST computation in the evenly stacked analysis/synthesis system

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