Education
Education
Institute: Indian Institute of Technology, PhD, 2016-2022
Title: On the Information Flow in Undirected Unicast Networks
Supervisor: Dr. Satyajit A. Thakor
Abstract: One of the important unsolved problems in information theory is the conjecture that network coding has no rate benefit over routing in undirected unicast networks. If the conjecture is true, then the undirected unicast network information capacity is the same as the routing capacity. However, the conjecture is unsolved and the undirected unicast network information capacity is not characterized yet. Even upper bounding the symmetric information rate is a challenging problem. Only two explicit upper bounds on symmetric information rate are known for general undirected networks: (1) sparsest cut bound on the symmetric rate is a trivial bound on both commodity and information flow and (2) the linear programming bound using Shannon type inequalities is generally not used for evaluation due to prohibitively large problem size.
In this work, we characterize an upper bound, called the partition bound, on the symmetric rate for information flow in general undirected unicast networks and present a partitioning technique to obtain converse results for undirected network information flow. We give two proof methods for the partition bound. This bound is further generalized for non-symmetric rates. We show that the partition bound is not tight in general and also demonstrate an approach to tighten the bound. As a result, we present an alternative proof of the undirected unicast network information capacity of the well-known Hu’s 3-pairs network. We give explicit routing solutions achieving the partition bound for (1) two classes of complete n-partite networks called Type-I and Type-II n partite networks, and (2) a class of 3-layer networks called Type-I 3-layer networks. These results prove that the undirected unicast network coding conjecture holds for these classes of networks. A parameter is defined as an optimal partition that delivers the partition bound. We also show that the decision version problem of computing the partition bound is an NP-complete problem. Thus, both the upper bounds, the sparsest cut bound, and partition bound are not polynomial-time computable unless P=NP. Recently, the undirected unicast network coding conjecture was proved for a new class of networks and it was shown that all the network instances for which the conjecture is proved previously, and the cut-based bound is not achievable by commodity flow, are elements of this class. The conjecture was also proved for all undirected unicast networks (1) with six or fewer nodes and (2) with up to three sessions and seven nodes except one particular network. We show the existence of a Type-I n-partite network for which the partition bound is tight and achievable by routing and is not an element of this class of networks. This result establishes that there exist networks outside of the class of networks with unverified conjecture such that the partition bound is tight and attainable by routing.
Institute: Indian Institute of Information Technology Design and Manufacturing, [Master of Design, 2013-2015]
Title: Waveform Synthesis for MIMO Radar Systems
Supervisor: Dr. Mandha D. Selvaraj
Abstract: In this project, an attempt has been made to implement cyclic algorithms, CAN (Cyclic Algorithm New) and WeCAN (Weighted Cyclic Algorithm New), which are used to generate orthogonal sequences for MIMO radar systems. These algorithms exploit the properties of FFT (Fast Fourier Transform) which, as we know, computes very fast. These cyclic algorithms improve the performance of MIMO radar systems. Improving the performance of the system means reducing the sidelobes of the correlation metric which is directly related to the ISL (Integrated Sidelobe Level) metric. The reduction in ISL (Integrated Sidelobe Level) metric should be in the manner that even the sidelobe with maximum power should remain as low as possible compared to the main lobe, which is desirable. By doing this, the ability of the MIMO radar receiver to detect the target will increase: therefore the MIMO radar system then will be able to detect the target with high clarity.
Institute: Technocrats Institute of Technology (Excellence) [Bachelor of Engineering, 2008-2012]
Title: Automatic Braking Systems
Supervisor: Mr. Rahul Tiwari
Abstract: In this project, an attempt has been made to develop a technique called as Automatic Braking System, which can be used as a safety feedback-control-system device to avoid an accident when a vehicle takes a sharp turn on any turning track keeping high speed. This can be done by a feedback-control system that controls the supply of the brake oil to the wheels of the vehicle.
M. I. Qureshi and S. Thakor, “A Bound on Undirected Multiple-Unicast Network Information Flow,” IEEE Transactions on Information Theory, vol. 68, no. 7, pp. 4453-4469, July 2022.
M. I. Qureshi and S. Thakor, “On the Information Capacity of Layered Undirected Unicast Networks,” IEEE Communications Letters, vol. 24, no. 12, pp. 2715-2718, Dec. 2020.
International Conferences
S. Thakor and M. I. Qureshi, “On Computing the Partition Bound for Undirected Multi-Source Unicast Network Information Flow” in National Conference on Communications, 2024. (Accepted)
M. I. Qureshi and S. Thakor, “On the Partition Bound for Undirected Unicast Network Information Capacity,” in IEEE International Symposium on Information Theory, pp. 1623-1628, 2020. arXiv
S. Thakor and M. I. Qureshi, “Undirected Unicast Network Capacity: A Partition Bound,” in IEEE International Symposium on Information Theory, pp. 196-200, 2019. arXiv
I feel honored to have been a judge for the nationwide Smart India Hackathon 2023 (Software edition).
I delivered a Young Researcher Talk in JTG/IEEE ITSoc Summer School in Information Theory, Signal Processing, Telecommunication, and Networking @ IIT Kanpur, held from 28 June 2021-01 July 2021.
I was a Co-Winner of the Four-Minute Two-Techniques Contest, ISIT-2021.
I received the Best Poster Presentation Award in 2018 at IIT Mandi.
I received the Best Teaching Assistant Award 2018-19 at IIT Mandi.
I received special recognition from IIT Mandi on its 12th Foundation Day for my teaching assistant work.
Since July 2023, I have been working as an Assistant Professor in the Department of Computer Science Engineering at C. V. Raman Global University, Bhubaneswar.
I worked as a Project Associate at IIT Mandi from 20 July 2021 to mid-April 2023.
I interned at the IIT Mandi iHub and HCI Foundation of IIT Mandi from April 2021 to mid-July 2021.
I gained teaching experience as an assistant professor at NRI Institute of Information Science and Technology, Bhopal, from 24 Aug. 2015 to 15 Jan. 2016.
I am developing an interest in Machine Learning and Blockchain Technology recently
Theoretical Computer Science
Communication Systems
Information Theory
English (Read, Write and Speak)
Hindi (Read, Write and Speak)
Urdu (Read, Write and Speak)