0:00:15 | a all |
---|
0:00:16 | would have to know |
---|
0:00:17 | my name is the one who's on i'm phones or nation and universe |
---|
0:00:24 | you know |
---|
0:00:25 | signal processing and williams the a team and uh |
---|
0:00:29 | much computation you yeah i especially |
---|
0:00:32 | indeed you these are the |
---|
0:00:34 | a polite detail signal processing i |
---|
0:00:37 | detection of processing |
---|
0:00:39 | that it would in terms of two |
---|
0:00:41 | or high sampling applications |
---|
0:00:44 | yeah |
---|
0:00:44 | so |
---|
0:00:48 | you you gaze |
---|
0:00:50 | yeah actually so we |
---|
0:00:52 | used to use uh |
---|
0:00:54 | we |
---|
0:00:55 | we we as i is the circus about |
---|
0:00:58 | you know what you had a architecture based the sheep use that you know it was |
---|
0:01:02 | also to |
---|
0:01:03 | and place up to the of a stopwatch |
---|
0:01:07 | but |
---|
0:01:07 | here you have this to some problems |
---|
0:01:10 | top |
---|
0:01:11 | top |
---|
0:01:12 | four is the problem is so that she |
---|
0:01:14 | the other sam she can share everybody |
---|
0:01:17 | so that you can |
---|
0:01:19 | how do you have a lot |
---|
0:01:21 | word or |
---|
0:01:23 | i guess was always signal processing algorithms are high high hell of it |
---|
0:01:28 | so |
---|
0:01:29 | one cup to what your voice you can so i would assume so uh that that based on feedback |
---|
0:01:35 | so you could have an adaptive filter is uh |
---|
0:01:40 | one audible discontinuity |
---|
0:01:42 | and the |
---|
0:01:44 | another one is uh architecture space people were not or don't have outermost in so i |
---|
0:01:51 | E twenty four we |
---|
0:01:53 | a pit i had already would you |
---|
0:01:55 | jones there are some |
---|
0:01:57 | well what have the |
---|
0:01:58 | but we do all word uh sometimes at the dollar alignment or word awhile soon corning journal where the white |
---|
0:02:04 | in top artists communication |
---|
0:02:06 | or what |
---|
0:02:09 | little |
---|
0:02:10 | the algorithm that |
---|
0:02:13 | i'm going to project here at least uh all the two but that is a filter |
---|
0:02:20 | yeah so you know what are the two that is a filter is uh use the for channel equalization noise |
---|
0:02:25 | cancelling |
---|
0:02:26 | beamforming and many applications |
---|
0:02:30 | and all the team of filter |
---|
0:02:32 | so uh components available mood you up with that |
---|
0:02:35 | so why not forties we use uh |
---|
0:02:38 | this kind of able more generality |
---|
0:02:41 | so that is awful wants to have the |
---|
0:02:45 | but |
---|
0:02:46 | but the video over panel |
---|
0:02:47 | panel of them that you can get we do |
---|
0:02:50 | this kind of will |
---|
0:02:51 | so show that it had on that you can be so high say |
---|
0:02:55 | this days ten so the filter |
---|
0:02:58 | then don't the video will have that you is just |
---|
0:03:00 | ten so |
---|
0:03:02 | for a parallel or yeah we needed to see |
---|
0:03:05 | are the kind of a of that so there's of your point for the the thought of it of it |
---|
0:03:12 | a not that question is so |
---|
0:03:14 | why they all that to elect is if it does all that table |
---|
0:03:17 | tenth to filter is um |
---|
0:03:19 | wall frequent to used |
---|
0:03:22 | well the to of the or the T what had the delay line filters |
---|
0:03:26 | uh that you've got the to had a light that had a |
---|
0:03:30 | that that can be paralysed |
---|
0:03:32 | but the what where there is a bit is do so |
---|
0:03:35 | we each to pet lights all that to that use a it |
---|
0:03:39 | and the use of those two gonna a system performance such as uh |
---|
0:03:43 | what that patients with the |
---|
0:03:45 | yeah but with a kind of battle for that you will that is |
---|
0:03:54 | so |
---|
0:03:55 | well we try to implement the disagreed the sin the and the mote acquired this dog |
---|
0:04:03 | so |
---|
0:04:03 | first uh |
---|
0:04:05 | i'm going to |
---|
0:04:08 | i'm going to |
---|
0:04:10 | pretty pretty discuss a sin then white choir architectures |
---|
0:04:14 | and |
---|
0:04:15 | a i'm like the and the pad a computational of all that two would like to the filters |
---|
0:04:20 | here |
---|
0:04:21 | ah |
---|
0:04:22 | i'm with the discuss a or of the and take out of a parallel port |
---|
0:04:28 | and that top home with this the work so |
---|
0:04:30 | have a a have a red id H a noble the in you can all see creations |
---|
0:04:35 | the you you can see K john |
---|
0:04:37 | so i use the for all the two that two filters |
---|
0:04:40 | then i'm going to sure |
---|
0:04:42 | experiment to reject to and |
---|
0:04:44 | but |
---|
0:04:45 | vol |
---|
0:04:48 | oh |
---|
0:04:49 | or |
---|
0:04:51 | in space space if you |
---|
0:04:54 | seven that had other processing feature are you |
---|
0:04:57 | one |
---|
0:04:59 | i don't use those who |
---|
0:05:02 | but also pa skylark take your |
---|
0:05:05 | we use a a what that you call a compile a couple a C |
---|
0:05:10 | does second |
---|
0:05:12 | parallel architectures is seemed that picture |
---|
0:05:14 | that is a single are used stuck what but data |
---|
0:05:17 | for the case of which and architecture |
---|
0:05:21 | we don't one instruction |
---|
0:05:23 | you can come down to |
---|
0:05:25 | say in in this a four addition |
---|
0:05:29 | at one time |
---|
0:05:31 | so |
---|
0:05:32 | this is a very efficient |
---|
0:05:35 | or processing approach |
---|
0:05:37 | well |
---|
0:05:39 | this so |
---|
0:05:40 | architecture or shows the |
---|
0:05:42 | some or word of then |
---|
0:05:44 | date i an a line this say |
---|
0:05:48 | you put be |
---|
0:05:51 | one to at the age get a to be you on a you want to P tool |
---|
0:05:54 | then and |
---|
0:05:55 | uh i there should be |
---|
0:05:58 | well well i want to step and then a novel |
---|
0:06:05 | so |
---|
0:06:09 | and always so and architecture i |
---|
0:06:11 | use a problem too |
---|
0:06:13 | or |
---|
0:06:14 | then what do but to to |
---|
0:06:19 | and the doors |
---|
0:06:22 | on not the architect had our a processor architecture that are used the shape you is a a to clock |
---|
0:06:28 | detection |
---|
0:06:31 | you know in in the you this to be here |
---|
0:06:34 | well do you are off |
---|
0:06:35 | for the claw up a lot in in soul do on global "'cause" side |
---|
0:06:40 | in you we're most there we here because a |
---|
0:06:44 | on more and more out so is uh |
---|
0:06:47 | implemented on the chip |
---|
0:06:50 | so we here form what quark architecture we need a to and play by to pursue of the so this |
---|
0:06:56 | is all point for the set of that the have of the region |
---|
0:06:59 | and of force so that that have that have a really do we need to consider either the synchronization model |
---|
0:07:04 | where the peak or do do you do pause or not |
---|
0:07:07 | working in no |
---|
0:07:10 | so |
---|
0:07:11 | uh so so all |
---|
0:07:13 | for ten so speed that can be |
---|
0:07:17 | the me to the bias in coney need additional way |
---|
0:07:27 | the |
---|
0:07:28 | that that this of the whole |
---|
0:07:30 | so |
---|
0:07:31 | in shall |
---|
0:07:35 | you can and priori |
---|
0:07:37 | they turn that there a and so that that that of the to |
---|
0:07:40 | and uh for the seemed architecture that is a date other of it and the V |
---|
0:07:45 | you to can see that date all alignment or what |
---|
0:07:48 | and of for the case of but entire as as the you for O D video of a are you |
---|
0:07:53 | miss of the media the for |
---|
0:07:55 | and of for the case on work well |
---|
0:07:58 | but T deal will have other things a proportional out to do a mobile courses so |
---|
0:08:03 | the or number bubble pause so |
---|
0:08:05 | you know that |
---|
0:08:07 | yeah |
---|
0:08:08 | you |
---|
0:08:11 | well |
---|
0:08:13 | okay |
---|
0:08:13 | this is the gradient all that to will |
---|
0:08:16 | that is to filter |
---|
0:08:19 | and that this a fit closest of will |
---|
0:08:22 | yeah a uh several steps |
---|
0:08:24 | but don't operation and each is that |
---|
0:08:27 | is a i didn't colour |
---|
0:08:29 | and the one important thing is that |
---|
0:08:32 | do fit a coefficient to a a or |
---|
0:08:35 | or that thilo by |
---|
0:08:36 | low cut and a signal |
---|
0:08:39 | or all |
---|
0:08:41 | we can all that to dull |
---|
0:08:43 | phil top quite efficient to using the global |
---|
0:08:47 | that our signal |
---|
0:08:48 | but |
---|
0:08:49 | in my to process the implementation |
---|
0:08:52 | it is a very important to use a local feed the X so |
---|
0:08:56 | oh one all the T job a parallel and i guess some for this a filter |
---|
0:09:01 | use of coming in from the fact to their uh you can use a look card field of F for |
---|
0:09:07 | for all that station |
---|
0:09:08 | yeah so |
---|
0:09:10 | so |
---|
0:09:11 | as a of filter shows |
---|
0:09:12 | but |
---|
0:09:13 | filter coefficient the K |
---|
0:09:15 | and the filter coefficient to a each she our or or that to the by a local fusion |
---|
0:09:25 | no |
---|
0:09:28 | as a i |
---|
0:09:29 | mentioned a or you'll |
---|
0:09:31 | one are be also a is so |
---|
0:09:34 | we |
---|
0:09:35 | pat a parallel i do each is that |
---|
0:09:39 | okay so this so the this is open code the crunch sort of a parallel region |
---|
0:09:44 | here are to do so |
---|
0:09:46 | we pull type dining |
---|
0:09:48 | that used is |
---|
0:09:49 | at each is stage you close that |
---|
0:09:52 | so |
---|
0:09:53 | i |
---|
0:09:54 | menu |
---|
0:09:54 | compared this to figure your |
---|
0:09:58 | and this to the guillaume E |
---|
0:10:01 | we put pipelining registers at each class it |
---|
0:10:06 | so |
---|
0:10:07 | oh |
---|
0:10:08 | but yeah i didn't type or but you turn |
---|
0:10:11 | you couldn't do |
---|
0:10:12 | computational what this so these the D just that |
---|
0:10:15 | independent to |
---|
0:10:17 | i |
---|
0:10:18 | but computational ball |
---|
0:10:21 | or it this just that have and this is step can not be |
---|
0:10:24 | yeah does same it there because of type dining they "'cause" so each is that |
---|
0:10:30 | oh one step delay does so |
---|
0:10:33 | then you we compute at time and for this is that |
---|
0:10:36 | then we need to to compute a and plus eight |
---|
0:10:40 | and plus a one for this is that so |
---|
0:10:42 | uh yeah this a |
---|
0:10:44 | well if you're the |
---|
0:10:45 | yeah this uh |
---|
0:10:47 | oh it is it shows times that |
---|
0:10:49 | and that is so it shows others |
---|
0:10:51 | yeah stage a number |
---|
0:10:52 | so |
---|
0:10:53 | it the we need to top i some skew the process |
---|
0:10:58 | but |
---|
0:10:59 | and you a |
---|
0:11:00 | what we do know is sort the pipelining used to this |
---|
0:11:04 | yeah the that in use these of high more because the but normal pipelining registers is just them |
---|
0:11:13 | but |
---|
0:11:14 | well |
---|
0:11:15 | this so the band to your boat this top low is the total number of able don't do really of |
---|
0:11:20 | a parallel a jim is a the emitted the bike to two |
---|
0:11:26 | and uh so on a approach is to use a T turn have that have a the computation take that |
---|
0:11:32 | a back a our computation |
---|
0:11:34 | means that |
---|
0:11:35 | we we try to compute to board with and press that the time so you want for of four is |
---|
0:11:41 | the uh what that to for the |
---|
0:11:43 | you can a like take out of that that the um |
---|
0:11:46 | and the you C O A you can use the ten thousand |
---|
0:11:50 | process |
---|
0:11:51 | so |
---|
0:11:52 | for eight are that it had a yeah |
---|
0:11:54 | since the V |
---|
0:11:56 | yeah fast fast racing many many samples of but they are in signal processing |
---|
0:12:00 | don't think a pair of a jim is not be to the by filter told us so use some well |
---|
0:12:05 | i didn't |
---|
0:12:06 | so is to more idea |
---|
0:12:08 | but i use a more complex |
---|
0:12:11 | here L |
---|
0:12:12 | for |
---|
0:12:12 | and so the state G |
---|
0:12:15 | it |
---|
0:12:16 | we norm value of the key and minus a lot of F and minus than |
---|
0:12:20 | and do we need the to compute to D |
---|
0:12:24 | and and a computation computation |
---|
0:12:26 | couldn't be transformed or to store the |
---|
0:12:30 | the you know the currency creation so that |
---|
0:12:33 | you shown use of high complex about |
---|
0:12:36 | do you can be a compute either |
---|
0:12:38 | we that depend noise do not depend on it means the |
---|
0:12:41 | a a three the back |
---|
0:12:44 | but i are he and my so one |
---|
0:12:47 | depend you and yeah and minus one and minus one |
---|
0:12:51 | so |
---|
0:12:56 | yeah so |
---|
0:12:58 | well this can be translated to to yeah and minus so one and |
---|
0:13:03 | you participate bit i E N minus one M mine some X the N so |
---|
0:13:08 | this it becomes up |
---|
0:13:09 | for told a constant coefficient |
---|
0:13:12 | the in you know the can creation |
---|
0:13:24 | yeah is |
---|
0:13:25 | so |
---|
0:13:26 | there are several you creations here |
---|
0:13:32 | and that |
---|
0:13:33 | or not the case a used computational able to yeah and |
---|
0:13:37 | in this case |
---|
0:13:38 | disk |
---|
0:13:39 | this |
---|
0:13:40 | can always still be come but to do to |
---|
0:13:42 | time be quite efficient to the you know the colours see cajun |
---|
0:13:47 | so okay K M and comes at eight K end times K N and minus one |
---|
0:13:52 | plus X K N |
---|
0:13:53 | for the case of what time they are the in you you can seek shown |
---|
0:13:57 | oh that's all the to be more complex so then though |
---|
0:14:00 | parallel order like duration of will |
---|
0:14:02 | tossed the coefficient case |
---|
0:14:08 | so |
---|
0:14:09 | now |
---|
0:14:10 | i and like to put a forty |
---|
0:14:12 | well you spain |
---|
0:14:13 | how be compared a like you the in you know the common seek kitchen |
---|
0:14:17 | you know |
---|
0:14:19 | the in you the currency cajun and use a the back so then |
---|
0:14:23 | that |
---|
0:14:24 | that makes the dependence problem because also |
---|
0:14:27 | to compute to Y N we need the why and my so on to Y M minus want and |
---|
0:14:32 | so |
---|
0:14:33 | oh so you since a very difficult to each is seems not a large got to compute the why and |
---|
0:14:39 | a Y and minus and Y and plus the simultaneous it but it is |
---|
0:14:45 | possible |
---|
0:14:48 | so |
---|
0:14:50 | say |
---|
0:14:52 | yeah |
---|
0:14:53 | why i though we so say you at the times a why my some plus sixty at all |
---|
0:14:59 | then |
---|
0:15:00 | oh why why mine a one is so |
---|
0:15:03 | the |
---|
0:15:04 | initial condition |
---|
0:15:05 | then |
---|
0:15:07 | since that this is a |
---|
0:15:09 | the in you know |
---|
0:15:11 | yeah different C creation |
---|
0:15:13 | you couldn't you could |
---|
0:15:14 | do calm or just leading to two part |
---|
0:15:17 | one is not time you to a solution |
---|
0:15:19 | and the yeah is a particular solution |
---|
0:15:22 | so you for be you go lot the initial condition you can compute to |
---|
0:15:27 | particular solution |
---|
0:15:28 | and that you if we can see though one you'd a particular solution |
---|
0:15:32 | a particular solution |
---|
0:15:34 | can be computed that you had other people's so |
---|
0:15:37 | yeah i i even lot thing in each can be shy and that that breaks the dependence problem |
---|
0:15:43 | then to problems are how we can |
---|
0:15:46 | well compensate for that depend problem |
---|
0:15:50 | you you these days so |
---|
0:15:51 | the in your the currency K john |
---|
0:15:57 | we can a polite blue i'd the mess that to compensate for the |
---|
0:16:02 | well effect all good initial condition |
---|
0:16:05 | so by computing |
---|
0:16:07 | had you can also lose and you a solution |
---|
0:16:10 | oh a to D |
---|
0:16:12 | no become paralysed a computational able you know the can seek age |
---|
0:16:21 | this so at the forces that |
---|
0:16:23 | it do we compute the particular solution |
---|
0:16:26 | and that does step two |
---|
0:16:28 | we prop a okay to the initial condition |
---|
0:16:31 | and that the propagation is kind to the |
---|
0:16:33 | by i in particular solution and the initial condition |
---|
0:16:37 | and the finally we compute the companies solution |
---|
0:16:41 | so do you do a of computation |
---|
0:16:44 | you the some or where the pattern or idea a symbol for the would for the case of O |
---|
0:16:49 | for although though the in you know the because uh |
---|
0:16:51 | though or why there is uh not more than twice |
---|
0:16:54 | though number of will she of computation |
---|
0:16:58 | so that instead |
---|
0:16:59 | you full we use of four processors |
---|
0:17:02 | in C D you can guess say a a on the tools that the pose and top was speed the |
---|
0:17:08 | and the for the constant the coefficient the case of tar speed or can be a how you |
---|
0:17:14 | okay this is the payment L reader |
---|
0:17:17 | a a did X meant to be the |
---|
0:17:19 | well you inter |
---|
0:17:21 | oh for the quasi C pure |
---|
0:17:23 | and the this so has a |
---|
0:17:26 | for a she in the |
---|
0:17:27 | instructions |
---|
0:17:34 | and that this this shows of though |
---|
0:17:36 | or reject to this is the fiddle the |
---|
0:17:39 | and it's of for a a was sixty in |
---|
0:17:42 | and the |
---|
0:17:43 | a a this is it you can sell which are to then |
---|
0:17:47 | processing L samples |
---|
0:17:49 | and that this is thus in the parallel the |
---|
0:17:52 | uh a processing and sample |
---|
0:17:54 | so by a plan seemed that |
---|
0:17:57 | oh be you get the speed P T in |
---|
0:17:59 | a about two hundred all |
---|
0:18:01 | fifty percent the tool |
---|
0:18:03 | two seven used to represent |
---|
0:18:06 | and that this is so these are two for data that the parallel region |
---|
0:18:12 | we sin the so |
---|
0:18:14 | this to mean that using in the instructions so |
---|
0:18:17 | you i |
---|
0:18:19 | no data level parallel to a and a be the that we get |
---|
0:18:23 | or or or are they are higher speed up |
---|
0:18:25 | well don't well but the or over a to lead them is of for whistle four |
---|
0:18:32 | a for the case to an to quell |
---|
0:18:34 | one one show that had L later |
---|
0:18:37 | we can hard but you get any game because some to quite cheap you |
---|
0:18:42 | well need the some C duration mobile but |
---|
0:18:47 | yeah a a a i'm so we do we do some sort of a parallel region with the multiple acquired |
---|
0:18:52 | B can that |
---|
0:18:53 | a a up |
---|
0:18:57 | or sort is it talk case or but data that that have a and we the not to quell and |
---|
0:19:01 | the you couldn't get a bar one hundred the pose in both speed up |
---|
0:19:06 | and the by combining portal |
---|
0:19:08 | data to better parallel do using by to core and C and you get a ball |
---|
0:19:13 | for hundred the nist |
---|
0:19:15 | yeah |
---|
0:19:16 | so to pose and top was speed up |
---|
0:19:24 | this so all experiment experiment a are two shows that |
---|
0:19:29 | oh i |
---|
0:19:30 | for |
---|
0:19:31 | for |
---|
0:19:33 | yeah |
---|
0:19:34 | for pat computation to read the took why cpus though effect of well |
---|
0:19:40 | in a mean you cajun and that's and corny duration will where the P comes of thirty problem |
---|
0:19:45 | so we need a on this or that |
---|
0:19:47 | or tech and |
---|
0:19:48 | or a but this kind of a single you a channel with that we do |
---|
0:19:53 | i'm sure about had out of a job it it a very difficult to to up so will |
---|
0:19:57 | this kind of a sink one you H job would that be do |
---|
0:20:00 | how |
---|
0:20:01 | by applying data never parallel and you can |
---|
0:20:05 | oh well or would this kind of a or where the and the still get some |
---|
0:20:10 | speed |
---|
0:20:13 | okay |
---|
0:20:14 | this is the company no but this do you have we implement T the to but tight this fit on |
---|
0:20:20 | but to in the |
---|
0:20:22 | for type the void no bought that will filter is |
---|
0:20:26 | and uh we get |
---|
0:20:28 | oh |
---|
0:20:29 | fairly close speed uh with a small right toys C then and police in the in |
---|
0:20:36 | for data that have are processing and |
---|
0:20:38 | we couldn't guess |
---|
0:20:39 | speed uh |
---|
0:20:40 | for some more to Y and dark picture |
---|
0:20:44 | and uh |
---|
0:20:46 | we believe but that this top to can be a provide the to are don't or the T that two |
---|
0:20:50 | filters |
---|
0:20:51 | and those was a sure D |
---|
0:20:54 | yeah or that to beamforming are you would |
---|
0:20:58 | thank |
---|
0:21:07 | or questions from you |
---|
0:21:16 | uh this is a |
---|
0:22:16 | i |
---|
0:22:18 | i |
---|
0:22:49 | okay there are no other questions |
---|
0:22:51 | uh |
---|