Skip to main content
Share Your Experience: Take the 2024 Developer Survey

New answers tagged

2 votes

Baseband downconversion without imaging

@moltarze Still you did not implement down conversion correctly, I think. Let $x[n] = x_r[n] + ix_i[n]$ be the input signal to be down-converted by the carrier $$c[n] = e^{-in\text{arg}} = \cos(n\...
AHT's user avatar
  • 335
1 vote

Baseband downconversion without imaging

Keep in mind that multiplying an input time-domain signal by a cosine wave (or a sine wave) is "modulation" and NOT "frequency translation." To implement frequency translation you ...
Richard Lyons's user avatar
2 votes

How do I calculate the bits of resolution in my derived value?

That depends largely on the constants and how you implement the multiplication. If you multiply two signed fixed point numbers with lengths of $B_1$ and $B_2$ the result will be a signed fixed point ...
Hilmar's user avatar
  • 45.3k
0 votes

Constant Q transform where you keep the window size constant (so Q is no longer constant)?

This is equivalent to just doing a single DFT, and then interpolating the spectrum to get fractional bin indices for arbitrary frequencies. You don't get any extra information compared to a standard ...
cloudfeet's user avatar
  • 301
1 vote

How can I use a constant Q transform to detect low frequencies without making the buffer size too large?

It sounds like you are asking why the human ear can distinguish piano low notes quickly, yet this algorithm needs more than one second to do the same. The answer becomes apparent if you run a piano ...
scottd's user avatar
  • 11

Top 50 recent answers are included