No Arabic abstract
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 antennas. 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 investigates downlink channel estimation in frequency-division duplex (FDD)-based massive multiple-input multiple-output (MIMO) systems. To reduce the overhead of downlink channel estimation and uplink feedback in FDD systems, cascaded precoding has been used in massive MIMO such that only a low-dimensional effective channel needs to be estimated and fed back. On the other hand, traditional channel estimations can hardly achieve the minimum mean-square-error (MMSE) performance due to lack of the a priori knowledge of the channels. In this paper, we design and analyze a strategy for downlink channel estimation based on the parametric model in massive MIMO with cascaded precoding. For a parametric model, channel frequency responses are expressed using the path delays and the associated complex amplitudes. The path delays of uplink channels are first estimated and quantized at the base station, then fed forward to the user equipment (UE) through a dedicated feedforward link. In this manner, the UE can obtain the a priori knowledge of the downlink channel in advance since it has been demonstrated that the downlink and the uplink channels can have identical path delays. Our analysis and simulation results show that the proposed approach can achieve near-MMSE performance.
We consider the problem of channel estimation for uplink multiuser massive MIMO systems, where, in order to significantly reduce the hardware cost and power consumption, one-bit analog-to-digital converters (ADCs) are used at the base station (BS) to quantize the received signal. Channel estimation for one-bit massive MIMO systems is challenging due to the severe distortion caused by the coarse quantization. It was shown in previous studies that an extremely long training sequence is required to attain an acceptable performance. In this paper, we study the problem of optimal one-bit quantization design for channel estimation in one-bit massive MIMO systems. Our analysis reveals that, if the quantization thresholds are optimally devised, using one-bit ADCs can achieve an estimation error close to (with an increase by a factor of $pi/2$) that of an ideal estimator which has access to the unquantized data. The optimal quantization thresholds, however, are dependent on the unknown channel parameters. To cope with this difficulty, we propose an adaptive quantization (AQ) approach in which the thresholds are adaptively adjusted in a way such that the thresholds converge to the optimal thresholds, and a random quantization (RQ) scheme which randomly generate a set of nonidentical thresholds based on some statistical prior knowledge of the channel. Simulation results show that, our proposed AQ and RQ schemes, owing to their wisely devised thresholds, present a significant performance improvement over the conventional fixed quantization scheme that uses a fixed (typically zero) threshold, and meanwhile achieve a substantial training overhead reduction for channel estimation. In particular, even with a moderate number of pilot symbols (about 5 times the number of users), the AQ scheme can provide an achievable rate close to that of the perfect channel state information (CSI) case.
Full-rate space-time block codes (STBCs) achieve high spectral-efficiency by transmitting linear combinations of information symbols through every transmit antenna. However, the coefficients used for the linear combinations, if not chosen carefully, results in ({em i}) large number of processor bits for the encoder and ({em ii}) high peak-to-average power ratio (PAPR) values. In this work, we propose a new class of full-rate STBCs called Integer STBCs (ICs) for multiple-input multiple-output (MIMO) fading channels. A unique property of ICs is the presence of integer coefficients in the code structure which enables reduced numbers of processor bits for the encoder and lower PAPR values. We show that the reduction in the number of processor bits is significant for small MIMO channels, while the reduction in the PAPR is significant for large MIMO channels. We also highlight the advantages of the proposed codes in comparison with the well known full-rate algebraic STBCs.
Sparse code multiple access (SCMA) is a promising multiuser communication technique for the enabling of future massive machine-type networks. Unlike existing codebook design schemes assuming uniform power allocation, we present a novel class of SCMA codebooks which display power imbalance among different users for downlink transmission. Based on the Star-QAM mother constellation structure and with the aid of genetic algorithm, we optimize the minimum Euclidean distance (MED) and the minimum product distance (MPD) of the proposed codebooks. Numerical simulation results show that our proposed codebooks lead to significantly improved error rate performances over Gaussian channels and Rayleigh fading channels.
Although the combination of the orthogonal time frequency space (OTFS) modulation and the massive multiple-input multiple-output (MIMO) technology can make communication systems perform better in high-mobility scenarios, there are still many challenges in downlink channel estimation owing to inaccurate modeling and high pilot overhead in practical systems. In this paper, we propose a channel state information (CSI) acquisition scheme for downlink massive MIMO-OTFS in presence of the fractional Doppler, including deterministic pilot design and channel estimation algorithm. First, we analyze the input-output relationship of the single-input single-output (SISO) OTFS based on the orthogonal frequency division multiplexing (OFDM) modem and extend it to massive MIMO-OTFS. Moreover, we formulate an accurate model for the practical system in which the fractional Doppler is considered and the influence of subpaths is revealed. A deterministic pilot design is then proposed based on the model and the structure of the pilot matrix to reduce pilot overhead and save memory consumption. Since channel geometry changes very slowly relative to the communication timescale, we put forward a modified sensing matrix based channel estimation (MSMCE) algorithm to acquire the downlink CSI. Simulation results demonstrate that the proposed downlink CSI acquisition scheme has significant advantages over traditional algorithms.