[et_pb_section fb_built=”1″ fullwidth=”on” _builder_version=”4.27.0″ background_image=”https:\/\/ece.iisc.ac.in\/~cmurthy\/wp-content\/uploads\/2024\/09\/GOPR0015-scaled.jpg” global_colors_info=”{}”][et_pb_fullwidth_header title=”E2 312: Random Matrix Theory for Wireless Communications” content_max_width=”none” module_class=”sub_header” _builder_version=”4.27.0″ title_font=”|on|||” title_text_color=”#FFFFFF” title_font_size=”50px” background_color=”rgba(255, 255, 255, 0)” background_image=”https:\/\/ece.iisc.ac.in\/~cmurthy\/wp-content\/uploads\/2024\/09\/abstract-1438441.jpg” parallax=”on” button_one_letter_spacing_hover=”0″ button_two_letter_spacing_hover=”0″ global_colors_info=”{}” button_one_text_size__hover_enabled=”off” button_two_text_size__hover_enabled=”off” button_one_text_color__hover_enabled=”off” button_two_text_color__hover_enabled=”off” button_one_border_width__hover_enabled=”off” button_two_border_width__hover_enabled=”off” button_one_border_color__hover_enabled=”off” button_two_border_color__hover_enabled=”off” button_one_border_radius__hover_enabled=”off” button_two_border_radius__hover_enabled=”off” button_one_letter_spacing__hover_enabled=”on” button_one_letter_spacing__hover=”0″ button_two_letter_spacing__hover_enabled=”on” button_two_letter_spacing__hover=”0″ button_one_bg_color__hover_enabled=”off” button_two_bg_color__hover_enabled=”off”][\/et_pb_fullwidth_header][\/et_pb_section][et_pb_section fb_built=”1″ _builder_version=”4.27.0″ _module_preset=”default” global_colors_info=”{}”][et_pb_row _builder_version=”4.27.0″ _module_preset=”default” custom_padding=”|||0px||” global_colors_info=”{}”][et_pb_column type=”4_4″ _builder_version=”4.27.0″ _module_preset=”default” global_colors_info=”{}”][et_pb_text _builder_version=”4.27.0″ _module_preset=”default” text_orientation=”justified” custom_padding=”|||11px||” hover_enabled=”0″ global_colors_info=”{}” sticky_enabled=”0″]<\/p>\n
Instructor:<\/strong>\u00a0Chandra R. Murthy (cmurthy at ece) Textbooks:<\/strong> Prerequisites:<\/strong>\u00a0Random processes (E2-202 or equivalent), Matrix theory (E2-212 or equivalent).<\/p>\n<\/div>\n The goal of this course is to cover the basics of random matrix theory and show how it can be applied to solve a various problems in wireless communications. The following topics will be covered: Stieltjes transform method, free probability theory, combinatoric approaches, deterministic equivalents, and spectral analysis methods for statistical inference. In the second half of the course, these theoretical concepts will be applied to a variety of problems in signal processing and wireless communications.<\/p>\n<\/div>\n Homeworks: 15%\u00a0Due 2 weeks after the date the homework is announced<\/strong>
Class hours:<\/strong>\u00a0MWF 12-1pm. We will start 10 mins late on Fridays.
Class location:<\/strong>EC 1.07<\/p>\n
1. R. Couillet and M. Debbah, \u201cRandom Matrix Theory for Wireless Communications,\u201d Cambridge University Press, 2011.
2. T. Tao, \u201cTopics in Random Matrix Theory,\u201d Available\u00a0here<\/a>
3. A. M. Tulino and S. Verdu, \u201cRandom Matrix Theory and Wireless Communications,\u201d Now Publishers, 2004. Available\u00a0here<\/a>
4. J. A. Tropp, \u201cAn introduction to matrix concentration inequalities\u201d. Available\u00a0here<\/a><\/p>\n\u00a0<\/h3>\n
Overview:<\/h3>\n
\u00a0<\/h2>\n
Grading<\/h2>\n
Test 1: around Sep. 29, 2015, in class: 30%
Test 2: around Nov. 10, 2015, 10am-1pm, in class: 40%
Project presentation and report: 15%<\/p>\n<\/div>\n\u00a0<\/h2>\n
Homeworks and Assignments<\/h2>\n