Pages that link to "Item:Q4054637"
From MaRDI portal
The following pages link to The use of finite fields to compute convolutions (Q4054637):
Displaying 13 items.
- Even faster integer multiplication (Q306687) (← links)
- Finite field trigonometric transforms (Q429771) (← links)
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
- Cosine transforms over fields of characteristic 2 (Q897337) (← links)
- Fast Fourier transformation based on number theoretic transforms (Q1123580) (← links)
- Fractional cosine and sine transforms over finite fields (Q1947085) (← links)
- Semi-systolic Modular Multiplier over GF(2m) (Q3512542) (← links)
- Precise deconvolution using the Fermat number transform (Q3750038) (← links)
- Obtaining Specified Irreducible Polynomials over Finite Fields (Q3963112) (← links)
- Computational Complexity of Fourier Transforms Over Finite Fields (Q4140387) (← links)
- Discrete Weighted Transforms and Large-Integer Arithmetic (Q4286602) (← links)
- Group Convolutions and Matrix Transforms (Q4721954) (← links)
- A novel approach for defining a Hilbert number transform (Q6046505) (← links)
