7707803
Realization of video object plane decoder on mesh on-chip network architecture
5939692
Analyzing the Performance of Mesh and Fat-Tree Topologies for Network on Chip Design
The demand of integration of many heterogeneous semiconductor intellectual property (IP) blocks has been introducing a new chip design paradigm so called on chip network. This paradigm promisingly offers a packet switched network among IPs to reduce the main problems in the very deep sub micron technologies that arise from non-scalable global wire delay, failure to achieve global synchronization, errors due to the signal integrity, non-scalable bus based functional interconnection, etc. This paper introduces interconnected or switched network topologies and also analyze their performances in terms of communication protocol related to the issues such as routing strategy, buffer size, routing algorithm , etc. The above mentioned evaluations are done by utilizing the tool that has been widely used in the research domain of computer network design, so called NS-2.
21559865
The Optimum Network on Chip Architectures for Video Object Plane Decoder Design
On Chip Network (OCN) has been proposed as a new methodology for addressing the design challenges of future massly integrated system in nanoscale. In this paper, three differently heterogenous Tree-based network topologies are proposed as the OCN architectures for Video Object Plane Decoder (VOPD). The topologies are designed in order to maximize the system throughput. This paper also evaluates the proposed topologies by comparing them to other conventional topologies such as 2-D Mesh and Fat-Tree with respects to throughput, power consumption and size. We use the power modelling tool, known as Orion model to calculate the static powers, areas, and dynamic energies of three topologies. The experiment results show that our Tree-based topologies offer similar throughputs as Fat-Tree does and much higher throughputs compared to 2-D Mesh while use less chip areas and power consumptions.
11704041
Rational parametrization of canal surface by 4 dimensional Minkowski Pythagorean hodograph curves
Lorentzian geometry with a Minkowski Pythagorean hodograph (MPH) formalism in R/sup 3,1/ gives us a new and insightful method of rational parametrization of canal surfaces. Our previous works about MPH curves in R/sup 3,1/ shows that a curve /spl gamma/(t)=(x(t),y(t),z(t),r(t)) in R/sup 3,1/ can be represented by the PH representation map in Cl(3,1) which avoids the complex root finding algorithm. Our parametrization method gives us the flexibility to represent the canal surfaces within their fiber ambiguities. This paper constitutes the first step of our ongoing work which deals with the issues for canal surfaces in a truly new and intriguing manner such as finding rotation minimizing frames. We believe this is just the tip of the iceberg and the further work will yield many valuable applications in the area of canal surfaces.
9969836
Efficient route establishment and maintenance in wireless sensor networks with mobile base stations
The integration of ground wireless adhoc networks and airborne UAVs is a promising solution for realtime data collection in wireless sensor networks. Such networks play a vital role in many mission critical tasks such as forest fire-fighting and battlefield support. An important problem is to establish/maintain efficient routing structures in the ground sensor network for packet relaying. Our problem is unique in that the base stations are non-static, which necessitates frequent update of the routing structure. The performance of flooding based methods are evaluated. Particularly, in order to deal with non-uniform node density, we propose to introduce an artificial delay factor to control the flooding pattern. We mathematically prove that the delay should be proportional to local node density. Our simulation results show that the proposed method achieves good load balance among multiple base stations.
35661638
Double-Link Failure Recovery in WDM Optical Torus Networks
Most existing link protection methods have been focused on single-link failures. Recently, the double-link failure model has also been considered. In this model, any two links may fail in an arbitrary order. However, an existing model for protecting the entire network against double-link failures does not always provide a 100% recovery when the link identification is not required for pre-computing backup paths. In this paper, we consider double-link failure models that provide 100% recovery in WDM torus optical networks. Three link protection methods are presented. The first method requires failed link identification, whereas the last two methods do not. Other performance measures such as hop-length and backup capacity are also discussed. Finally, we briefly address how our method is possibly extended to mesh optical networks.
9897452
Facial feature extraction using PCA and wavelet multi-resolution images
This work presents an algorithm for the extraction of the facial feature (eyebrow, eye, nose and mouth) fields from 2-D gray-level face images. The fundamental philosophy is that eigenfeatures, derived from the eigenvalues and eigenvectors of the gray-level data set constructed from the feature fields, are very useful to locate these fields efficiently. In addition, multi-resolution images, derived from a 2-D DWT (Discrete Wavelet Transform), are used to save the search time of the facial features. The experimental results indicate that the proposed algorithm is robust against facial feature size and slight variations of pose.
9824119
Loopback recovery from neighboring double-link failures in WDM mesh networks
Traditional survivable network design assumes that at any time at most a single link or node fails. In optical networks, a single point of failure may lead to the failure of multiple links. In this paper, we consider the design of an optical network that can survive the failures of any two neighboring links. We present a loopback recovery method that requires the computation of backup paths for each link. An optimal algorithm for computing the backup paths is presented. Numerical results comparing the performance of our algorithm with other loopback approaches indicate that a slight increase in capacity can achieve 100% protection under this failure model.