• Recent
  • Compose
  • Select the "Compose" tab to start a new discussion

kelly lochbaum closed mouth

Started by sonoro in comp.dsp3 hours ago

Trying to implement kelly lochbaum for vocal tract I have a problem to represent closed mouth: 0 area gives a k=1, (total reflection of...

Trying to implement kelly lochbaum for vocal tract I have a problem to represent closed mouth: 0 area gives a k=1, (total reflection of presure wave seems ok to me) but 1+k=2 means pressure is not 0 in last tube section just after this junction. What am i misunderstanding? Thanks for your attention victor bombi --------------------------------------- Posted through http://www.DSPRelated.c...


Reed-Solomon FEC necessary to have the same characteristic for symbols and words?

Started by lrq3000 in comp.dsp7 hours ago 2 replies

Hi there, I have implemented an almost "universal" (read: compatible with most other decoders output) Reed-Solomon codec. I feel like I have a...

Hi there, I have implemented an almost "universal" (read: compatible with most other decoders output) Reed-Solomon codec. I feel like I have a good intuitive grasp on the whole codec, except for one thing: I just can't understand why we are tied to the same characteristic at both the symbol level and at the word level. Let me explain: if for example you choose to work on GF(2^8), this means ...


Round-half-even or Round-toward-nearest

Started by Kathy_pdx in comp.dsp15 hours ago 1 reply

I just finished the reading of An introduction to different rounding algorithms, http://www.eetimes.com/document.asp?doc_id=1274485. I...

I just finished the reading of An introduction to different rounding algorithms, http://www.eetimes.com/document.asp?doc_id=1274485. I must admit I never pay much attention on the trick of the quantization. The approach of Round-toward-nearest is always used in my design. Did anyone have practical experiences to show the DSP filter performance improved or degraded by using Round-half-even ins...


detecting an echo in DTMF tone in echo canceler

Started by alpha1 in comp.dsp18 hours ago 4 replies

I am facing some issue with my echo cancellation module. I am having a correlator and an adaptive filter modules. My correlator will detect...

I am facing some issue with my echo cancellation module. I am having a correlator and an adaptive filter modules. My correlator will detect presence of echo in the DTMF tones and will activate the adaptive filter. The adaptive filter will remove the echo present in the DTMF tones. Activation of adaptive filter is done only if the correlation is above a certain threshold. My issue is t...


Need a reference for a very simple filter

Started by nadavsof in comp.dsp3 days ago 2 replies

Hello. I've developed a software that uses STFT with a very simple filter. What the software does is draw a graph of the frequencies as the...

Hello. I've developed a software that uses STFT with a very simple filter. What the software does is draw a graph of the frequencies as the y axis and of time as the x axis. The filter is used to determined which points in the graph will be painted. The filter is extremely simple, it linear, time in-variant, and simply paints only points (f,t) for which their magnitude is in a predefined...


How to plot S-Curve for TED ?

Started by Eshwar varma in comp.dsp3 days ago 1 reply

hi all , I simulated OQpsk modulated data which has 4 samples per symbol (base band). I also simulated the squaring and differentiating...

hi all , I simulated OQpsk modulated data which has 4 samples per symbol (base band). I also simulated the squaring and differentiating based Timing error detector .Now i want to know how well is it performing for that i want to simulate and draw the s -curve. can anyone suggest me a best method to plot s-curve! thanks in advance...


The Best Name for Signal Recovery Matched Filtering

Started by Bret Cahill in comp.dsp3 days ago 12 replies

I just assumed "matched filtering" included the deconvolution and other steps to recover the original signal's shape. In this case it was...

I just assumed "matched filtering" included the deconvolution and other steps to recover the original signal's shape. In this case it was actually easier to invent a new filter -- I assumed it already existed -- than to be scholarly and do some research. To avoid confusion with the terminology from now on the filter that takes the convolution of a noisy signal like a conventional matche...


FFT Fast Convolution: How To Apply Window to minimize crackling

Started by scorprulebad in comp.dsp4 days ago 4 replies

Hello I am new to this forum so at first I want to say hello to everyone :) I am trying to make a fast fft convolution (FFT_Blocksize=1024...

Hello I am new to this forum so at first I want to say hello to everyone :) I am trying to make a fast fft convolution (FFT_Blocksize=1024 samples) of an headpone related impulse response (L=512 samples) with an sine wave audio signal. Here you can see the plots of the time Signals: impulse response: http://fs2.directupload.net/images/150617/fc9j6cs7.png audio signal block: http://fs1....


Newbie: Help with acoustic signature detector

Started by Leonardo Capossio in comp.dsp5 days ago 3 replies

Hello, I am a newbie in DSP, but have received courses in LTI systems, FIR and IIR filters, convolution, and have extensive knowledge on FPGA...

Hello, I am a newbie in DSP, but have received courses in LTI systems, FIR and IIR filters, convolution, and have extensive knowledge on FPGA architectures and development (mostly non-DSP stuff, in DSP only FIR/IIR filters). I would like to make a system that detects audio-frequency signatures, but lets say mostly periodic signals (let's say i would like to detect up to the 2nd harm


Bit Growth in a complex multiplier

Started by sachinwannabe in comp.dsp5 days ago 4 replies

What is the bit growth of a complex multiplier? (a + bj)* (c +jd) = (ac - bd) + j(ad + bc). So conventional bit growth suggests if a, b, c,...

What is the bit growth of a complex multiplier? (a + bj)* (c +jd) = (ac - bd) + j(ad + bc). So conventional bit growth suggests if a, b, c, d = 1.9 representation (-512 to 511), the real and conventional components should have 9*2 + 1 = 1.19 representation. But really the magnitude only grows A.B (using Euluer), where A= mag(a + jb) and B = mag(c + jd). So do I really only need 18 bits and n...


Sign up
or Sign in