scispace - formally typeset
Search or ask a question
Institution

Beijing University of Posts and Telecommunications

EducationBeijing, Beijing, China
About: Beijing University of Posts and Telecommunications is a education organization based out in Beijing, Beijing, China. It is known for research contribution in the topics: MIMO & Quality of service. The organization has 39576 authors who have published 41525 publications receiving 403759 citations. The organization is also known as: BUPT.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper introduces an edge computing based hierarchical architecture for efficient distribution of large-volume vehicular data and proposes a multi-place multi-factor prefetching scheme to meet the rapid topology change and unbalanced traffic.
Abstract: By leveraging the 5G enabled vehicular ad hoc network (5G-VANET), it is widely recognized that connected vehicles have the potentials to improve road safety, transportation intelligence and provide in-vehicle entertainment experience. However, many enabling applications in 5G-VANET rely on the efficient content sharing among mobile vehicles, which is a very challenging issue due to the extremely large data volume, rapid topology change, and unbalanced traffic. In this paper, we investigate content prefetching and distribution in 5G-VANET. We first introduce an edge computing based hierarchical architecture for efficient distribution of large-volume vehicular data. We then propose a multi-place multi-factor prefetching scheme to meet the rapid topology change and unbalanced traffic. The content requests of vehicles can be served by neighbors, which can improve the sharing efficiency and alleviate the burden of networks. Furthermore, we use a graph theory based approach to solve the content distribution by transforming it into a maximum weighted independent set problem. Finally, the proposed scheme is evaluated with a greedy transmission strategy to demonstrate its efficiency.

116 citations

Journal ArticleDOI
TL;DR: A two-party quantum private comparison protocol using single photons, in which two distrustful parties can compare whether their secrets are equal with the help of a third party (TP), which will not be leaked out even with a compromised TP.
Abstract: We propose a two-party quantum private comparison protocol using single photons, in which two distrustful parties can compare whether their secrets are equal with the help of a third party (TP). Any information about the values of their respective secrets will not be leaked out even with a compromised TP. Security is also discussed.

116 citations

Journal ArticleDOI
TL;DR: An optimized block-floating-point (BFP) arithmetic is adopted in the accelerator for efficient inference of deep neural networks in this paper, and improves the energy and hardware efficiency by three times.
Abstract: Convolutional neural networks (CNNs) are widely used and have achieved great success in computer vision and speech processing applications. However, deploying the large-scale CNN model in the embedded system is subject to the constraints of computation and memory. An optimized block-floating-point (BFP) arithmetic is adopted in our accelerator for efficient inference of deep neural networks in this paper. The feature maps and model parameters are represented in 16-bit and 8-bit formats, respectively, in the off-chip memory, which can reduce memory and off-chip bandwidth requirements by 50% and 75% compared to the 32-bit FP counterpart. The proposed 8-bit BFP arithmetic with optimized rounding and shifting-operation-based quantization schemes improves the energy and hardware efficiency by three times. One CNN model can be deployed in our accelerator without retraining at the cost of an accuracy loss of not more than 0.12%. The proposed reconfigurable accelerator with three parallelism dimensions, ping-pong off-chip DDR3 memory access, and an optimized on-chip buffer group is implemented on the Xilinx VC709 evaluation board. Our accelerator achieves a performance of 760.83 GOP/s and 82.88 GOP/s/W under a 200-MHz working frequency, significantly outperforming previous accelerators.

116 citations

Proceedings ArticleDOI
12 Jul 2018
TL;DR: This paper proposes an automated approach named CiD for systematically modelling the lifecycle of the Android APIs and analysing app bytecode to flag usages that can lead to potential compatibility issues, and demonstrates the usefulness of CiD by helping developers repair their apps.
Abstract: The Android Application Programming Interface provides the necessary building blocks for app developers to harness the functionalities of the Android devices, including for interacting with services and accessing hardware. This API thus evolves rapidly to meet new requirements for security, performance and advanced features, creating a race for developers to update apps. Unfortunately, given the extent of the API and the lack of automated alerts on important changes, Android apps are suffered from API-related compatibility issues. These issues can manifest themselves as runtime crashes creating a poor user experience. We propose in this paper an automated approach named CiD for systematically modelling the lifecycle of the Android APIs and analysing app bytecode to flag usages that can lead to potential compatibility issues. We demonstrate the usefulness of CiD by helping developers repair their apps, and we validate that our tool outperforms the state-of-the-art on benchmark apps that take into account several challenges for automatic detection.

116 citations

Journal ArticleDOI
TL;DR: In this paper, the single nearest and N-nearest RRH association strategies are presented, and the corresponding impact on the ergodic capacity of C-RANs is analyzed, where RRHs are distributed according to a stationary point process.
Abstract: Characterizing user to Remote Radio Head (RRH) association strategies in cloud radio access networks (C-RANs) is critical for performance optimization. In this letter, the single nearest and N--nearest RRH association strategies are presented, and the corresponding impact on the ergodic capacity of C-RANs is analyzed, where RRHs are distributed according to a stationary point process. Closed-form expressions for the ergodic capacity of the proposed RRH association strategies are derived. Simulation results demonstrate that the derived uplink closed-form capacity expressions are accurate. Furthermore, the analysis and simulation results show that the ergodic capacity gain is not linear with either the RRH density or the number of antenna per RRH. The ergodic capacity gain from the RRH density is larger than that from the number of antennas per RRH,which indicates that the association number of the RRH should not be bigger than 4 to balance the performance gain and the implementation cost.

116 citations


Authors

Showing all 39925 results

NameH-indexPapersCitations
Jie Zhang1784857221720
Jian Li133286387131
Ming Li103166962672
Kang G. Shin9888538572
Lei Liu98204151163
Muhammad Shoaib97133347617
Stan Z. Li9753241793
Qi Tian96103041010
Xiaodong Xu94112250817
Qi-Kun Xue8458930908
Long Wang8483530926
Jing Zhou8453337101
Hao Yu8198127765
Mohsen Guizani79111031282
Muhammad Iqbal7796123821
Network Information
Related Institutions (5)
Beihang University
73.5K papers, 975.6K citations

88% related

National Chiao Tung University
52.4K papers, 956.2K citations

87% related

Harbin Institute of Technology
109.2K papers, 1.6M citations

87% related

Tsinghua University
200.5K papers, 4.5M citations

87% related

Southeast University
79.4K papers, 1.1M citations

86% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202394
2022533
20213,009
20203,720
20193,817
20183,296