# Tag Info

Accepted

• 37.7k

### What Approximation Techniques Exist for Computing the Square Root?

if you want a cheap and dirty optimized power-series expansion (the coefficients for Taylor series converge slowly) for sqrt() and a bunch of other trancendentals, ...

### Why do we need DFT when we already have DTFT/DTFS?

TL, DR: world pervasive algorithms (FFT-related)! The continuous Fourier transform, the Discrete-time Fourier transform (DTFT) and the Discrete Fourier transform (DFT) share conceptually similar ...
• 30.2k
Accepted

### Algorithm to pan audio

The basic technique to place a mono source in stereo is called constant power panning. If you want to place a mono source at angle $\theta$ you can just use $A_\mathrm{amp}$ and $B_\mathrm{amp}$ as ...
• 438

### Digital Distortion effect algorithm

Thanks to the plot in Olli Niemitalo's answer I got convinced that the formula given in the book has a sign error. The non-linearity used for fuzz or distortion is always some type of smoothed ...
• 80.4k

### Efficient Magnitude Comparison for Complex Numbers

PROLOGUE My answer to this question is in two parts since it is so long and there is a natural cleavage. This answer can be seen as the main body and the other answer as appendices. Consider it a ...
• 6,903

### Efficient Magnitude Comparison for Complex Numbers

You mention in a comment that your target platform is a custom IC. That makes the optimization very different from trying to optimize for an already existing CPU. On a custom IC (and to a lesser ...
• 231
Accepted

• 12.5k

• 22.9k

### Measuring Audio Signal Similarities

You can use the Normalized Cross Correlation for that. Basically, representing each recorded sound as a vector, this gives the angle between them. Another approach is dealing with features of the ...
• 41.3k

### What Approximation Techniques Exist for Computing the Square Root?

You could also approximate the square root function by using Newton's Method. Newton's Method is a way of approximating where the roots of a function are. It is also an iterative method where the ...
• 513

### What Approximation Techniques Exist for Computing the Square Root?

because the code markup for SE seems to work like shit, i'll try to answer this more directly, specifically for the $\sqrt{x}$ function. yes, a power series can quickly and efficiently approximate ...
Accepted

### Duration of unknown rectangular pulse with additive white Gaussian noise

You want a method that removes noise while preserving edges. This cannot be achieved well by linear filtering, as you noticed yourself. I know of two approaches that might work well for your problem. ...
• 80.4k

### Algorithm to pan audio

I just wanted to point out that if you're planning to use these formulas in your code, you can get the exact same results with fewer calculations by using an angle $\theta$ between 0 and 90 degrees ...
• 61
Accepted

### Convex Optimization in Signal and Image Processing

There's a whole area of signal processing dedicated to optimal filtering. In pretty much every case I've seen the filtering problem is formulated with a convex cost function. Here's a freely ...
• 318

### Audio frequency modulation algorithm

You need to build a time varying delay, where you can modulate the delay amount over time. The peak delay modulation is a function of your maximum desired frequency shift and the modulation ...
• 32.6k
Here I expected $y(n)$ is to be computed by convolving $x(n)$ with $h(n)$, but in the equation given by Wikipedia it is shown as a matrix multiplication $y(n) = h^H(n).x(n)$. Are these two ...