The two dimensional systolic array for multiplication in binary field GF(2m) with LSB (Least Significant Bit) first algorithm proposed by Yeh et al. has the unfavorable property of bidirectional data flows compared wi...
详细信息
We propose a new linear array for multiplication in GF(2m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our ar...
详细信息
The initial-boundary value problem for a non-stationary transport equation is considered. This is rewritten as a Cauchy problem: dφ/ dφ + Aφ = F, φ 1=0 = φ0. The unknown φ represents a suitable subset of a Hilbe...
详细信息
The initial-boundary value problem for a non-stationary transport equation is considered. This is rewritten as a Cauchy problem: dφ/ dφ + Aφ = F, φ 1=0 = φ0. The unknown φ represents a suitable subset of a Hilbert space, whose elements are pairs of eal-valued functions depending on three variables: a space variable z∈[0, H], an angle variable v, with μ = cos v ∈ [0, 1] and a time variable t∈[0, 7]. A difference scheme is given in order to approximate the space derivatives appearing in A. Then, the operator A is decomposed as A = A1 + A2 and another difference scheme is given to approximate the time derivatives. Finally, the umerical integration with respect to μ is carried out. One obtains an algorithm, which approximates the exact solution with an accuracy of second order in time step τ and in space step h. Several numerical examples are included.
In this paper we present an algorithm for solving a Dirichlet problem for the stationary equation of the form - Δφ(x, y) + k2φ(x, y) = -f(x, y), (x, y) ∈ D = [0,1] × [0,1]. The numerical examples allow a deta...
详细信息
In this paper we present an algorithm for solving a Dirichlet problem for the stationary equation of the form - Δφ(x, y) + k2φ(x, y) = -f(x, y), (x, y) ∈ D = [0,1] × [0,1]. The numerical examples allow a detailed analysis of the problem solution, which depends of the form of f, the value of k and of the step h of the network defined on D.
In this paper we prove the existence and uniqueness of the solution of a boundary value problem for a non-homogeneous Helmholtz equation using the methods of the abstract functional analysis,[l].
In this paper we prove the existence and uniqueness of the solution of a boundary value problem for a non-homogeneous Helmholtz equation using the methods of the abstract functional analysis,[l].
Adaptive power topology control (APTC) is a local algorithm for constructing a one-parameter family of θ-graphs, where each node increases power until it has a neighbor in every θ sector around it. We show it is pos...
详细信息
ISBN:
(纸本)1595933344
Adaptive power topology control (APTC) is a local algorithm for constructing a one-parameter family of θ-graphs, where each node increases power until it has a neighbor in every θ sector around it. We show it is possible to use such a local geometric θ-constraint to ensure full network connectivity, and consider tradeoffs between assumptions about the wireless footprint and constraints on the boundary nodes. In particular, we show that if the boundary nodes can communicate with neighboring boundary nodes and all interior nodes satisfy a θI B I < π constraint on interior nodes, we can guarantee full network connectivity using only a "weak-monotonicity" footprint assumption. The weak-monotonicity model, introduced herein, is much less restrictive than the disk model of coverage and captures aspects of the spatial correlations inherent in signal propagation and noise. We show that under the idealized disk model of coverage, APTC constructs graphs that are sparse. Finally, we show that if the wireless footprint has sufficiently small "eccentricity", then there is some θ for which greedy geometric routing always succeeds. Copyright 2006 ACM.
Adaptive power topology control (APTC) is a local algorithm for constructing a one-parameter family of thetas-graphs, where each node increases power until it has a neighbor in every thetas sector around it. We show i...
详细信息
Adaptive power topology control (APTC) is a local algorithm for constructing a one-parameter family of thetas-graphs, where each node increases power until it has a neighbor in every thetas sector around it. We show it is possible to use such a local geometric thetas-constraint to ensure full network connectivity, and consider tradeoffs between assumptions about the wireless footprint and constraints on the boundary nodes. In particular, we show that if the boundary nodes can communicate with neighboring boundary nodes and all interior nodes satisfy a thetas I B<3pi/2 constraint on the boundary nodes, together with the thetas I
We prove that the L(2,1)-LABELING problem is NP-complete for graphs of treewidth two, thus adding a natural and well studied problem to the short list of problems whose computational complexity separates treewidth one...
详细信息
In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. We assume that each node in the network has a set of discrete levels of transmission power and nodes are relatively static....
详细信息
In this paper, an algorithm for determining the solution of a boundary value problem for an integral-differential equation is presented Using the method of decomposition for a transport equation in the stationary case...
详细信息
In this paper, an algorithm for determining the solution of a boundary value problem for an integral-differential equation is presented Using the method of decomposition for a transport equation in the stationary case and a plan-parallel geometry we obtain an approximate solution with an algorithm based on the variational form of the integral identity method Some examples are included.
暂无评论