Want to learn Machine Learning (ML), Deep Learning (DL), 5G, 6G, and PYTHON? Check out our schools below! https://www.iitk.ac.in/mwn/MLDL/index.html https://www.iitk.ac.in/mwn/IITK6G/index.html IIT Kanpur Intensive Training School (ITS) on PYTHON for Machine Learning, Neural Networks and Deep Learning 2nd to 22nd December 2023 https://www.iitk.ac.in/mwn/MLDL/index.html Welcome to the IIT Kanpur Intensive Training School (ITS) on PYTHON for Machine Learning, Neural Networks and Deep Learning. This school, spanning over 3 weeks, is an intensive program for scholars, students, faculty members, industry professionals and R&D staff aspiring to get an in-depth exposure and learn hands-on implementation of the cutting edge algorithms and software for Machine Learning (ML), Neural Networks (NN) and Deep Learning (DL) toward projects, research and placements to further their career. The school will include extensive assisted PYTHON programming sessions, and numerous important packages such as NUMPY, LINALG, MATPLOTLIB, SCIKIT-LEARN, TENSORFLOW, KERAS. The school also includes problem solving sessions to prepare for tests/ job interviews in ML and DL. For an extensive list of lecture modules and hands-on programming projects, please check the PROGRAM IIT Kanpur PYTHON + MATLAB Training School on 5G/ 6G Wireless Technologies 2nd to 22nd March 2024 https://www.iitk.ac.in/mwn/IITK6G/index.html Welcome to the PYTHON + MATLAB Training School on 5G/ 6G Wireless Technologies: MIMO, massive MIMO, mmWave MIMO, NOMA, OTFS and IRS. This is a unique cutting edge project based training school that will feature exhaustive lecture modules and several PYTHON/ MATLAB projects/ case-studies on the latest MIMO, Massive MIMO, mmWave MIMO, NOMA technologies for 5G. Also, with 5G systems being rapidly deployed around the globe, there is accelerated development of Beyond 5G (B5G) and 6G wireless technologies that break the barriers of 5G. OTFS is a cutting-edge 2D modulation technique that operates in the Delay-Doppler domain, while Intelligent reflecting surface (IRS) is another novel technology that enables dynamically altering the radio propagation environment to achieve a phenomenal boost in the capacities. Together, these dual technologies are expected to power the shift to 6G. This training school will feature exhaustive tutorial style lecture modules and several intensive supervised PYTHON/ MATLAB/ OCTAVE programming modules so that participants are able to gain practical hands-on experience of working on state-of-the-art 5G/ 6G projects All modules will be held on evenings and weekends for the convenience of participants. The extensive projects and PYTHON programming for MACHINE LEARNING (ML), NEURAL NETWORKS (NN), DEEP LEARNING (DL), 5G and 6G are of significant value to participants of all backgrounds. How do these programs benefit YOU? UG/ PG students: Learn the latest programming techniques in PYTHON and various packages such as NUMPY, LINALG, MATPLOTLIB, PANDAS, SCIKIT-LEARN, SEABORN, TENSORFLOW, KERAS together with practical ML/ NN / DL/ 5G/ 6G knowledge for projects/ thesis and also to gain an unbeatable edge in placements! PhD Scholars/ Faculty members: Use PYTHON, and various packages such as NUMPY, LINALG, MATPLOTLIB, PANDAS, SCIKIT-LEARN, SEABORN, TENSORFLOW, KERAS for research and also to establish virtual labs or for project guidance in ML/ NN / DL/ 5G/ 6G Technologies with real world datasets! Industry Professionals: Take your skills to the next level by learning PYTHON, and various packages such as NUMPY, LINALG, MATPLOTLIB, PANDAS, SCIKITLEARN, SEABORN, TENSORFLOW, KERAS, together with principles of Module Design and Analysis using Practical Data Sets for ML/ NN / DL/ 5G/ 6G Technologies! Learn the latest ML/ NN/ DL/ 5G/ 6G Algorithms, PYTHON Programming & Libraries from experts at IIT Kanpur PYTHON, Machine Learning, Neural Networks, Deep Learning, 5G and 6G are the top skills for placements in leading global MNCs such as Google, Amazon, facebook, Microsoft, Qualcomm, Broadcom, Samsung, Mediatek and many others! Our industry participants have come from top global MNCs, Indian R&D Labs below and many more! Our academic participants have come from IITs, NITs, top national and international educational institutions and more! Contact Us: e-mail: [email protected] Join/ follow us on our social media sites https://www.facebook.com/people/MWN-Lab-IIT-Kanpur/100063786175713/ https://twitter.com/LabMwn https://www.linkedin.com/in/mwn-lab-7236231ba/?originalSubdomain=in
Hello, welcome to another module in this massive open online course. So, we are looking at
the problem of beam forming, that is to find the beam former or the combiner basically,
which maximizes the signal to noise power ratio for the user in a particular direction.
And we said the constraint for the signal gain. So, we are looking at the beam forming
problem. And the constraint for the signal gain is W bar transpose H bar equals 1, this
is unit gain for desired user or unit gain for signal, that is what we said, we said
the signal gain to be unity and minimizes the noise power.
Now, coming to the noise power and the noise power can be calculated as follows. We know
the noise component is W bar transpose N bar, which is basically your rho vector W 1, W
2, W L times the column vector of noise, which is N 1, N 2 up to N L. So, this is summation
over i W i N i. Now, we have to assume something about, we have not described properties of
these noise samples, but let us assume a very commonly employed model, that is, all the
noise samples are statistically identical, that is, they have 0 mean and variance, that
is, expected value of N i square equals sigma square, that is, noise samples are variance
of power, the noise power is sigma square and they are 0 mean, these noise samples N
i are 0 mean. And in addition, let us also assume, that
if you take two distinct noise samples, expected value of N i times N j, this is equal to 0,
that is, if i not equal to j, that is, the distinct noise samples, noise samples, the
different noise samples are uncorrelated, uncorrelated noise samples. In addition,
if these are Gaussian, if N i are Gaussian, then uncorrelated implies, that they are also
independent. However, this does not hold for non-Gaussian noise samples. Typically, the
noise samples are assumed to be additive white Gaussian, which means, that the different
noise samples at the different antennas are independent and identically distributed, identically
distributed in the sense, that they have 0 mean and identical variance sigma square.
So, we say, the noise samples N i are I i d equals independent, identically independent
and identically distributed. Now, if you look at the noise power, that
is, expected value of summation over i W i N i square, this becomes expected value
of, I can write it as a quantity times itself, W i N i times summation over j W j N j, which
is equal to the expected value of, well, multiplying it out, summation i summation
j W i W j N i N j. Now, it is easy to see, what this reduces to. So, take the expected
value inside, summation over i j expected value of W i W j N i. In fact, W i W j are
constants. So, you can simply write this as W i W j expected value of N i N j. And we
have seen, this is equal to 0, if i is not equal to j and equal to sigma square, if and
only if, if i is equal to j. So, only the term, so when i is not equal to j, expected
value of N i N j is basically 0. The noise samples of the two different antennas are
uncorrelated. So, only the terms, where i equal to j survive and therefore, I can simplify
this as, since only terms, where i equal to j survive and in that case, expected value
of N i N j is sigma square. So, this will be i sigma square, when i equal to j, W i
into W j will be W i square. So, sigma square summation W i square, taking
the sigma square outside, this will be sigma square summation W i square, which is basically
nothing but, norm W bar square. And this is basically your noise power, this is basically
the noise power. And therefore, now I can formulate my optimization problem. Now, my
optimization problem will be the following, the optimization problem. Remember, the optimization
problem for beam forming is to minimize the noise power. We have just found the noise
power, that is minimize sigma square norm W bar square. That is, what are you doing,
you are minimizing the noise power, minimizing the noise power, subject to the constraint
W bar transpose h bar equal to 1, that is your signal gain equals constant or constant
gain in the direction of desired. So, what you are doing is, you are minimizing
the noise power, keeping constant signal power. So, what does it does is, that maximizes the
signal to noise power ratio, that is what we said. And therefore, if you look at this
optimization problem, it has two parts. First, what you are trying to minimize, this is termed
as the objective or the optimization objective or the simply the objective function. And
this is termed as the constraint, because remember, we have to ensure W bar transpose
h bar equals 1, this is termed a constraint or in fact, you can have more than one constraint,
you can have constraints. And if you see, this constraint is an affine
constraint, it is an affine equality constraint. And if you look at the objective, the objective
is convex sigma square norm W bar square. Well, minimizing sigma square norm W bar square,
this is equivalent to minimizing norm W bar square, because sigma square is a constant.
So, if I minimize norm W bar square, I will also minimize sigma square norm W bar square.
And now, look at this, norm W bar square is simply W 1 square plus so on, W L square sum
of convex functions. So, this is a convex objective, affine constraint is also a convex
constraint. So, you have a convex objective function and you have a convex constraint,
you can have more than one convex constraint, you can have a set of convex constraint. So,
convex objective plus convex constraint, that makes a convex optimization problem, that
is a special sub class of optimization problems, which we are going to focus on.
So, this is going to be the template of a convex optimization problem. So, convex objective
plus convex constraints implies a convex optimization problem. So, this implies convex,
so we have a convex objective, we have a convex, we have convex constraints, this implies we
have a convex optimization problem. So, in fact, we have a constrained convex optimization
problem. Constraints are an implicit part, I mean, constraints are, this is a part. So,
this is, you have objective function and not just the objective function, but you also
have a set of constraints, that the desired solution has to satisfy.
How do we solve this? Let us formulate the objective, let me rewrite the optimization
problem. So, I am dropping the sigma square, because it is a constant. So, I am going to
simply minimize norm W bar square, subject to the constraint W bar transpose H bar equals
1. What I am now going to now do is, something that you must have seen in an early course
on calculus, that is, to solve a constraint or constrained optimization problem, one needs
to use Lagrange multipliers. So, I am going to form. And by the way, this is equal to
norm W bar square equals W bar transpose W bar, T n, which is basically, f I can denote
this as W bar transpose W bar plus lambda times 1 minus W bar transpose H bar.
And now, what, so, this quantity lambda, this is the Lagrange multiplier, this is the Lagrange
multiplier. And this has to also, this is a new parameter in the optimization problem
and this Lagrange multiplier also has to be determined as the solution to the optimization
problem. So, now, I am going to differentiate this with respect to W bar and set it equal
to, and that gives us W bar transpose W bar, differentiate that, that gives us 2 W bar
plus lambda times, differentiate 1, that gives 0, minus, differentiate W bar transpose H
bar, derivative of that is H bar. So, set it equal to 0.
So, this implies 2 W bar equals lambda H bar, which implies W bar equals lambda over
2 H bar, that is, W bar equals lambda over 2 times H bar. And this is the optimal beam
former. Why is it the optimal beam former? Because it maximizes the signal to noise power
ratio, maximizes the signal to noise. And you can see that, the optimal beam former
is proportional to H bar. So, therefore, this is also like a matched filter. In fact, this
is a spatially matched filter in space, because typically you have a matched filter in time,
this is a matched filter across the antennas, which is a spatially matched filter. So, W
bar is proportional to H bar, which implies that, this is an analog, analogous to a matched
filter, that you employ in a digital communication system.
Now, how do we determine lambda? To determine lambda, this Lagrange multiplier, we have
to use the constraint. What is the constraint? Remember, the constraint is W bar transpose
H bar equals 1. Substitute the value of W bar, that is, lambda by 2 H bar transpose
H bar equals 1, which implies that, lambda by 2 H bar transpose H bar equals lambda by
2 norm H bar square equals 1, which implies lambda equals 2 over norm H bar square.
So, lambda equals 2 over norm H bar and that is what we have. And therefore, implies the
optimal beam former, which you can now denote as W star. W star equals lambda by 2. So,
that is half lambda 2 over norm H bar square into H bar lambda by 2 into H bar. So, this
is H bar divided by norm of H bar square. So, this is your optimal beam former. So,
this is the optimal beam former, H bar divided by, this is also termed as the maximal ratio
combiner, because this maximizes the signal to noise power ratio. It is also termed as
the maximal ratio combiner. So, this is also termed as the, so that gives us the optimal
beam former, which is H bar divided by norm H bar square, that is, the maximal ratio combiner.
And this maximizes the, it is known as the maximal ratio combiner, because it maximizes
the SNR, correct, maximizes the SNR employing the beam former, maximizes the SNR at the
output of the beam former. And what is the SNR? That is easy to see.
If you have y bar equals H bar times x plus n bar, let this be p, symbol power equals
p, that is, expected value of x square, symbol power equals p. And now what am I doing? I
am beam forming with the maximal ratio combiner, that is, H bar transpose divided by norm H
bar square into y bar. Remember, this is the maximal ratio combiner, which is H bar transpose
H bar divided by norm H bar square times x plus H bar transpose n bar divided by norm
H bar square. Now, if you see this H bar transpose H bar, that is, norm H bar square divided
by norm H bar square, which is 1. And that is indeed true, because we ensured that the
signal gain is 1. So, this is H plus H bar transpose n bar divided by norm H bar square.
Therefore, the SNR at the output of the maximal ratio combiner is simply signal power, that
is, expected value of x square by noise power. But we know noise power is sigma square times
norm W bar square. We have already derived that for any combiner. So, expected x square
is p divided by sigma square norm W bar square. Remember, W bar equals H bar by norm H bar
square. Norm W bar square is norm H bar square divided by norm H bar power 4 equals p divided
by sigma square into norm H bar square. So, the SNR at the output is norm H bar square
into p divided by sigma square. You can also write this as norm H bar square into rho,
where rho equals p divided by rho equals the transmit. So, p equals the symbol power, sigma
square equals noise power and rho equals p divided by signal power by noise power. You
can think of this as the transmit power, because this is the power of the transmitted symbols.
So, rho equals transmit SNR p over sigma square, which is the transmit SNR. So, this is the
interesting thing. So, this is the first convex optimization problem, which is rather simple
application of the optimization framework, which we have seen. You can clearly see, it
is very powerful and very handy. You can formulate a neat optimization problem, wherein
you are trying to design the optimal beam former. You set the beam forming gain or the
gain of the beam former in the desired direction and the direction of the signal to be unity.
That gives you your constraint and you minimize the noise power, which is sigma square norm
W bar square to basically essentially maximize the signal to noise power ratio. We used the
Lagrange multiplier framework to formulate. The Lagrangian basically differentiates at
equal to 0. This is also known as the KKT framework. We will look at it in more detail
as we go in the subsequent module. But initially, this illustrates to you in a very simple fashion
through a practical example, how the optimization framework and more specifically, the convex
optimization framework can be used to solve practical problems. So, we will stop here
and continue in the subsequent module.