signal-processing

问题 Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 4 years ago . Does anyone know of a good C/C++ wavelet library for signal processing? The signal is float or double valued, not int valued. 回答1: Without more information or clarification of what you mean by good (Good for what ?), it is difficult to make any recommendation. Some C/C++ Wavelet libraries are listed below.

问题 Whats a good digital signal processing algorithm that is good on guitar chords? Since Fast Fourier Transform I think only is accurate on single notes played on the guitar but not notes that are played simultaenously (i.e. chords). Thanks! 回答1: The short answer is that you need much more than one algorithm. Good chord recognition methods could more aptly be described as "systems", but usually they are indeed based on an initial transform to the frequency domain (most often DFT). If you want a

问题 I need to calculate 3D cross-correlation in MATLAB. Anyone know which function I should use? For 2–D cross-correlation it has xcorr2 , but I don't know about is 3D. 回答1: Correlation is similar to convolution except that one does not need to flip an input about the origin (but correlation needs taking the complex conjugate of one of the operands), so for 3D real matrices, you can use convn(x3d,y3d(end:-1:1,end:-1:1,end:-1:1)) to compute 3D cross correlation. 来源： https://stackoverflow.com

问题 Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 2 years ago . Where can I find a free, very quick, and reliable implementation of FFT in C#? That can be used in a product? Or are there any restrictions? 回答1: AForge.net is a free (open-source) library with Fast Fourier Transform support. (See Sources/Imaging/ComplexImage.cs for usage, Sources/Math/FourierTransform.cs for

问题 Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 2 years ago . Where can I find a free, very quick, and reliable implementation of FFT in C#? That can be used in a product? Or are there any restrictions? 回答1: AForge.net is a free (open-source) library with Fast Fourier Transform support. (See Sources/Imaging/ComplexImage.cs for usage, Sources/Math/FourierTransform.cs for

问题 I try to make random loss from a given bit stream. Assume that I have a bit stream as 10 01 10 11 00 Now I will create a code to implement random loss. The function with two inputs are original bit stream and percent loss. Output function is output bit stream int* bitloss(int* orbit,int size_orbit,float loss_percent) { srand(time(NULL)); int* out_bitstream=(int*)malloc(sizeof(int)*size_orbit); double randval ; for(int i=0;i<size_orbit,i++) { randval = (double)rand()/(double)RAND_MAX; if

问题 I try to make random loss from a given bit stream. Assume that I have a bit stream as 10 01 10 11 00 Now I will create a code to implement random loss. The function with two inputs are original bit stream and percent loss. Output function is output bit stream int* bitloss(int* orbit,int size_orbit,float loss_percent) { srand(time(NULL)); int* out_bitstream=(int*)malloc(sizeof(int)*size_orbit); double randval ; for(int i=0;i<size_orbit,i++) { randval = (double)rand()/(double)RAND_MAX; if

问题 I am studying image processing these days and I am a beginner to the subject. I got stuck on the subject of convolution and how to implement it for images. Let me brief - there is a general formula of convolution for images like so: x(n1,n2) represents a pixel in the output image, but I do not know what k1 and k2 stand for. Actually, this is what would like to learn. In order to implement this in some programming language, I need to know what k1 and k2 stand for. Can someone explain me this

问题 I have also asked the query few days before because the clarification was vague so that's why I am uploading a query with updated views.Link is as follows. Updated :Technique used to control Step sizes (Quantization levels) of signals I am explaining example data here because it is not possible for me to mention my original data. I have plotted a histogram curve along with ks density. I have placed bin size =10 and bandwidth of ks Density curve to be 0.08. Actually I want to analyze the

问题 I cannot find any documentation on how the BiquadFilterNode.Q value works if you set the BiquadFilterNode.type to be 'notch' . The notch filter should, in practice, attenuate signals within a range of frequencies, but BiquadFilterNode.frequency seems to control "the center of the range of frequencies" and the Q value is said to control "the width of the frequency band". However, there is no info on what units would be used. Say, if I want to attenuate signals with frequencies between 300 Hz -