arXiv (OAI Expanded)
open access
How well do fast discrete trigonometric transforms work for parametric numerical integration?
The fast Fourier transform (FFT) and its real counterparts, the fast algorithms of the discrete cosine transform (DCT) and the discrete sine transform (DST), are frequently employed for the numerical evaluation of the Fourier cosine and Fourier sine transform, thereby acting as parametric quadrature
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- BRiDCT: Fast Two-Dimensional DCTs Using SIMD: SIMD Organization, Register Blocking, and Numerical Verification#1076176
- Teknik IMPLEMENTASI FAST FOURIER TRANSFORM (FFT) UNTUK MENDETEKSI KENDARAAN TEMPUR JENIS TANK PADA SMART ELECTRONIC ANTI TANK: jurnal elkasista#1003118
- Implementasi Pengamanan Data Pribadi dengan QR Code Terenkripsi Advanced Encryption Standard (AES) pada Gambar Digital Metode Discrete Cosine Transform (DCT)#250528
- Mengatasi Tantangan Transformasi Digital Umkm: Tantangan Dan Solusi Melalui Kegiatan Pendampingan di Jakarta dan Bekasi#1006646
- Fast and exact winding numbers for triangle meshes#344745
Record · ID 1109566
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive