You are on page 1of 7

Enhancement of speech signal out of mixture for hearing aid. From this mixed signal we aim to extract all the possible source signals separately. Cocktail Party In the problem of BASS we only have the mixed audio signal with us without any apriori information of how they were mixed. Application BASS: 1. Ex.BASS : Introduction Problem Statement : Most of the Real World Audio Signals are mixtures of several audio sources. Separation of specific musical signal or specific organ from orchestra or musical band 2. .

" Neurocomputing 22. "A new learning algorithm for blind signal separation. A = Mixing Matrix X = Mixture Signal X = A*[S] W = estimated unmixing Matrix (it acts as inverse approximate of Matrix ‘A’) Y = Output after unmixing (should approximate Original Source Signal ‘S’) Y = W*X The above BASS algorithm is provided in the Research Paper by Smaragdis." Advances . S2]. Paris. It assumes source signal of instantaneous nature. We then further referred to paper by Amari. Andrzej Cichocki.1 (1998): 21-34. and Howard Hua Yang. Shun-ichi. "Blind separation of convolved mixtures in the frequency domain.BASS : Mathematical Representation S1 = Source Signal-1 S2 = Source Signal-2 S = [S1 .

here. Step-3: Mixture: X = A*S is a mixed signal. We are taking Random mixing matrix (A) distributed within the Interval [-1. It is computed Y = W*X. Step-4: Estimated Unmixing Matrix: ‘W’ is an estimated matrix which acts as an inverse of ‘A’. Here the elements of mixing matrix A will be randomly choose from in [-1. The elements of estimated unmixing matrix ‘W’ will be randomly choose from in [-1. Step-5: Approximate Source Matrix: ‘Y’ is the approximation calculated of our actual source matrix. It is to be noted that we have no apriori information of ‘A’ and for the same we aim to find the values of ‘W’ so that they are close estimate of the inverse of ‘A’. we are taking synthetic source signals and random mixing matrix. ‘A’ is a mixing matrix. It is the only known parameter of our equation.1]. .1].BASS : Algorithm Step-1: As per the simulation example given in the paper.1]. Step-2: Original Mixing Matrix: Here.

Dirty Implementation .*cos(30*(0:n)). A(2.1) + a)'.1) + a)'.1) + a)'. W(1.:) = ((b-a)*rand(3. W(2.1) + a)'.:) = ((b-a)*rand(3.t+1))*y(:. %source signal3 A(1. %output signal . for t=0:n for i=1:10 %calculating delta W dW = (250*exp(-5*t)). %source signal2 signal3 = 0. W(3.:) = ((b-a)*rand(3. W = W + dW. %Reassigning W end End y = W*x.01*sign(sin((0:n)*500) + 9*cos(40*(0:n))).*(I .1) + a)'.(t+1))'))*W. %source signal1 signal2 = 0. A(3.:) = ((b-a)*rand(3.(tanh(y(:.1) + a)'.:) = ((b-a)*rand(3.:) = ((b-a)*rand(3.Code signal1 = 5*sin((0:n)*40).1*sin((0:n)*400).

Dirty Implementation – Output Plots .

In certain cases we are able to recover original sources partially. mixing sources trained our system for 10 different mixtures which in turn made our system effective towards recovering varied mixtures 4. Mixture Signal-1: Mix_1 Mixture Signal-2: Mix_2 Recovered Signal-1: Unmixed_1 Recovered Signal-2: Unmixed_2 . These. We computed unmixing matrix (‘W’) after training it through 10 mixing sources. 2.Improved Implementation Algorithm 1. At output we are able to recover both of the sources separately in most of the cases. Two sources were taken : One human voice and another of instrument. Mixing matrix(A) was randomly constructed. 3.