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 work derives the success probability, spatial average rate, and area spectral efficiency performances for both cellular users and D2D users by taking into account the different channel propagations that they experience by employing stochastic geometry as an analysis framework to derive closed-form expressions for above performance metrics.
Abstract: Using Device-to-device (D2D) communications in a cellular network is an economical and effective approach to increase the transmission data rate and extend the coverage. Nevertheless, the D2D underlaid cellular network is challenging due to the presence of inter-tier and intra-tier interferences. With necessarily lower antenna heights in D2D communication links, the fading channels are likely to contain strong line-of-sight components, which are different from the Rayleigh fading distribution in conventional two-tier heterogeneous networks. In this paper, we derive the success probability, spatial average rate, and area spectral efficiency performances for both cellular users and D2D users by taking into account the different channel propagations that they experience. Specifically, we employ stochastic geometry as an analysis framework to derive closed-form expressions for above performance metrics. Furthermore, to reduce cross-tier interferences and improve system performances, we propose a centralized opportunistic access control scheme as well as a mode selection mechanism. According to the analysis and simulations, we obtain interesting tradeoffs that depend on the effect of the channel propagation parameter, user node density, and the spectrum occupation ratio on the different performance metrics. This work highlights the importance of incorporating the suitable channel propagation model into the system design and analysis to obtain the realistic results and conclusions.

149 citations

Journal ArticleDOI
TL;DR: The characteristics of fog computing and services based on fog computing platform provided for VANETs are discussed, and some opportunities for challenges and issues are mentioned, and related techniques that need to be considered have been discussed in the context of fog Computing in VANets.

149 citations

Proceedings ArticleDOI
23 Aug 2010
TL;DR: This paper proposes a robust and rapid head-shoulder detector for people counting that can detect the head-shoulders of people robustly, even though there are partial occlusions occurred, and uses Principal Components Analysis to reduce the dimension of the multilevel HOG-LBP feature set.
Abstract: Robustly counting the number of people for surveillance systems has widespread applications. In this paper, we propose a robust and rapid head-shoulder detector for people counting. By combining the multilevel HOG (Histograms of Oriented Gradients) with the multilevel LBP (Local Binary Pattern) as the feature set, we can detect the head-shoulders of people robustly, even though there are partial occlusions occurred. To further improve the detection performance, Principal Components Analysis (PCA) is used to reduce the dimension of the multilevel HOG-LBP feature set. Our experiments show that the PCA based multilevel HOG-LBP descriptors are more discriminative, more robust than the state-of-the-art algorithms. For the application of the real-time people-flow estimation, we also incorporate our detector into the particle filter tracking and achieve convincing accuracy

149 citations

Journal ArticleDOI
TL;DR: This paper offers the researchers a link to public image database for the algorithm assessment of text extraction from natural scene images and draws attention to studies on the first two steps in the extraction process, since OCR is a well-studied area where powerful algorithms already exist.

149 citations

Journal ArticleDOI
TL;DR: A list successive cancellation decoding algorithm to boost the performance of polar codes is proposed and simulation results of LSC decoding in the binary erasure channel and binary-input additive white Gaussian noise channel show a significant performance improvement.
Abstract: A list successive cancellation (LSC) decoding algorithm to boost the performance of polar codes is proposed. Compared with traditional successive cancellation decoding algorithms, LSC simultaneously produces at most L locally best candidates during the decoding process to reduce the chance of missing the correct codeword. The complexity of the proposed algorithm is O ( LN log N ), where N and L are the code length and the list size, respectively. Simulation results of LSC decoding in the binary erasure channel and binary-input additive white Gaussian noise channel show a significant performance improvement.

149 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