Institution
Huawei
Company•Shenzhen, China•
About: Huawei is a company organization based out in Shenzhen, China. It is known for research contribution in the topics: Terminal (electronics) & Signal. The organization has 41417 authors who have published 44698 publications receiving 343496 citations. The organization is also known as: Huawei Technologies & Huawei Technologies Co., Ltd..
Papers published on a yearly basis
Papers
More filters
••
10 Dec 2012TL;DR: Numerically and experimentally it is shown that expectation maximization (EM) algorithm is a powerful tool in combating system impairments such as fibre nonlinearities, inphase and quadrature (I/Q) modulator imperfections and laser linewidth.
Abstract: In this paper, we show numerically and experimentally that expectation maximization (EM) algorithm is a powerful tool in combating system impairments such as fibre nonlinearities, inphase and quadrature (I/Q) modulator imperfections and laser linewidth. The EM algorithm is an iterative algorithm that can be used to compensate for the impairments which have an imprint on a signal constellation, i.e. rotation and distortion of the constellation points. The EM is especially effective for combating non-linear phase noise (NLPN). It is because NLPN severely distorts the signal constellation and this can be tracked by the EM. The gain in the nonlinear system tolerance for the system under consideration is shown to be dependent on the transmission scenario. We show experimentally that for a dispersion managed polarization multiplexed 16-QAM system at 14 Gbaud a gain in the nonlinear system tolerance of up to 3 dB can be obtained. For, a dispersion unmanaged system this gain reduces to 0.5 dB.
87 citations
••
15 Jun 2019TL;DR: In this article, the relationship between the input feature maps and 2D kernels is revealed in a theoretical framework, based on which a kernel sparsity and entropy (KSE) indicator is proposed to quantitate the feature map importance in a feature-agnostic manner to guide model compression.
Abstract: Compressing convolutional neural networks (CNNs) has received ever-increasing research focus. However, most existing CNN compression methods do not interpret their inherent structures to distinguish the implicit redundancy. In this paper, we investigate the problem of CNN compression from a novel interpretable perspective. The relationship between the input feature maps and 2D kernels is revealed in a theoretical framework, based on which a kernel sparsity and entropy (KSE) indicator is proposed to quantitate the feature map importance in a feature-agnostic manner to guide model compression. Kernel clustering is further conducted based on the KSE indicator to accomplish high-precision CNN compression. KSE is capable of simultaneously compressing each layer in an efficient way, which is significantly faster compared to previous data-driven feature map pruning methods. We comprehensively evaluate the compression and speedup of the proposed method on CIFAR-10, SVHN and ImageNet 2012. Our method demonstrates superior performance gains over previous ones. In particular, it achieves 4.7× FLOPs reduction and 2.9× compression on ResNet-50 with only a top-5 accuracy drop of 0.35% on ImageNet 2012, which significantly outperforms state-of-the-art methods.
86 citations
••
TL;DR: This paper analyzes the performance of massive MIMO zero-forcing systems using the time-shifted pilot scheme, and compares the performances of conjugate and ZF precoders, from which a simple but effective large-scale fading-based UT scheduling scheme is proposed to enhance the system throughput.
Abstract: Massive multiple-input-multiple-output (MIMO) antenna system implies the use of a large number of base station (BS) antennas to serve a relatively small number of user terminals (UTs) for extraordinary spectral efficiency However, its performance is limited by pilot contamination due to unavoidable reuse of pilot sequences from UTs in different cells In this paper, we analyze the performance of massive MIMO zero-forcing (ZF) systems using the time-shifted pilot scheme, which was known to combat pilot contamination effectively using conjugate beamforming if there is a very large number of antennas We derive expressions for achievable sum rates and the signal-to-interference-plus-noise ratios (SINRs) of forward and reverse links if the number of BS antennas is finite Then, the impact of system parameters, such as cell radius, transmit power, group number (a parameter related to the time-shifted pilot scheme), BS antenna number, etc, on the system performance are revealed Our model embraces a series of previous works as special cases Moreover, we compare the performance of conjugate and ZF precoders, from which a simple but effective large-scale fading-based UT scheduling scheme is proposed to enhance the system throughput
86 citations
••
21 May 2017TL;DR: A comprehensive design of the learning framework is presented that includes the characterization of the system state, a general reward function, and an efficient learning algorithm that quickly learns a power control policy that brings significant energy savings and fairness across users in the system.
Abstract: Optimizing radio transmission power and user data rates in wireless systems requires full system observability. While the problem has been extensively studied in the literature, practical solutions approaching optimality exploiting only the partial observability available in real systems are still lacking. This paper proposes a reinforcement learning approach to downlink power control and rate adaptation in cellular networks that closes this gap. We present a comprehensive design of the learning framework that includes the characterization of the system state, a general reward function, and an efficient learning algorithm. System level simulations show that our design quickly learns a power control policy that brings significant energy savings and fairness across users in the system.
86 citations
••
01 Jun 2021
TL;DR: Zhang et al. as mentioned in this paper proposed a Context-Aware Biaffine Localizing Network (CBLN) which incorporates both local and global contexts into features of each start/end position for biaffin-based localization.
Abstract: This paper addresses the problem of temporal sentence grounding (TSG), which aims to identify the temporal boundary of a specific segment from an untrimmed video by a sentence query. Previous works either compare pre-defined candidate segments with the query and select the best one by ranking, or directly regress the boundary timestamps of the target segment. In this paper, we propose a novel localization framework that scores all pairs of start and end indices within the video simultaneously with a biaffine mechanism. In particular, we present a Context-aware Biaffine Localizing Network (CBLN) which incorporates both local and global contexts into features of each start/end position for biaffine-based localization. The local contexts from the adjacent frames help distinguish the visually similar appearance, and the global contexts from the entire video contribute to reasoning the temporal relation. Besides, we also develop a multi-modal self-attention module to provide fine-grained query-guided video representation for this biaffine strategy. Extensive experiments show that our CBLN significantly outperforms state-of-thearts on three public datasets (ActivityNet Captions, TACoS, and Charades-STA), demonstrating the effectiveness of the proposed localization framework. The code is available at https://github.com/liudaizong/CBLN.
86 citations
Authors
Showing all 41483 results
Name | H-index | Papers | Citations |
---|---|---|---|
Yu Huang | 136 | 1492 | 89209 |
Xiaoou Tang | 132 | 553 | 94555 |
Xiaogang Wang | 128 | 452 | 73740 |
Shaobin Wang | 126 | 872 | 52463 |
Qiang Yang | 112 | 1117 | 71540 |
Wei Lu | 111 | 1973 | 61911 |
Xuemin Shen | 106 | 1221 | 44959 |
Li Chen | 105 | 1732 | 55996 |
Lajos Hanzo | 101 | 2040 | 54380 |
Luca Benini | 101 | 1453 | 47862 |
Lei Liu | 98 | 2041 | 51163 |
Tao Wang | 97 | 2720 | 55280 |
Mohamed-Slim Alouini | 96 | 1788 | 62290 |
Qi Tian | 96 | 1030 | 41010 |
Merouane Debbah | 96 | 652 | 41140 |