scispace - formally typeset
Search or ask a question
Topic

Product (mathematics)

About: Product (mathematics) is a research topic. Over the lifetime, 44382 publications have been published within this topic receiving 377809 citations.


Papers
More filters
Book ChapterDOI
01 Jan 2002
TL;DR: It is shown that DDD construction, as well as many symbolic analysis algorithms, takes time almost linear in the number of DDD vertices, and an efficient DDD-vertex-ordering heuristic is described and proved that it is optimum for ladder-structured circuits.
Abstract: Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. In this paper, we present a new approach to exact and canonical symbolic analysis by exploiting the sparsity and sharing of product terms. It consists of representing the symbolic determinant of a circuit matrix by a graph??-??called a determinant decision diagram (DDD)??-??and performing symbolic analysis by graph manipulations. We show that DDD construction, as well as many symbolic analysis algorithms, takes time almost linear in the number of DDD vertices. We describe an efficient DDD-vertex-ordering heuristic and prove that it is optimum for ladder-structured circuits. For practical analog circuits, the numbers of DDD vertices are several orders of magnitude less than the numbers of product terms. The algorithms have been implemented and compared respectively to symbolic analyzers ISAAC and Maple-V in generating the expanded sum-of-product expressions, and SCAPP in generating the nested sequences of expressions.

90 citations

Journal ArticleDOI
TL;DR: In this article, the Randic (product-)connectivity index and its derivative called the sum-connectivities index are compared and it is shown that these both descriptors correlate well among themselves and with the π-electronic energies of benzenoid hydrocarbons.

90 citations

Proceedings Article
01 Nov 2000

90 citations


Network Information
Related Topics (5)
Indifference graph
10.8K papers, 287.9K citations
69% related
Vertex (geometry)
18.7K papers, 294.2K citations
68% related
Pathwidth
8.3K papers, 252.2K citations
68% related
Polynomial
52.6K papers, 853.1K citations
68% related
Analytic function
11.5K papers, 183.9K citations
67% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20251
20244
20239,015
202219,171
20212,013
20202,263