In this paper, we obtain and study typical beam entropy values for millimetre wave (mm-wave) channel models using the NYUSIM simulator for frequencies up to 100 GHz for fifth generation (5G) and beyond 5G cellular communication systems. The beam entr
opy is used to quantify sparse MIMO channel randomness in beamspace. Lower relative beam entropy channels are suitable for memory-assisted statistically-ranked (MarS) and hybrid radio frequency (RF) beam training algorithms. High beam entropies can potentially be advantageous for low overhead secured radio communications by generating cryptographic keys based on channel randomness in beamspace, especially for sparse multiple input multiple output (MIMO) channels. Urban micro (UMi), urban macro (UMa) and rural macro (RMa) cellular scenarios have been investigated in this work for 28, 60, 73 and 100 GHz.
This paper presents a novel radio frequency (RF) beam training algorithm for sparse multiple input multiple output (MIMO) channels using unitary RF beamforming codebooks at transmitter (Tx) and receiver (Rx). The algorithm leverages statistical knowl
edge from past beam data for expedited beam search with statistically-minimal training overheads. Beams are tested in the order of their ranks based on their probabilities for providing a communication link. For low beam entropy scenarios, statistically-ranked beam search performs excellent in reducing the average number of beam tests per Tx-Rx beam pair identification for a communication link. For high beam entropy cases, a hybrid algorithm involving both memory-assisted statistically-ranked (MarS) beam search and multi-level (ML) beam search is also proposed. Savings in training overheads increase with decrease in beam entropy and increase in MIMO channel dimensions.
This paper addresses the energy-saving problem for the downlink of heterogeneous networks, which aims at minimizing the total base stations (BSs) power consumption while each users rate requirement is supported. The basic idea of this work is to make
use of the flexibility and scalability of the system such that more benefits can be gained by efficient resource management. This motivates us to propose a flexible BS power consumption model, which can control system resources, such as antennas, frequency carriers and transmit power allocation in an energy efficient manner rather than the on/off binary sleep mode for BSs. To denote these power-saving modes, we employ the group sparsity of the transmit power vector instead of the {0, 1} variables. Based on this power model, a semi-dynamic green resource management mechanism is proposed, which can jointly solve a series of resource management problems, including BS association, frequency carriers (FCs) assignment, and the transmit power allocation, by group sparse power control based on the large scale fading values. In particular, the successive convex approximation (SCA)-based algorithm is applied to solve a stationary solution to the original non-convex problem. Simulation results also verify the proposed BS power model and the green resource management mechanism.
We consider energy-efficient wireless resource management in cellular networks where BSs are equipped with energy harvesting devices, using statistical information for traffic intensity and harvested energy. The problem is formulated as adapting BSs
on-off states, active resource blocks (e.g. subcarriers) as well as power allocation to minimize the average grid power consumption in a given time period while satisfying the users quality of service (blocking probability) requirements. It is transformed into an unconstrained optimization problem to minimize a weighted sum of grid power consumption and blocking probability. A two-stage dynamic programming (DP) algorithm is then proposed to solve this optimization problem, by which the BSs on-off states are optimized in the first stage, and the active BSs resource blocks are allocated iteratively in the second stage. Compared with the optimal joint BSs on-off states and active resource blocks allocation algorithm, the proposed algorithm greatly reduces the computational complexity, while at the same time achieves close to the optimal energy saving performance.
A virtual multiple-input multiple-output (MIMO) wireless system using the receiver-side cooperation with the compress-and-forward (CF) protocol, is an alternative to a point-to-point MIMO system, when a single receiver is not equipped with multiple a
ntennas. It is evident that the practicality of CF cooperation will be greatly enhanced if an efficient source coding technique can be used at the relay. It is even more desirable that CF cooperation should not be unduly sensitive to carrier frequency offsets (CFOs). This paper presents a practical study of these two issues. Firstly, codebook designs of the Voronoi vector quantization (VQ) and the tree-structure vector quantization (TSVQ) to enable CF cooperation at the relay are described. A comparison in terms of the codebook design and encoding complexity is analyzed. It is shown that the TSVQ is much simpler to design and operate, and can achieve a favorable performance-complexity tradeoff. Furthermore, this paper demonstrates that CFO can lead to significant performance degradation for the virtual MIMO system. To overcome this, it is proposed to maintain clock synchronization and jointly estimate the CFO between the relay and the destination. This approach is shown to provide a significant performance improvement.
This paper presents a novel power spectral density estimation technique for band-limited, wide-sense stationary signals from sub-Nyquist sampled data. The technique employs multi-coset sampling and incorporates the advantages of compressed sensing (C
S) when the power spectrum is sparse, but applies to sparse and nonsparse power spectra alike. The estimates are consistent piecewise constant approximations whose resolutions (width of the piecewise constant segments) are controlled by the periodicity of the multi-coset sampling. We show that compressive estimates exhibit better tradeoffs among the estimators resolution, system complexity, and average sampling rate compared to their noncompressive counterparts. For suitable sampling patterns, noncompressive estimates are obtained as least squares solutions. Because of the non-negativity of power spectra, compressive estimates can be computed by seeking non-negative least squares solutions (provided appropriate sampling patterns exist) instead of using standard CS recovery algorithms. This flexibility suggests a reduction in computational overhead for systems estimating both sparse and nonsparse power spectra because one algorithm can be used to compute both compressive and noncompressive estimates.
