Pages that link to "Item:Q2017622"
From MaRDI portal
The following pages link to Fast algorithm for discrete fractional Hadamard transform (Q2017622):
Displaying 9 items.
- A low-complexity approach to computation of the discrete fractional Fourier transform (Q2405996) (← links)
- Decomposition of binary matrices and fast Hadamard transforms (Q2493321) (← links)
- Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform (Q2732961) (← links)
- Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform (Q2732965) (← links)
- Split manageable efficient algorithm for Fourier and Hadamard transforms (Q2734280) (← links)
- (Q3054140) (← links)
- Fast algorithm for calculation of both Walsh-Hadamard and Fourier transforms (FWFTs) (Q3481209) (← links)
- Fast computation of the discrete Walsh and Hadamard transforms (Q4503346) (← links)
- Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms (Q4564476) (← links)