scispace - formally typeset
Search or ask a question
Author

Arun K. Choudhury

Bio: Arun K. Choudhury is an academic researcher from University of Calcutta. The author has contributed to research in topics: Boolean function & Realization (systems). The author has an hindex of 9, co-authored 63 publications receiving 271 citations.


Papers
More filters
Journal ArticleDOI
01 Jun 1968
TL;DR: In this article, the authors present a method for computing the transition matrix of linear time-invariant systems, which avoids the use of the eigenvalues of the matrix.
Abstract: The purpose of this letter is to present a method for computing the transition matrix of linear time-invariant systems. Due to the important role the transition matrix plays in linear system response, several methods have been put forward for its computation. A numerical computation method, which avoids the use of the eigenvalues, for the evaluation of the transition matrix is presented here.

22 citations

Journal ArticleDOI
01 May 1985
TL;DR: The investigation reveals its insufficiency, and a technique of augmenting the network with some additional observation points is proposed, so that a universal test set can be designed for detecting bridging faults as well.
Abstract: In the paper we investigate whether the function-independent test set for detecting single stuck-at faults in networks realising Reed-Muller canonic (RMC) expansions of switching functions is sufficient to detect all bridging faults in such networks. The investigation, however, reveals its insufficiency, and to circumvent this we propose a technique of augmenting the network with some additional observation points, so that a universal test set can be designed for detecting bridging faults as well.

22 citations

Journal ArticleDOI
TL;DR: A generalized approach to the decoupled problems of linear systems is presented, such that both time-varying and time-invariant systems, scalar and block decoupling problems, may be studied in the same framework.
Abstract: In this paper we present a generalized approach to the decoupling problems of linear systems, such that both time-varying and time-invariant systems, scalar and block decoupling problems, may be studied in the same framework. We also derive the necessary and sufficient conditions for a linear system to be decoupled by output feedback only. Use of a state estimator, when some of the plant states are inaccessible, and the possibility of the reduction of its order are next studied. The results derived are illustrated by several examples.

17 citations

Journal ArticleDOI
TL;DR: In this paper, it is shown that the minimizing function (Boolean representation of the prime implicant table) of a switching function can suitably be split up into a number of sub-functions such that the sum terms of each sub-function can be arranged in any of the four possible distinct matrices called connected cover term matrices.
Abstract: The central idea developed in the present paper involves the decomposition of the prime irnplicant covering problems of switching functions into the number of readily tractable sub-problems. It is shown that the minimizing function (Boolean representation of the prime implicant table) of a switching function can suitably be split up into a number of sub-functions such that the sum terms of each of these sub-functions can be arranged in any of the four possible distinct matrices called connected cover term matrices. The irredundant solutions of the sub-problem corresponding to each of the connected cover term matrices can be readily obtained, without the generation of a single redundant or duplicate solution, by following a systematic procedure suggested in the paper. The paper is concerned with the detailed study of the properties of the connected cover term matrices.

15 citations

Journal ArticleDOI
TL;DR: In this paper, the second method of Lyapunov has been applied to the transient stability analysis of a power system and the stability boundaries obtained have been compared with those obtained by other workers and have been found to give better results.
Abstract: The second method of Lyapunov has been applied to the transient stability analysis of a power system ; and the Lyapunov functions have been generated systematically by a method developed recently. The stability boundaries obtained have been compared with those obtained by other workers and have been found to give better results.

13 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: Methods involv- ing approximation theory, dierential equations, the matrix eigenvalues, and the matrix characteristic polynomial have been proposed, indicating that some of the methods are preferable to others, but that none are completely satisfactory.
Abstract: In principle, the exponential of a matrix could be computed in many ways. Methods involving approximation theory, differential equations, the matrix eigenvalues, and the matrix characteristic polyn...

2,196 citations

Journal ArticleDOI
TL;DR: In this article, the exponential of a matrix could be computed in many ways, including approximation theory, differential equations, the matrix eigenvalues, and the matrix characteristic polynomial.
Abstract: In principle, the exponential of a matrix could be computed in many ways. Methods involving approximation theory, differential equations, the matrix eigenvalues, and the matrix characteristic polyn...

1,849 citations

Journal ArticleDOI
01 Dec 1980
TL;DR: This paper introduces the minimum-order approach to frequency assignment and presents a theory which relates this approach to the traditional one, and shows that many frequency assignment problems are equivalent to generalized graph coloring problems.
Abstract: In this paper we introduce the minimum-order approach to frequency assignment and present a theory which relates this approach to the traditional one. This new approach is potentially more desirable than the traditional one. We model assignment problems as both frequency-distance constrained and frequency constrained optimization problems. The frequency constrained approach should be avoided if distance separation is employed to mitigate interference. A restricted class of graphs, called disk graphs, plays a central role in frequency-distance constrained problems. We introduce two generalizations of chromatic number and show that many frequency assignment problems are equivalent to generalized graph coloring problems. Using these equivalences and recent results concerning the complexity of graph coloring, we classify many frequency assignment problems according to the "execution time efficiency" of algorithms that may be devised for their solution. We discuss applications to important real world problems and identify areas for further work.

1,310 citations

Journal ArticleDOI
TL;DR: An algorithm for computing the exponential of an arbitrary $n \times n$ matrix is presented and Diagonal Pade table approximations are used in conjunction with several techniques for reducing the norm of the matrix.
Abstract: This paper presents and analyzes an algorithm for computing the exponential of an arbitrary $n \times n$ matrix. Diagonal Pade table approximations are used in conjunction with several techniques for reducing the norm of the matrix. An important feature of the algorithm is that an estimate for the minimum number of digits accurate in the norm of the computed exponential matrix is returned to the user. In obtaining this estimate, several interesting results concerning rounding errors and Pade approximations are presented.

221 citations

Journal ArticleDOI
TL;DR: A broad tutorial survey is given of the various topologies available for use in circuit switching systems for tightly coupled parallel/distributed computer systems.
Abstract: A broad tutorial survey is given of the various topologies available for use in circuit switching systems for tightly coupled parallel/distributed computer systems. Terminology and issues of circuit switching as related to parallel/distributed processing are first discussed. Circuit switching networks are then classified according to connection capability, topological geometry, and basis of development. Topological relationships of specific networks are addressed. 91 references.

134 citations