0:00:14the morning um
0:00:16or this works you know about this work
0:00:18and do we start the to do you want something make is the coverage you mission we probably
0:00:24channel state information sharing
0:00:26a a more efficient
0:00:30we we to
0:00:31yeah you the background of rocks and deprive
0:00:34the model
0:00:36that's so a scroll to myself a combination strategy for both
0:00:41so use that information about uh
0:00:44the
0:00:45totally
0:00:51a
0:00:51you you were also free you you to in the world
0:00:54is there
0:00:55the received a a major one that what to be high
0:00:59so see
0:01:00uh
0:01:01and the message that really coverage you transmission and all of them have but they did
0:01:06my D point commission
0:01:08is a promising solution to hide we there
0:01:11yeah we um
0:01:14to
0:01:14uh
0:01:15call it or structure
0:01:17for a a to much research
0:01:20relation
0:01:21oh a multiple
0:01:23but but station
0:01:24i you to us
0:01:25we need to five recordings
0:01:28um
0:01:28a a want to be so my people
0:01:31when you press
0:01:31incorporating there
0:01:33we kind of summarise is that
0:01:35uh
0:01:36the general procedure predictor of one
0:01:39click your contribution
0:01:40you
0:01:41turns
0:01:42for follows
0:01:44for a should station
0:01:46at is uh
0:01:47the channel
0:01:48from to all you for
0:01:51it is a a a a in right channel reciprocity
0:01:54and
0:01:55for work
0:01:55and four
0:01:56for that that have to men the node what to the to you need to buy a recording
0:02:01how to get all all of that all channel from all users
0:02:06that's it
0:02:07you of the recorder will all
0:02:09oh all this issues
0:02:11and then broadcast
0:02:12that precoder two
0:02:14i i to the should by
0:02:17then um
0:02:18the the is come from
0:02:20draw down information
0:02:22so all you
0:02:24and we uh uh we do not to use the procedure
0:02:27yes
0:02:27so
0:02:28a a to you need to process just a calls all a precoder
0:02:32computed exactly
0:02:33you can use
0:02:37of the performance gain all considered calm transmission
0:02:40uh
0:02:41set on cost or other or at and
0:02:44but you you know the rules
0:02:46one to and a channel information sharing
0:02:49uh
0:02:49in true
0:02:51uh and sorry for me a sharing between big
0:02:53yeah
0:02:54station
0:02:55we be perfect
0:02:56so is that some work
0:02:58uh
0:02:59if there is a
0:03:01a in parallel
0:03:03oh
0:03:04in channel state from injury
0:03:06oh we test
0:03:07for one uh a uh i U K twelve
0:03:10and
0:03:11whichever all
0:03:12so a car to the region
0:03:15and every two or three
0:03:16uh can be don't but he's a with such as from a sharing
0:03:20to to and the proposed
0:03:22um
0:03:23a some to to record
0:03:26in in a the total available
0:03:28a a that the
0:03:31fact
0:03:32um are you are to be for me
0:03:34we sharing
0:03:35yeah i i hundred and see
0:03:37uh in country deployed
0:03:39so that runs
0:03:40the point of it
0:03:42yeah order of ten
0:03:45and i do we can find that say
0:03:47the that
0:03:48last
0:03:49try to century use
0:03:51do you need setting to do this
0:03:53the channel delay
0:03:54oh a at of E
0:03:55to two that
0:03:56be addition to to to it is to be patient
0:03:59from for which
0:04:00maybe you um
0:04:02to three from and
0:04:03uh
0:04:05to the day
0:04:06information
0:04:07so i you talk we propose you column
0:04:10a strategy to anyway says that
0:04:13the let by
0:04:14uh recording
0:04:18a a there uh
0:04:19and two D comp time with for the to don't not the iterations
0:04:24and uh uh we can do
0:04:26C is great you two
0:04:28uh uh do you
0:04:30a a job so maybe you uh
0:04:33for
0:04:33you the ones in there
0:04:35know how we can
0:04:36press that
0:04:38if you you know what you but it's creation
0:04:41uh where X i that data you people that i which
0:04:45sure that be efficient
0:04:47and do we try to locate role
0:04:51if you can they should uh i
0:04:53a but i is the precoding vector all
0:04:56i
0:04:57and
0:04:57the time that i
0:04:59that and the mean and a variance
0:05:01yeah
0:05:03also we can define
0:05:05uh the the channels
0:05:06from
0:05:07okay
0:05:07to all use this by H L P
0:05:10later
0:05:13uh we consider that says that addition
0:05:15have to the channels
0:05:17a time segment at all
0:05:19for
0:05:20and you have he
0:05:22we are the channel you name that for every
0:05:25where uh
0:05:27have the we need a priority for each all channels that that objects
0:05:30and that you would be
0:05:31we not at every week that of the channel
0:05:34uh but is a question
0:05:36oh we we K i have to go and
0:05:39so
0:05:40estimate
0:05:41addition
0:05:42and uh yeah okay K that all the channel estimation error
0:05:45where is a fees we can also but
0:05:48in to
0:05:52here we propose propose a a
0:05:55you
0:05:56you drive myself of the G
0:05:59need to be the issue that
0:06:01i
0:06:01uh uh can be
0:06:03from
0:06:03for
0:06:04for a to each station
0:06:06estimates to
0:06:07a channel from you to you for us
0:06:09uh we done in china
0:06:11do
0:06:12and the for what uh
0:06:14and the for channel estimate
0:06:16i
0:06:18i get a check from all stations
0:06:22a given you
0:06:23rock of the channels
0:06:25all they the bad things
0:06:27so i think it's midnight addition kind of no
0:06:31uh the channel for all permutations
0:06:33that's a uh
0:06:35you parents
0:06:35uh
0:06:36a while back
0:06:38is
0:06:40yeah
0:06:40then the be efficient and we estimate
0:06:43a channel from you to all
0:06:45you all your course
0:06:46you
0:06:47i i own precoder with all or or channel state information
0:06:51and and uh the opposition come from only
0:06:54one
0:06:55transition to all you
0:06:58we some right picture
0:07:00for uh
0:07:01the they should process of G
0:07:03so a
0:07:05uh
0:07:06recorders at it's different
0:07:07efficient at each sign
0:07:09eventually
0:07:10i
0:07:11a to each coefficient just why we it
0:07:14processing as G
0:07:16and uh
0:07:18and all of the coverage of addition
0:07:21have the same
0:07:22symbol
0:07:23you know a a probably "'cause" you don't the
0:07:26make is the sum rate
0:07:28you
0:07:29and uh
0:07:31at at that the channel and a different stations
0:07:35a a different by at
0:07:36uh a should be a at each bit position no uh
0:07:40uh
0:07:41include a a a a a a are three possible channels
0:07:44and and that cost
0:07:46uh channel
0:07:47estimates is from
0:07:49so that they to all you press
0:07:51and the cost uh
0:07:53the channel uh
0:07:54mean
0:07:55or are they should shed but to you need
0:07:58and the source of party the
0:08:00find that the estimated the channel state
0:08:03mission
0:08:04uh
0:08:05uh from a addition to all
0:08:08you
0:08:09so S T G by a that a the paper is uh
0:08:13the problem precoder time problem for the into the remote call team in theory
0:08:18uh
0:08:19to you meeting problem
0:08:22and by
0:08:23might be show the
0:08:24suboptimal solution
0:08:26where
0:08:28we are one
0:08:29you make sure of to my
0:08:31uh
0:08:32both
0:08:33you you happens in members
0:08:35but
0:08:37which are quite a a a a a a of the sharing of few models
0:08:40and
0:08:41a but if you can make first
0:08:43but also
0:08:44yeah or that he does not real
0:08:46a sharing a diffusion variables
0:08:48reference
0:08:49a T i one and
0:08:51uh the sharing of a a a a a a a bit
0:08:54if you were able
0:08:55we uh winter the but in a
0:08:58to reach you
0:09:00it
0:09:00and that was hard to the share you models
0:09:03well come if these
0:09:05the be all
0:09:06so
0:09:08so the basic idea of of of the problem there that uh
0:09:12uh
0:09:12each base for
0:09:15uh
0:09:16three
0:09:16from
0:09:17that's estimate set
0:09:18uh as the means of the are are recall
0:09:21and
0:09:22my own
0:09:23there
0:09:23so that
0:09:24can change is what's to the channel should be able to
0:09:27uh
0:09:28to uh to mean estimates are really efficient code and known man
0:09:33for
0:09:34efficient
0:09:35have
0:09:35to where C
0:09:36oh well
0:09:37a local channel
0:09:39this means that uh
0:09:41the channel from one tool
0:09:44uh why is that
0:09:46for
0:09:47uh
0:09:48but you can be don't by
0:09:50and uh
0:09:52and the final portion
0:09:53we we don't by previous
0:09:55so
0:09:58or of the channel
0:10:00channel of each way
0:10:02uh
0:10:02okay
0:10:03we we have that
0:10:04my
0:10:05a a game but by outside
0:10:07the current paper we that
0:10:09you is that
0:10:10probably five
0:10:12uh
0:10:12to estimate and the yeah that's
0:10:15a a and channel four
0:10:17at the time
0:10:18so it's uh
0:10:20you you to to mentor the precoder design
0:10:22at each iteration trends seen the problem
0:10:25they should know what time
0:10:27yeah
0:10:28some uh
0:10:29that's a
0:10:29you
0:10:32we uh we
0:10:34the which
0:10:34every a summary and
0:10:36and
0:10:36Q
0:10:37uh yeah i uh
0:10:40right
0:10:40a right right
0:10:41yeah
0:10:43i
0:10:44can be approximated by a um
0:10:47function
0:10:48here
0:10:49additional try
0:10:50can and uh
0:10:51a by using
0:10:53uh
0:10:54change but in into the computer to channel uh channel model
0:10:59a a that we can formulate the
0:11:01a vision problem
0:11:03uh for those uh
0:11:04we make my
0:11:06my uh
0:11:07a it's and the subject
0:11:09the
0:11:09proposition one
0:11:11yeah that okay that
0:11:14because you image
0:11:15and
0:11:16okay
0:11:17and uh
0:11:19yeah
0:11:20the problem is is only a non-convex problem
0:11:23uh you are to fill so we um
0:11:25we use the uh the concept of read profile
0:11:28a you by seven
0:11:30uh
0:11:32which you
0:11:33which he defined as a that we show all of my
0:11:36which you
0:11:37it rates
0:11:38oh we're the
0:11:39over the rate
0:11:41so you went
0:11:42uh
0:11:43a five we can
0:11:44my the
0:11:46i'm rate
0:11:46okay
0:11:47uh
0:11:48mean in all three
0:11:50and uh
0:11:51well
0:11:51for
0:11:52proposition four
0:11:55is the um
0:11:57problem can be re
0:11:59and you
0:11:59i rate and and
0:12:01they four
0:12:02i i know uh
0:12:03but it using
0:12:04to
0:12:05a
0:12:06i
0:12:07and uh
0:12:08at this not close
0:12:09a
0:12:10the
0:12:11i
0:12:11one
0:12:12train
0:12:13but uh
0:12:14there a suboptimal solution
0:12:16the problem can be obtained by in that
0:12:18estimate that
0:12:19to pronunciation
0:12:20a miss it
0:12:21a given by right
0:12:23and and one is that
0:12:25so
0:12:26no common
0:12:27a a constraints and that
0:12:29obtained a to me the programming
0:12:31but but problem
0:12:34now we use some rice the yeah
0:12:37to so called or
0:12:38and each
0:12:39for at each base station
0:12:41you and
0:12:42file
0:12:43um
0:12:44since all that let's
0:12:46P
0:12:48the
0:12:48section true
0:12:49and a change the optimal side
0:12:52so
0:12:53type of rock one that we can
0:12:55change
0:12:56and i by
0:12:57but
0:12:58competition
0:12:59a the last uh
0:13:00and do night vision is so the company
0:13:03can be used to obtain a
0:13:06and
0:13:07P
0:13:07a one step two to all possible it provides
0:13:11and and optimal down i
0:13:13the one thing
0:13:14well
0:13:15the model of
0:13:16some
0:13:18and
0:13:19keep important to note that so you you should know
0:13:21need to
0:13:23the stuff
0:13:24two
0:13:24um
0:13:25don't
0:13:26to updating
0:13:27a coder
0:13:28to ensure that
0:13:29a know from um
0:13:30right
0:13:31not to with multiple efficient
0:13:33um
0:13:34and be
0:13:35but
0:13:36uh combine the contract you
0:13:38uh which can be done by a
0:13:40right be sure that said
0:13:42but i mean
0:13:42i a the right part
0:13:44he's
0:13:44i
0:13:46i
0:13:49uh
0:13:50we with it so
0:13:52a a a real
0:13:53yeah
0:13:53true
0:13:54and uh
0:13:56to to us in this and that
0:13:58so
0:13:58so it ever
0:14:01uh we didn't read
0:14:02a time but general
0:14:04because model
0:14:06the um
0:14:06cool
0:14:08true
0:14:09are you the pull
0:14:12a finger also with you
0:14:14rate
0:14:15a sure what they are at the
0:14:17and the uh
0:14:19such
0:14:20so T and the whole
0:14:22if they should present
0:14:24a
0:14:24a future
0:14:26currently for case
0:14:27you probably
0:14:29jerry
0:14:30and you in the case of
0:14:31both
0:14:32that is
0:14:33a i have the same performance
0:14:36the curly
0:14:37uh
0:14:38for
0:14:40a station
0:14:41i think that you
0:14:43curvy
0:14:44a
0:14:48that's
0:14:50that
0:14:51that
0:14:51this
0:14:53G
0:14:54i
0:14:55and weights
0:14:56well
0:14:57uh and and i think for a dense
0:15:01okay
0:15:02conclusion
0:15:04i
0:15:04proposed and you only on that
0:15:07work
0:15:08uh
0:15:09G
0:15:12i
0:15:13P
0:15:14uh
0:15:15a to to
0:15:17right
0:15:18that because the U
0:15:19if and you for providing a
0:15:22or
0:15:23the
0:15:23uh
0:15:24position
0:15:26for that G
0:15:28a a it had a very high complexity
0:15:30male
0:15:32you do sign
0:15:33black
0:15:34and and uh
0:15:35that
0:15:36efficient use it all out
0:15:38i
0:15:38should
0:15:41you
0:16:11uh
0:16:19the
0:16:19shen
0:16:20and so this uh
0:16:34uh
0:16:35yes actually in the
0:16:37you know that
0:16:39we you don't you
0:16:41the case of can
0:16:43what
0:16:43only five uh
0:16:45one uh
0:16:47uh
0:16:48maybe more
0:16:50yeah
0:16:51B