A Fast, Vectorizable Algorithm for Producing Single-Precision Sine-Cosine Pairs

2004/06/25 by Marcus H. Mendenhall, Mendenhall, Marcus H.
Computer Science · Engineering · #Advanced Algorithms and Applications #FOS: Computer and information sciences #Mathematical Software (cs.MS) #cs.MS

paper · pdf · doi:10.48550/arxiv.cs/0406049

4 pages, 1 block sample code

arxiv created 2004/06/25 · openalex publication_date 2004/06/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents an algorithm for computing Sine-Cosine pairs to modest accuracy, but in a manner which contains no conditional tests or branching, making it highly amenable to vectorization. An exemplary implementation for PowerPC AltiVec processors is included, but the algorithm should be easily portable to other achitectures, such as Intel SSE.

Related

• Computing the matrix sine and cosine simultaneously with a reduced number of products
• A fast recursive algorithm for the discrete sine transform
• A Novel SIMD-Optimized Implementation for Fast and Memory-Efficient Trigonometric Computation
• Generic-Precision algorithm for DCT-Cordic architectures
• The Normalized Singular Value Decomposition of Non-Symmetric Matrices Using Givens fast Rotations