Search

In LTE system, control plan and user plan are separated. Therefore ESM sub-layer which belongs to control plan can neither manage the using of physical bearers real time, nor implement the function of up-link traffic flow template UL-TFT. In order to transferring users data correctly and obtaining corresponding QoS service, it is necessary to add a bearer control entity BC in user plan during designing of protocol stack in UE, which can manage bearers and identify service data flows-SDF.

Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two requirements: (1) minimum mean square error and (2) fixed reduction ratio between levels, this paper first transforms the MRQSA problem into the problem of solving a sequence of near-Toeplitz tridiagonal linear systems. Employing the matrix perturbation technique, the MRQSA problem can be solved using about 24mnfloating-point operations, i.e. linear time, if we are given a polygonal surface with (2m−1)×(2n−1) points. A numerical stability analysis is also given. To the best of our knowledge, this is the first time that such a linear algebra approach has been used for solving the MRQSA problem. Some experimental results are carried out to demonstrate the applicability of the proposed method.

Solving circulant Toeplitz tridiagonal systems arises in many engineering applications. This paper presents a fast parallel algorithm for solving this type of systems. The number of floating-point operations required in our algorithm is less than the previous parallel algorithm [cf. Kim and Lee (1990)] for solving the similar system. Specifically, an overlapping technique is proposed to reduce the communication steps required. In addition, an error analysis is given. The implementation of our algorithm on the nCUBE2/E with 16 processors has been carried out. The experimental results show that the speedup is almost linearly proportional to the number of processors.

Matching run-length coded strings (RLCSs) is very important in the field of pattern recognition. This paper considers the design of vectorized matching algorithms that operate directly on RLCSs. We first modify the algorithm of Karp and Rabin (1987) to design a linear-time randomized matching algorithm for RLCSs. Following this algorithm, two new and fast vectorized algorithms are presented. The first one is off-line and the second one is on-line. Some experiments are carried out on a CRAY X-MP EA/ 116se vector supercomputer to demonstrate the good performance of our vectorized algorithms.

The solution of uniform bicubic B-spline curve/surface fitting problem is considered. Based on the matrix perturbation method, this paper first presents a novel approximateO(n/p)-time parallel B-spline curve fitting algorithm for finding the correspondingncontrol points that interpolate thosendata points on a linear array processor withpprocessors, wherep≤n. Givenm×ndata points, we then present anO(mn/(p1p2))-time parallel algorithm for solving the uniform bicubic B-spline surface fitting problem on ap1×p2mesh-connected computer, wherep1≤mandp2≤n. The relative error analyses of our two stable and cost-optimal parallel solvers are also given. When settingp1=mandp2=n, a constant-time parallel solver for B-spline surface fitting can be derived; this time- and cost-optimal result is a direct method, in contrast to the parallel iterative method of Chenget al.(Parallel B-spline surface interpolation on a mesh-connected processor array,J. Parallel Distrib. Comput.24, 2 (1995), 224–229).