Mar
7
accepted What exactly mean X bit depth?
Mar
7
asked What exactly mean X bit depth?
Feb
28
awarded  Popular Question
Feb
12
comment Dynamic compressor - ratio in logarithmic scale problem
Hilmar, thanks for your advice. What you say seems to be obvious, but please find out $i$ on the end after brackets is my input which I think I can't replace by logarithmic equivalents, it could to destroy my input signal. I am almost sure I need to modify part in brackets which is my gain reduction multiplicator. But don't have idea how to do that.
Feb
9
revised Dynamic compressor - ratio in logarithmic scale problem
added 307 characters in body
Feb
9
asked Dynamic compressor - ratio in logarithmic scale problem
2018
Dec
30
asked Is there any opposite name for Decibel?
Oct
6
awarded  Curious
Sep
19
comment Bit reverse order Technique in FFT
Hey that’s great answer, it’s simplifying everything. But still the question is there any possible way to make that “left to right bit adding” in place, without loop, in C++?
Sep
10
comment Phase shift problem in Fast Fourier Transform
Ok You are totally right. Now I figure it out. There was problem with my signal, I had signal with two impulses on the beginning. Instead just one I had 1, 1, 0, 0, 0, 0....
Sep
10
accepted Phase shift problem in Fast Fourier Transform
Sep
10
comment Phase shift problem in Fast Fourier Transform
Ok, I am not sure about input impulse signal. So to explain it clearly, let’s suppose I have buffer size 1024, and I want to make fft for impulse response, then: 1) do I need signal like 1, 0, 0, 0... at all 1023 zeros? OR 2) do I need signal like 1, 0, 0... at all 511 zeros, again 1, 0, 0... 511 zeros? I am asking that because for me there are some misunderstanding with Nyquist freq
Sep
10
comment Phase shift problem in Fast Fourier Transform
Ok I will try, but I don’t know how to use other FFTs algorithms such as FFTw. I just wanted to use in hurry something that I know. But it looks it’s something wrong.
Sep
10
comment Phase shift problem in Fast Fourier Transform
I am not sure what are you asking for. Sometime ago I implemented various types of FFT by my own (I mean I wrote my own FFTs alghorithms). For that case I use Radix-2 for $2^L$ buffer sizes, and for else sizes I use mixed radix FFT. For both cases I get the same issue.
Sep
10
asked Phase shift problem in Fast Fourier Transform
Jul
10
comment Zero padding issue - cut the buffer
My issue looks exactly like that: I have signal with buffer size 400, and I want to perform radix-2 fft, and then for example make pitch shifting, and then perform inverse fft. But I get cut buffer size because of zero padding. How to avoid that?
Jul
10
comment Zero padding issue - cut the buffer
But here exactly I am asking how to avoid that issue which I have with radix-2 when I make zero padding
Jul
10
comment Zero padding issue - cut the buffer
It’s only one of many questions :)
Jul
10
comment Zero padding issue - cut the buffer
And no I am not going to perform filtering by zeroing freq bins. I've already done that and I know the results :) Now I am just testing FFT, and try to understand that as best as I can. For example I wonder why Radix-2 is so popular. It allows you to perform FFT only for 2L buffer sizes. But there is great FFT called Mixed Radix. It allows you to perform FFT on almost each buffer sizes. So when there is so popular sample rating 44100, why not just use mixed radix?
Jul
10
comment Zero padding issue - cut the buffer
And of course I know the result is reasonable, I said that in my question, but instead word "reasonable" I used "logical" (due to my faulty English). But the question was how to avoid those "reasonable" results. I mentioned in question that I know I can use only first 400 samples from buffer and it would work. But is there any smarter methods to do that?