arXiv (All)
open access
BRiDCT: Fast Two-Dimensional DCTs Using SIMD: SIMD Organization, Register Blocking, and Numerical Verification
Repeated two-dimensional discrete cosine transforms (DCTs) require implementations that remain fast across several array sizes while preserving the mathematical transform. Fewer arithmetic operations do not guarantee a faster DCT: execution time also depends on how the computation uses the CPU's sin
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
- How well do fast discrete trigonometric transforms work for parametric numerical integration?#1109566
- Implementasi Pengamanan Data Pribadi dengan QR Code Terenkripsi Advanced Encryption Standard (AES) pada Gambar Digital Metode Discrete Cosine Transform (DCT)#250528
- PACO: A Fully Cache-Oblivious Parallel FFT with One Global Redistribution#974025
- Bandwidth, Not FLOPS: FFT Kernels, Matrix Units and SAR Imaging on Apple M6#1116568
- Performance Evaluation of Fast Fourier Transforms on Emerging RISC-V Hardware with Vector Extension Support#784839
Record · ID 1076176
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