Carrier aggregation (CA) is a good solution for third-generation (3G) Long Term Evolution-Advanced (LTE-A) systems to fulfil the system bandwidth (BW) extension requirements and also ensure the backwards compatibility...
详细信息
ISBN:
(纸本)9781849191388
Carrier aggregation (CA) is a good solution for third-generation (3G) Long Term Evolution-Advanced (LTE-A) systems to fulfil the system bandwidth (BW) extension requirements and also ensure the backwards compatibility towards 3G LTE. In this paper, we compare the quality of service (QoS) performances of two different multi-user scheduling schemes in CA based LTE-A systems, i.e. separated random user scheduling (SRUS) and joint user scheduling (JUS). The former is simpler but less efficient while the latter is optimal but with higher signalling overhead. Moreover, only one single component carrier (CC) is needed to access for user equipment (UE) in the case of SRUS while all the CCs have to be connected in the case of JUS. Simulation results show that the SRUS scheme is feasible and only little performance loss in continuous and heavy traffic load scenarios with full or Poisson-based finite buffer traffic input.
The amount of blur on the defocus image depends on the depth information of the scene. So depth of the scene can be estimated by calculating the blur with the knowledge of the lens parameters. A novel depth estimation...
详细信息
The amount of blur on the defocus image depends on the depth information of the scene. So depth of the scene can be estimated by calculating the blur with the knowledge of the lens parameters. A novel depth estimation mode based on oriented heat-flows is proposed in this paper. In this model, the process of image defocusing is described using oriented heat-flows diffusion. The diffusion can be seen as the coupling of two weighted heat flows along orthonormal directions. The diffusion directions are defined by the local coherence geometry of image and the diffusion strength is the function of blur amount. Experimental results show that the model is quite effective and the emergence of artificial depth information in edge can be avoided by using this model.
Based on the minimize spanning tree and Fiedler vector, a new feature matching algorithm is proposed in this paper. Firstly, a weighted complete graph is constructed with the feature points of each image respectively,...
详细信息
The spectrum of a graph has been widely used to characterize the properties of a graph and extract information from its structure. In this paper, we investigate the performance of Laplacian spectrum and multidimension...
详细信息
The spectrum of a graph has been widely used to characterize the properties of a graph and extract information from its structure. In this paper, we investigate the performance of Laplacian spectrum and multidimensional scaling (MDS) as shape recognition and clustering. Firstly, we extract boundary points to characterize the shape and to construct the Laplacian matrix. Secondly, the structural information about graph is described by using the eigenvalues of the Laplacian matrix. Finally, the given shapes are projected onto the low-dimensional space by performing MDS. Meanwhile, the clustering is achieved via analyzing the distribution of shapes. Comparative experiments on the public data sets demonstrate the validation of the proposed algorithm.
Based on the center of graph, a point pattern feature matching method is proposed here. Firstly, a weighted complete graph is constructed with the feature points of each image, and then the center of each graph is fou...
详细信息
A multiuser detector based on Schur algorithm is studied in this paper. Because the computational complexity of the conventional decorrelating detector is high while computing the inverse of system matrices, especiall...
详细信息
A multiuser detector based on Schur algorithm is studied in this paper. Because the computational complexity of the conventional decorrelating detector is high while computing the inverse of system matrices, especially when the system is asynchronous and the number of users is huge. The simulation results show that the performance of the multiuser detector based on Schur algorithm is similar to that of decorrelating detector, but it's computational complexity is much lower than decorrelating detector's.
The resource limitation of mobile devices causes the problem that the existing image processing software based on the centralized computing mode had difficulty running in mobile devices. A solution is given in the pap...
详细信息
Granular computing which imitates the manner of human thinking is the foundation of artificial intelligence. This paper discusses some operations of granules including quotient intersection, quotient union, quotient c...
详细信息
ISBN:
(纸本)9781615676583
Granular computing which imitates the manner of human thinking is the foundation of artificial intelligence. This paper discusses some operations of granules including quotient intersection, quotient union, quotient complement and quotient difference. Then defines a knowledge space and presents it by a group of basis. Besides we introduce granule spaces and their main properties.
In allusion to the boundary leaking problem of traditional active contours when used to extract facial features, two kinds of local information are introduced to enhance the weak boundary, then to build new external f...
详细信息
In this paper, we investigate the problem of increasing the threshold value of the Shamirpsilas (t, n)-threshold scheme without the dealerpsilas helps, and present a new secret sharing scheme with the threshold value ...
详细信息
In this paper, we investigate the problem of increasing the threshold value of the Shamirpsilas (t, n)-threshold scheme without the dealerpsilas helps, and present a new secret sharing scheme with the threshold value increasing. In this scheme, the dealer needs not to pre-compute or publish any information in advance, all participants cooperate to take on the dealerpsilas role and to complete the share renewing, and each participant only stores one share as the same size of the secret. The results of analysis show that the proposed scheme is secure, and it is perfect and ideal.
暂无评论