Neuronal Computation Using High Order Statistics使用高阶统计量的神经计算.pptVIP

DCSP-Revision Jianfeng Feng Department of Computer Science Warwick Univ., UK Jianfeng.feng@warwick.ac.uk http://www.dcs.warwick.ac.uk/~feng/dcsp.html Fourier Thm. Any signal x(t) of period T can be represented as the sum of a set of cosinusoidal and sinusoidal waves of different frequencies and phases Frequency domain Example I 2/p |X(F)| Time domain = If the periodic signal is replace with an aperiodic signal (general case) FT is given by FT in complex exponential Is that deadly simple? Defined the information contained in an outcome xi in x={x1, x2,…,xn} I(xi) = - log2 p(xi) H(X)= Si P(xi) I(xi) = - Si P(xi) log2 P(xi) Information Entropy An instantaneous code can be found that encodes a source of entropy H(X) with an average number Ls (average length) such that Ls = H(X) Shannons first theorem  Ls = 0.729*1+0.081*3*3+0.009*5*3+0.001* 5 = 1.5980 (remember entropy is 1.4) Huffman coding code length The DTFT gives the frequency representation of a discrete time sequence with infinite length. X(w): frequency domain x [n]: time domain Definition and properties: DFT III Definition: The discrete Fourier transform (DFT) and its own inverse DFT (IDFT) associated with a vector X = ( X[0], X[1], … , X[N-1] ) to a vector x = ( x[0], x[1], …, x[N-1] ) of N data points, is given by clear all close all sampling_rate=100;%Hz omega=30; %signal frequecy Hz N=20000; %total number of samples for i=1:N x_sound(i)=cos(2*pi*omega*i/sampling_rate); %signal x(i)=x_sound(i)+2*randn(1,1); %signal+noise axis(i)=sampling_rate*i/N; % for psd time(i)=i/sampling_rate; % for time trace end subplot(1,2,1) plot(time,x); %signal + noise, time trace xlabel(second) ylabel(x) subplot(1,2,2) plot(axis,abs(fft(x)),r); % magnitude of signal xlabel(Hz); ylabel(Amplitude) sound(x_sound) Mysterious sound Simple