This paper presents a novel blind adaptive noncoherent decorrelative multiuser detector for nonlinearly modulated satellite mobile Code Division Multiple Access (CDMA) systems. By using the known signature waveforms o...This paper presents a novel blind adaptive noncoherent decorrelative multiuser detector for nonlinearly modulated satellite mobile Code Division Multiple Access (CDMA) systems. By using the known signature waveforms of the counterpart earth station in the blind adaptive multiuser detector, the system performance has been improved obviously. The computation results about the convergence properties of the new detector and the previous detectors demonstrate that the proposed multiuser detector has better performance than previous multiuser detectors for nonlinearly modulated CDMA systems.展开更多
In remote terrestrial-satellite networks, caching is a very promising technique to alleviate the burden of space cloudlet(e.g., cache-enabled satellite user terminal) and to improve subscribers' quality of experie...In remote terrestrial-satellite networks, caching is a very promising technique to alleviate the burden of space cloudlet(e.g., cache-enabled satellite user terminal) and to improve subscribers' quality of experience(Qo E) in terms of buffering delay and achievable video streaming rate. In this paper, we studied a Qo E-driven caching placement optimization problem for video streaming that takes into account the required video streaming rate and the social relationship among users. Social ties between users are used to designate a set of helpers with caching capability, which can cache popular files proactively when the cloudlet is idle. We model the utility function of Qo E as a logarithmic function. Then, the caching placement problem is formulated as an optimization problem to maximize the user's average Qo E subject to the storage capacity constraints of the helpers and the cloudlets. Furthermore, we reformulate the problem into a monotone submodular optimization problem with a partition matroid constraint, and an efficient greedy algorithm with 1-1 e approximation ratio is proposed to solve it. Simulation results show that the proposed caching placement approach significantly outperforms the traditional approaches in terms of Qo E, while yields about the same delay and hit ratio performance compare to the delay-minimized scheme.展开更多
文摘This paper presents a novel blind adaptive noncoherent decorrelative multiuser detector for nonlinearly modulated satellite mobile Code Division Multiple Access (CDMA) systems. By using the known signature waveforms of the counterpart earth station in the blind adaptive multiuser detector, the system performance has been improved obviously. The computation results about the convergence properties of the new detector and the previous detectors demonstrate that the proposed multiuser detector has better performance than previous multiuser detectors for nonlinearly modulated CDMA systems.
基金supported by Natural Science Foundation of China under Grant No.91738202,91438206
文摘In remote terrestrial-satellite networks, caching is a very promising technique to alleviate the burden of space cloudlet(e.g., cache-enabled satellite user terminal) and to improve subscribers' quality of experience(Qo E) in terms of buffering delay and achievable video streaming rate. In this paper, we studied a Qo E-driven caching placement optimization problem for video streaming that takes into account the required video streaming rate and the social relationship among users. Social ties between users are used to designate a set of helpers with caching capability, which can cache popular files proactively when the cloudlet is idle. We model the utility function of Qo E as a logarithmic function. Then, the caching placement problem is formulated as an optimization problem to maximize the user's average Qo E subject to the storage capacity constraints of the helpers and the cloudlets. Furthermore, we reformulate the problem into a monotone submodular optimization problem with a partition matroid constraint, and an efficient greedy algorithm with 1-1 e approximation ratio is proposed to solve it. Simulation results show that the proposed caching placement approach significantly outperforms the traditional approaches in terms of Qo E, while yields about the same delay and hit ratio performance compare to the delay-minimized scheme.
