Results 1 - 10 of 36,808

Efficient Link Capacity and QoS Design for Network-on-Chip

by Zvika Guz, Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam Kolodny - In Proc. of Design, Automation and Test in Europe , 2006
"... This paper addresses the allocation of link capacities in the automated design process of a network-on-chip based system. Communication resource costs are minimized under Quality-of-Service timing constraints. First, we introduce a novel analytical delay model for virtual channeled wormhole networks ..."
Abstract - Cited by 16 (2 self) - Add to MetaCart
networks with non-uniform link capacities that eliminates costly simulations at the inner-loop of the optimization process. Second, we present an efficient capacity allocation algorithm that assigns link capacities such that packet delays requirements for each flow are satisfied. We demonstrate the benefit

Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading

by Thomas L. Marzetta, Bertrand M. Hochwald
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flat-fading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract - Cited by 495 (22 self) - Add to MetaCart
interval of T symbol periods, after which they change to new independent values which they maintain for another T symbol periods, and so on. Computing the link capacity, associated with channel coding over multiple fading intervals, requires an optimization over the joint density of T M complex transmitted

1 Efficient Link Capacity and QoS Design for Wormhole Network-on-Chip

by unknown authors
"... The allocation of link capacities is an important phase in the automated design process of a network on chip based system. Communication resources must be efficiently allocated so that Quality of Service requirements are met but total network cost is minimized. The paper contributions are twofold: F ..."
Abstract - Add to MetaCart
The allocation of link capacities is an important phase in the automated design process of a network on chip based system. Communication resources must be efficiently allocated so that Quality of Service requirements are met but total network cost is minimized. The paper contributions are twofold

Theoretical improvements in algorithmic efficiency for network flow problems

by Jack Edmonds, Richard M. Karp - , 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract - Cited by 560 (0 self) - Add to MetaCart
in the flow value then, provided the capacities are integral, a maximum flow will be determined within at most 1 + logM/(M--1) if(t, S) augmentations, wheref*(t, s) is the value of the maximum flow and M is the maximum number of arcs across a cut. Next a new algorithm is given for the minimum-cost flow

The Contourlet Transform: An Efficient Directional Multiresolution Image Representation

by Minh N. Do, Martin Vetterli - IEEE TRANSACTIONS ON IMAGE PROCESSING
"... The limitations of commonly used separable extensions of one-dimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” two-dimensional transform that can capture the intrinsic geometrical structure t ..."
Abstract - Cited by 513 (20 self) - Add to MetaCart
link between the developed filter bank and the associated continuousdomain contourlet expansion via a directional multiresolution analysis framework. We show that with parabolic scaling and sufficient directional vanishing moments, contourlets achieve the optimal approximation rate for piecewise smooth

Tinysec: A link layer security architecture for wireless sensor networks

by Chris Karlof, Naveen Sastry, David Wagner - in Proc of the 2nd Int’l Conf on Embedded Networked Sensor Systems
"... We introduce TinySec, the first fully-implemented link layer security architecture for wireless sensor networks. In our design, we leverage recent lessons learned from design vulnerabilities in security protocols for other wireless networks such as 802.11b and GSM. Conventional security protocols te ..."
Abstract - Cited by 521 (0 self) - Add to MetaCart
results on a 36 node distributed sensor network application clearly demonstrate that software based link layer protocols are feasible and efficient, adding less than 10 % energy, latency, and bandwidth overhead.

On limits of wireless communications in a fading environment when using multiple antennas

by G. J. Foschini, M. J. Gans - Wireless Personal Communications , 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (M ..."
Abstract - Cited by 2426 (14 self) - Add to MetaCart
communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how

A Strategic Model of Social and Economic Networks

by Matthew O. Jackson, Asher Wolinsky - CMSEMS Discussion Paper 1098, Northwestern University, revised , 1995
"... We study the stability and efficiency of social and economic networks, when selfinterested individuals can form or sever links. First, for two stylized models, we characterize the stable and efficient networks. There does not always exist a stable network that is efficient. Next, we show that this t ..."
Abstract - Cited by 664 (22 self) - Add to MetaCart
We study the stability and efficiency of social and economic networks, when selfinterested individuals can form or sever links. First, for two stylized models, we characterize the stable and efficient networks. There does not always exist a stable network that is efficient. Next, we show

Is learning by exporting important? Micro-dynamic evidence from Colombia, Mexico and Morocco

by Sofronis K. Clerides, Saul Lach, James R. Tybout - Quarterly Journal of Economics , 1998
"... Do firms become more efficient after becoming exporters? Do exporters generate positive externalities for domestically oriented producers? In this paper we tackle these questions by analyzing the causal links between exporting and productivity using plant-level data. We look for evidence that firms ..."
Abstract - Cited by 604 (13 self) - Add to MetaCart
Do firms become more efficient after becoming exporters? Do exporters generate positive externalities for domestically oriented producers? In this paper we tackle these questions by analyzing the causal links between exporting and productivity using plant-level data. We look for evidence that firms

An algebraic approach to network coding

by Ralf Koetter, Muriel Médard - IEEE/ACM TRANSACTIONS ON NETWORKING , 2003
"... We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary n ..."
Abstract - Cited by 858 (88 self) - Add to MetaCart
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary
Results 1 - 10 of 36,808