The following topics are discussed: information flow; protocols; logics for anonymity and distributed system security; access control; authorization and security policies; and computational analysis of security protoc...
详细信息
The following topics are discussed: information flow; protocols; logics for anonymity and distributed system security; access control; authorization and security policies; and computational analysis of security protocols.
This paper describes the VLSI implementation of Fast Fourier Transform (FFT) for the Eureka-147 Digital Audio Broadcasting (DAB) system. We emphasize how to minimize the hardware requirement and efficiently manage the...
详细信息
ISBN:
(纸本)0780377613
This paper describes the VLSI implementation of Fast Fourier Transform (FFT) for the Eureka-147 Digital Audio Broadcasting (DAB) system. We emphasize how to minimize the hardware requirement and efficiently manage the memory to meet the DAB requirement. Implementation results demonstrate the applicability of our work with the characteristics of modular design, consuming less silicon area, and facilitating the extension for high transmission rate applications. The core size of the resulting chip implementation is 2086/spl times/1806 /spl mu/m/sup 2/ based on the TSMC 0.35 /spl mu/m 1P4M CMOS process. Performance evaluation reveals that our design for the targeted channel demodulator outperform previous solutions.
The following topics are dealt with: voltage scaling; transient faults; cache design; power efficient architectures; energy efficient architectures; application specific optimization; dynamic optimization systems; dyn...
详细信息
The following topics are dealt with: voltage scaling; transient faults; cache design; power efficient architectures; energy efficient architectures; application specific optimization; dynamic optimization systems; dynamic program analysis; dynamic program optimization; branch optimization; value optimization; scheduling optimizations; dataflow architectures; data parallel architectures; clustered architectures; network processors; and scaling design.
A new modular multiplication algorithm and its corresponding architecture is presented. It is optimised with respect to hardware complexity and latency. Based on the dataflow of the well known interleaved modular mult...
详细信息
A new modular multiplication algorithm and its corresponding architecture is presented. It is optimised with respect to hardware complexity and latency. Based on the dataflow of the well known interleaved modular multiplication the product of two n-bit-integers X and Y modulo M is computed by n iterations of a simple loop. The loop consists of one single carry save addition, a comparison of constant complexity, and a table lookup, where the table contains 6 precomputed values and two constants. By this construction the arithmetical complexity of the modular multiplication is reduced to n additions without carry propagation in total which leads to a speedup of at least two in comparison to all methods previously known. It consists of a first algorithm A2 implementing the new idea of combining carry save addition and constant time comparison. A2 is not optimal with respect to area and time. Its correctness is proven. By use of a small amount of precomputing the loop of A2 can be modified such that the effort within the loop is minimised. This leads to the algorithm A3 and it is verified.
In this paper, a line of analogies between power and information networks is given and the paper offers the use of the mathematical device of power networks to account for information networks and their elements.
In this paper, a line of analogies between power and information networks is given and the paper offers the use of the mathematical device of power networks to account for information networks and their elements.
Text-to-speech (TTS) systems have improved their quality to a large extent lately. This development has resulted in memory requirements of several megabytes that cannot be accepted in many applications, especially in ...
详细信息
Text-to-speech (TTS) systems have improved their quality to a large extent lately. This development has resulted in memory requirements of several megabytes that cannot be accepted in many applications, especially in embedded systems. Such applications are usually limited to a footprint of as much as 1 megabyte and require the processing power to be as low as possible. These requirements may be met if the text processing is changed from the usual data-driven algorithms to rule-based processing. Furthermore, the inventory (diphone inventory) should be as small as possible and should be stored in a compressed manner. This is demonstrated by a modified version of the Dresden speech synthesis system, DRESS, which is called microDRESS. Compared to the baseline system, microDRESS does not show essential quality losses apart from the influences of the telephone bandwidth which is appropriate for many embedded applications.
Multipoint-to-point communication allows a group of sources to transfer data to one destination. A major requirement of flow control for such connections is to ensure a fair allocation of resources while maintaining a...
详细信息
Multipoint-to-point communication allows a group of sources to transfer data to one destination. A major requirement of flow control for such connections is to ensure a fair allocation of resources while maintaining a high level of resource utilization. This work treats multipoint-to-point flow control as a multiple-objective optimization problem and presents a theoretical centralized model to compute rate allocations based on this global optimization. Three control objectives have been identified as critical to the flow control of multipoint-to-point connections: overall network throughput; fairness amongst sources; fairness amongst groups. The theoretical model is a linearly constrained quadratic programming model with an objective of minimizing the weighted sums of individual objective functions. The weighting factors become tuning factors with which decision makers can set their decision preferences. It is shown that the three objectives may indeed conflict with each other, and, by varying the values of tuning factors, an optimum rate allocation can be achieved to realize many flavors of objective mix.
Dynamic voltage scaling (DVS) is arguably the most effective energy reduction technique. The multiple-voltage DVS systems, which can operate only at pre-determined discrete voltages, are practical and have been well s...
详细信息
ISBN:
(纸本)1581137621
Dynamic voltage scaling (DVS) is arguably the most effective energy reduction technique. The multiple-voltage DVS systems, which can operate only at pre-determined discrete voltages, are practical and have been well studied. However, one important unsolved problem is how many levels and at which values should voltages be implemented on a multiple-voltage DVS system to achieve the maximum energy saving. We refer this as the voltage set-up problem. In this paper, (1) we derive analytical solutions for dual-voltage system. (2) For the general case that does not have analytic solutions, we develop efficient numerical methods. (3) We demonstrate how to apply the proposed algorithms on system design. (4) Interestingly, the experimental results suggest that the multiple-voltage DVS system, when the voltages are set up properly, can reach DVS technique's full potential in energy saving. Specifically, on the design of an ad hoc application-specific system and the design of the MPEG video encoder, we find that the best single-voltage systems consume 150% and 20% more energy than the tight theoretical lower bounds, respectively. However, our approach gives dual-, 3-, and 4-voltage DVS system settings that are only 17.6%, 4.9%, and 2.6% for the ad hoc system, and 4.0%, 1.1%, and 0.2% for the MPEG video encoder, over the same lower bounds.
In this paper we present an interactive texture-based technique for visualizing three-dimensional vector fields. The goal of the algorithm is to provide a general volume rendering framework allowing the user to comput...
详细信息
In this paper we present an interactive texture-based technique for visualizing three-dimensional vector fields. The goal of the algorithm is to provide a general volume rendering framework allowing the user to compute three-dimensional flow textures interactively, and to modify the appearance of the visualization on the fly. To achieve our goal, we decouple the visualization pipeline into two disjoint stages. First, streamlines are generated from the 3D vector data. Various geometric properties of the streamlines are extracted and converted into a volumetric form using a hardware-assisted slice sweeping algorithm. In the second phase of the algorithm, the attributes stored in the volume are used as texture coordinates to look up an appearance texture to generate both informative and aesthetic representations of the underlying vector field. Users can change the input textures and instantaneously visualize the rendering results. With our algorithm, visualizations with enhanced structural perception using various visual cues can be rendered in real time. A myriad of existing geometry-based and texture-based visualization techniques can also be emulated.
One of the reasons that topological methods have a limited popularity for the visualization of complex 3D flow fields is the fact that such topological structures contain a number of separating stream surfaces. Since ...
详细信息
One of the reasons that topological methods have a limited popularity for the visualization of complex 3D flow fields is the fact that such topological structures contain a number of separating stream surfaces. Since these stream surfaces tend to hide each other as well as other topological features, for complex 3D topologies the visualizations become cluttered and hardly interpretable. This paper proposes to use particular stream lines called saddle connectors instead of separating stream surfaces and to depict single surfaces only on user demand. We discuss properties and computational issues of saddle connectors and apply these methods to complex flowdata. We show that the use of saddle connectors makes topological skeletons available as a valuable visualization tool even for topologically complex 3D flowdata.
暂无评论