Soura Dasgupta

Soura Dasgupta

Auto-generated profile, based on publicly available information

Soura Dasgupta

Department of Electrical and Computer Engineering, The University of Iowa, Iowa City, IA, USA

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2011 in Communications in Information and Systems
Verified
Journal Article
Closed access
PDF file
BABrian D.O. Anderson
Brian D.O. Anderson
MCM. Cao
M. Cao
SDS. Dasgupta
S. Dasgupta
AMA.S. Morse
A.S. Morse
CYChangbin Yu
Changbin Yu
International Press of Boston - publishers of scholarly mathematical and scientific journals and books

11 March 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
YMYuanqiu Mo
Yuanqiu Mo
SDSoura Dasgupta
Soura Dasgupta
JBJacob Beal
Jacob Beal
Self-stabilizing distance estimation algorithms are an important building block of many distributed systems, such as seen in the emerging field of Aggregate Programming. Their safe use in feedback systems or under persistent perturbations has not previously been formally analyzed. Self-stabilization only involves eventual convergence, and is not endowed with robustness properties associated with global uniform asymptotic stability and thus does not guarantee stability under perturbations or feedback. We formulate a Lyapunov function to analyze the Adaptive Bellman-Ford distance estimation algorithm and use it to prove global uniform asymptotic stability, a property which the classical Bellman-Ford algorithm lacks. Global uniform asymptotic stability assures a measure of robustness to structural perturbations, empirically observed by us in a previous work. We also show that the algorithm is ultimately bounded under bounded measurement error and device mobility and provide a tight bound on the ultimate bound and the time to attain it.

1 January 1995 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
MFMinyue Fu
Minyue Fu
SDS. Dasgupta
S. Dasgupta
VBV. Blondel
V. Blondel
This paper considers the robust stability verification of linear time-invariant systems admitting a class of nonlinear parametric perturbations. The general setting is one of determining the closed-loop stability of systems whose open-loop transfer functions consist of powers, products, and ratios of polytopes of polynomials. Apart from this general setting, two special cases of independent interest are also considered. The first special case concerns uncertainties in the open-loop gain and real poles and zeros, while the second special case treats uncertainties in the open-loop gain and complex poles and zeros. In light of the zero exclusion principle, robust stability is equivalent to zero exclusion of the value sets of the system characteristic function (a value set consists of the values of the characteristic functions at a fixed frequency). The main results of this paper are as follows. 1) The value set of the characteristic function at each fixed frequency is determined by the edges and some frequency-dependent internal line segments. 2) Consequently, Hurwitz invariance verification simplifies to that of checking certain continuous scalar functions for avoidance of the negative real axis. 3) For the case of real zero-pole-gain variations, the critical lines are all frequency independent, and therefore, the determination of the robust stability is even simpler. 4) For the case of complex zero-pole-gain variations, the critical internal lines are shown to be either frequency independent or to be confined in certain (two-dimensional) planes or (three-dimensional) boxes.

1 January 2008 in IFAC Proceedings Volumes
Verified
Journal Article
Closed access
PDF file
MCM. Cao
M. Cao
CYChangbin Yu
Changbin Yu
AMA.S. Morse
A.S. Morse
BABrian D.O. Anderson
Brian D.O. Anderson
SDS. Dasgupta
S. Dasgupta

7 November 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
AKAmy Kumar
Amy Kumar
RMRaghuraman Mudumbai
Raghuraman Mudumbai
SDSoura Dasgupta
Soura Dasgupta
UMUpamanyu Madhow
Upamanyu Madhow
DBD. Richard Brown
D. Richard Brown
We consider the problem of multicasting a common message signal from a distributed array of wireless transceivers by beamforming to a set of beam targets, while simultaneously protecting a set of null targets by nullforming to them. We describe a distributed algorithm in which each transmitter iteratively adapts its complex transmit weight using common aggregate feedback messages broadcast by the targets, and the local knowledge of only its own channel gains to the targets. This knowledge can be obtained using reciprocity without any explicit feedback. The algorithm minimizes the mean square error between the complex signal amplitudes at the targets and their desired values. We prove convergence of the algorithm, present geometric interpretations, characterize initializations that lead to minimum total transmit power, and prescribe designs for such initializations. We show that the convergence speed is nondecreasing in the number of transmitters N if a step size parameter is kept constant. For Rayleigh fading channels, as N goes to infinity: 1) convergence can be made arbitrarily fast and 2) beams and nulls can be achieved with vanishing total transmit power even with noise, both with probability one. These results add up to some remarkable scalability properties: the feedback overhead does not grow with the number of transmitters, and with high probability, the algorithm can be configured to converge arbitrarily fast and use vanishingly small total transmit power.

24 September 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SGSairam Goguri
Sairam Goguri
DODennis Ogbe
Dennis Ogbe
SDSoura Dasgupta
Soura Dasgupta
RMRaghuraman Mudumbai
Raghuraman Mudumbai
DBD. Richard Brown
D. Richard Brown
UMUpamanyu Madhow
Upamanyu Madhow
We consider the problem of optimal precoder design for a multi-input single-output wideband wireless system to maximize two different figures of merit: the total communication capacity and the total received power, subject to individual power constraints on each transmit element. We show that the two optimal precoders satisfy a Separation Principle that reveals a simple structure for these precoders. We use this Separation Principle extensively to derive several interesting properties of these two optimal precoders. Some key analytical results are as follows. We show that the power-maximizing precoders must concentrate all their energy in a small number of active channels that cannot exceed the number of input terminals. The capacitymaximizing precoder turns out to be very different from the classical waterfilling solutions and also very different from the power-maximizing precoders except at asymptotically low SNRs where the power-maximizing precoders also maximize capacity. We also show that the capacity of the wideband system is lowerbounded by the sum-rate of a multiple-access channel with the same channel gains and power constraints. Finally, the Separation Principle also yields simple fixed-point algorithms that allow for the efficient numerical computation of the two optimal precoders.