Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Feature Request: Faster DCT #245

Open
AlexHarker opened this issue Aug 17, 2023 · 0 comments
Open

Feature Request: Faster DCT #245

AlexHarker opened this issue Aug 17, 2023 · 0 comments
Labels
enhancement New feature or request

Comments

@AlexHarker
Copy link
Contributor

AlexHarker commented Aug 17, 2023 •
edited

Is your feature request related to a problem? Please describe the problem.

DCT is slow for big sizes because it is a brute force implementation and the processing complexity is O(n^2) - initialisation is either O(n^2) or O(n^3)....

Describe the solution you'd like to see.

A faster DCT (possibly using FFT) and possibly implemented by @lewardo

Describe alternatives you've considered

Getting a supercomputer

Additional context

PA agrees with me
@AlexHarker AlexHarker added the enhancement New feature or request label Aug 17, 2023
@AlexHarker AlexHarker changed the title Feature Request: Feature Request: Faster DCT Aug 17, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@AlexHarker