Book•
Computational Aspects of Vlsi
01 Jan 1984-
About: The article was published on 1984-01-01 and is currently open access. It has received 862 citations till now. The article focuses on the topics: Very-large-scale integration.
Citations
More filters
07 Oct 1992
TL;DR: A number of lower bounds on the communication and multiplicative complexity are derived for the discrete short time Fourier transform, the discrete Wigner-Ville distribution and the discrete ambiguity function.
Abstract: A number of lower bounds on the communication and multiplicative complexity are derived. The (Area)*(Time)/sup 2/ (AT/sup 2/) bound for the discrete short time Fourier transform, the discrete Wigner-Ville distribution, the discrete ambiguity function and the discrete Gabor transform is shown to be AT/sup 2/= Omega (N/sup 3/ log/sup 2/ N), where N/sup 2/ is the number of output points. The lower bound on multiplicative complexity for these is shown to be Omega (N/sup 2/). For the N-point discrete wavelet transform a lower bound of AT/sup 2/= Omega (N/sup 2/ log/sup 2/ N) and a multiplicative complexity of Omega (N) are the same as the lower bounds for the DFT. >
9 citations
09 Sep 2007
TL;DR: This model consists of two neural networks performing jointly in order to minimize the same energy function, and has proved to be a very competitive and efficient algorithm, in terms of quality of solutions and computational time, when compared to the state-of-the-art heuristic methods specifically designed for this problem.
Abstract: In this paper, the K-pages graph layout problem is solved by a new neural model. This model consists of two neural networks performing jointly in order to minimize the same energy function. The neural technique applied to this problem allows to reduce the energy function by changing outputs from both networks -outputs of first network representing location of nodes in the nodes line, while the outputs of the second one meaning the page where the edges are drawn.
A detailed description of the model is presented, and the technique to minimize an energy function is fully described. It has proved to be a very competitive and efficient algorithm, in terms of quality of solutions and computational time, when compared to the state-of-the-art heuristic methods specifically designed for this problem. Some simulation results are presented in this paper, to show the comparative efficiency of the methods.
9 citations
Cites background from "Computational Aspects of Vlsi"
...Some examples of problems associated to this linear graph layout problem (or K pages crossing number problem) are the bandwidth problem [1], the book thickness problem [2], the pagenumber problem [3,4], the boundary VLSI layout problem [5] and the single-row routing problem [6] and automated graph drawing [7]....
[...]
24 Mar 1992
TL;DR: This paper proposes optical architectures to execute various image compression techniques, including transform coding; vector quantization; and interframe coding; and shows many generally used transform coding methods, for example, the cosine transform, can be implemented by a simple optical system.
Abstract: Optical computing has recently become a very active research field. The advantage of optics is its capability of providing highly parallel operations in a three dimensional space. The authors propose optical architectures to execute various image compression techniques. They optically implement the following compression techniques: transform coding; vector quantization; and interframe coding; They show many generally used transform coding methods, for example, the cosine transform, can be implemented by a simple optical system. The transform coding can be carried out in constant time. Most of this paper is concerned with a sophisticated optical system for vector quantization using holographic associative matching. Holographic associative matching provided by multiple exposure holograms can offer advantageous techniques for vector quantization based compression schemes. Photorefractive crystals, which provide high density recording in real time, are used as the holographic media. The reconstruction alphabet can be dynamically constructed through training or stored in the photorefractive crystal in advance. Encoding a new vector can be carried out by holographic associative matching in constant time. An extension to interframe coding is also discussed. >
9 citations
TL;DR: It is demonstrated that the presence of extra processors can expedite oblivious routing, and the time required for the oblivious routing of n packets onn processors is known to be Θ(√n).
Abstract: The problem of routing data packets in a constant-degree network is considered. A routing scheme is calledoblivious if the route taken by each packet is uniquely determined by its source and destination. The time required for the oblivious routing ofn packets onn processors is known to be Θ(√n). It is demonstrated that the presence of extra processors can expedite oblivious routing. More specifically, the time required for the oblivious routing ofn packets onp processors is Θ(n/√p + logn).
9 citations
TL;DR: A deterministic routing scheme for a communications network based on the k-dimensional hypercube is proposed and a way to perform routings which are subsets of H-permutations is indicated.
Abstract: A deterministic routing scheme for a communications network based on the k-dimensional hypercube is proposed. The author presents two formulations of the scheme. The first formulation delivers messages in O(k/sup 2/) bit times using O(K) bits of buffer space at each node in the hypercube. The second formulation assumes that there are several batches of messages to be delivered, and makes certain assumptions about the cost of sending messages along the various dimensions of the cube. In this case, the latency for delivery time is still O(k/sup 2/) bit times, but the throughput is increased to one set of messages every O(k) bit times. For the first formulation, the author restricts himself to routings which are subsets of permutations (i.e. every node sends at most one message and receives at most one message). The second formulation indicates a way to perform routings which are subsets of H-permutations (i.e. every node sends at most H messages and receives at most H messages). >
9 citations