Hei Victor Cheng
Linköping University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hei Victor Cheng.
asilomar conference on signals, systems and computers | 2013
Hei Victor Cheng; Erik G. Larsson
The effect of frequency offsets on the uplink sum-rate performance of massive MIMO systems is studied in the case of flat fading with pilot assisted estimation. Both collocated and distributed antenna architectures are studied to determine if there is a fundamental preference for collocated or distributed architectures from the perspective of frequency synchronization and its effect on the rate performance in a high mobility environment.
IEEE Transactions on Wireless Communications | 2013
Dzevdan Kapetanovic; Hei Victor Cheng; Wai Ho Mow; Fredrik Rusek
Consider the communication system model y = HFx + n, where H and F are the channel and precoder matrices, x is a vector of data symbols drawn from some lattice-type constellation, such as M-QAM, n is an additive white Gaussian noise vector and y is the received vector. It is assumed that both the transmitter and the receiver have perfect knowledge of the channel matrix H and that the transmitted signal Fx is subject to an average energy constraint. The columns of the matrix HF can be viewed as the basis vectors that span a lattice, and we are interested in the precoder F that maximizes the minimum distance of this lattice. This particular problem remains open within the theory of lattices and the communication theory. This paper provides the complete solution for any nonsingular M × 2 channel matrix H. For real-valued matrices and vectors, the solution is that HF spans the hexagonal lattice. For complex-valued matrices and vectors, the solution is that HF, when viewed in four-dimensional real-valued space, spans the Schlafli lattice D4.
international symposium on wireless communication systems | 2015
Hei Victor Cheng; Emil Björnson; Erik G. Larsson
This paper considers the jointly optimal pilot and data power allocation in single cell uplink massive MIMO systems. A closed form solution for the optimal length of the training interval is derived. Using the spectral efficiency (SE) as performance metric and setting a total energy budget per coherence interval the power control is formulated as optimization problems for two different objective functions: the minimum SE among the users and the sum SE. The optimal power control policy is found for the case of maximizing the minimum SE by converting it to a geometric program (GP). Since maximizing the sum SE is an NP-hard problem, an efficient algorithm is developed for finding KKT (local maximum) points. Simulation results show the advantage of optimizing the power control over both pilot and data power, as compared to heuristic power control policies.
IEEE Transactions on Signal Processing | 2017
Hei Victor Cheng; Emil Björnson; Erik G. Larsson
This paper considers the jointly optimal pilot and data power allocation in single-cell uplink massive multiple-input-multiple-output systems. Using the spectral efficiency (SE) as performance metric and setting a total energy budget per coherence interval, the power control is formulated as optimization problems for two different objective functions: the weighted minimum SE among the users and the weighted sum SE. A closed form solution for the optimal length of the pilot sequence is derived. The optimal power control policy for the former problem is found by solving a simple equation with a single variable. Utilizing the special structure arising from imperfect channel estimation, a convex reformulation is found to solve the latter problem to global optimality in polynomial time. The gain of the optimal joint power control is theoretically justified, and is proved to be large in the low-SNR regime. Simulation results also show the advantage of optimizing the power control over both pilot and data power, as compared to the cases of using full power and of only optimizing the data powers as done in previous work.
international symposium on information theory | 2011
Dzevdan Kapetanovic; Hei Victor Cheng; Wai Ho Mow; Fredrik Rusek
Consider the communication model ȳ = HF x̄ + n̄, where H; F are real-valued matrices, x̄ is a data vector drawn from some real-valued lattice (e.g. M-PAM), n̄ is additive white Gaussian noise and ȳ is the received vector. It is assumed that the transmitter and the receiver have perfect knowledge of the channel matrix H (perfect CSI) and that the transmitted signal F x̄ is subject to an average energy constraint. The columns of the matrix HF can be viewed as basis vectors that span a lattice, and we are interested in the minimum distance of this lattice. More precisely, for a given H, which F under an average energy constraint will maximize the minimum distance of the lattice HF? This particular question remains open within the theory of lattices. This work provides the solution for 2×2 matrices H; F. The answer is an F such that HF is a hexagonal lattice.
IEEE Transactions on Information Theory | 2015
Dzevdan Kapetanovic; Hei Victor Cheng; Wai Ho Mow; Fredrik Rusek
This paper investigates linear precoding over nonsingular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is subject to an energy constraint. It is shown that the optimal precoder only produces a finite number of different lattices, namely perfect lattices, at the receiver. The well-known densest lattice packings are instances of perfect lattices, but are not always the solution. This is a counter-intuitive result as previous work in the area showed a tight connection between densest lattices and minimum distance. Since there are only finite many different perfect lattices, they can theoretically be enumerated offline. A new upper bound on the optimal minimum distance is derived, which significantly improves upon a previously reported bound, and is useful when actually constructing the precoders.
international conference on communications | 2015
Hei Victor Cheng; Daniel Persson; Emil Björnson; Erik G. Larsson
For both maximum ratio transmission (MRT) and zero forcing (ZF) precoding schemes and given any specific rate requirement the optimal transmit power, number of antennas to be used, number of users to be served and number of pilots spent on channel training are found with the objective to minimize the total consumed power at the base station. The optimization problem is solved by finding closed form expressions of the optimal transmit power and then search over the remaining discrete variables. The analysis consists of two parts, the first part investigates the situation when only power consumed in the RF amplifiers is considered. The second part includes both the power consumed in the RF amplifiers and in other transceiver circuits. In the former case having all antennas active while reducing the transmit power is optimal. Adaptive scheme to switch off some of the antennas at the base stations is found to be optimal in the latter case.
international workshop on signal processing advances in wireless communications | 2014
Hei Victor Cheng; Daniel Persson; Erik G. Larsson
We investigate the capacity of the multiple-input-multiple-output channel taking into account the consumed power in the power amplifiers. The mutual information is optimized with a limitation of total consumed power and per-antenna radiated power for a fixed channel with full channel state information at both the transmitter and receiver. The capacity is thus obtained by optimizing the input distribution to maximize the mutual information. Since the optimization problem is non-convex, direct computation of the capacity suffers from high computational complexity. Hence upper and lower bounds on the capacity are given as benchmarks for different ad-hoc schemes. An efficient suboptimal algorithm is also presented. Numerical results show that the suboptimal algorithm performs close to the capacity.
international workshop on signal processing advances in wireless communications | 2018
Hei Victor Cheng; Emil Björnson; Erik G. Larsson
This paper considers the use of non-orthogonal-multiple-access (NOMA) in multiuser MIMO systems in practical scenarios where channel state information (CSI) is acquired through pilot signaling. A new NOMA scheme that uses shared pilots is proposed. Achievable rate analysis is carried out for different pilot signaling schemes, including both uplink and downlink pilots. The achievable rate performance of the proposed NOMA scheme with shared pilot within each group is compared with the traditional orthogonal access scheme with orthogonal pilots. Our proposed scheme is a generalization of the orthogonal scheme, and can be reduced to the orthogonal scheme when appropriate power allocation parameters are chosen. Numerical results show that when downlink CSI is available at the users, our proposed NOMA scheme outperforms orthogonal schemes. However with more groups of users present in the cell, it is preferable to use multi-user beamforming instead of NOMA.
arXiv: Information Theory | 2012
Dzevdan Kapetanovic; Hei Victor Cheng; Wai Ho Mow; Fredrik Rusek