Explore >> Select a destination
|
You are here 
|
www.righto.com | ||
| | | | |
www.craigstuntz.com
|
|
| | | | | ||
| | | | |
www.hughrawlinson.me
|
|
| | | | | Blog Post titled Audio Feature Based Synthesis Part 1: The Building Blocks - check out this blog post on hughrawlinson.me | |
| | | | |
blog.gremblor.com
|
|
| | | | | [AI summary] The author details a two-year journey of designing and building a custom analog synthesizer system called the GS-101 from scratch, utilizing Eurorack format modules and semi-modular architecture. | |
| | | | |
www.jeremykun.com
|
|
| | | Problem: Compute the product of two polynomials efficiently. Solution: import numpy from numpy.fft import fft, ifft def poly_mul(p1, p2): """Multiply two polynomials. p1 and p2 are arrays of coefficients in degree-increasing order. """ deg1 = p1.shape[0] - 1 deg2 = p1.shape[0] - 1 # Would be 2*(deg1 + deg2) + 1, but the next-power-of-2 handles the +1 total_num_pts = 2 * (deg1 + deg2) next_power_of_2 = 1 << (total_num_pts - 1). | ||
