Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userChannel Estimation Techniques for Quantized Distributed Reception in MIMO Systems
193
0
0.0
(
0
)
Added by
Junil Choi
Publication date
2014
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The Internet of Things (IoT) could enable the development of cloud multiple-input multiple-output (MIMO) systems where internet-enabled devices can work as distributed transmission/reception entities. We expect that spatial multiplexing with distributed reception using cloud MIMO would be a key factor of future wireless communication systems. In this paper, we first review practical receivers for distributed reception of spatially multiplexed transmit data where the fusion center relies on quantized received signals conveyed from geographically separated receive nodes. Using the structures of these receivers, we propose practical channel estimation techniques for the block-fading scenario. The proposed channel estimation techniques rely on very simple operations at the received nodes while achieving near-optimal channel estimation performance as the training length becomes large.
rate research
Read More
The Internet of things (IoT) holds much commercial potential and could facilitate distributed multiple-input multiple-output (MIMO) communication in future systems. We study a distributed reception scenario in which a transmitter equipped with multiple antennas sends multiple streams via spatial multiplexing to a large number of geographically separated single antenna receive nodes. The receive nodes then quantize their received signals and forward the quantized received signals to a receive fusion center. With global channel knowledge and forwarded quantized information from the receive nodes, the fusion center attempts to decode the transmitted symbols. We assume the transmit vector consists of phase shift keying (PSK) constellation points, and each receive node quantizes its received signal with one bit for each of the real and imaginary parts of the signal to minimize the transmission overhead between the receive nodes and the fusion center. Fusing this data is a non-trivial problem because the receive nodes cannot decode the transmitted symbols before quantization. Instead, each receive node processes a single quantity, i.e., the received signal, regardless of the number of transmitted symbols. We develop an optimal maximum likelihood (ML) receiver and a low-complexity zero-forcing (ZF)-type receiver at the fusion center. Despite its suboptimality, the ZF-type receiver is simple to implement and shows comparable performance with the ML receiver in the low signal-to-noise ratio (SNR) regime but experiences an error rate floor at high SNR. It is shown that this error floor can be overcome by increasing the number of receive nodes. Hence, the ZF-type receiver would be a practical solution for distributed reception with spatial multiplexing in the era of the IoT where we can easily have a large number of receive nodes.
Channel estimation is very challenging when the receiver is equipped with a limited number of radio-frequency (RF) chains in beamspace millimeter-wave (mmWave) massive multiple-input and multiple-output systems. To solve this problem, we exploit a learned denoising-based approximate message passing (LDAMP) network. This neural network can learn channel structure and estimate channel from a large number of training data. Furthermore, we provide an analytical framework on the asymptotic performance of the channel estimator. Based on our analysis and simulation results, the LDAMP neural network significantly outperforms state-of-the-art compressed sensingbased algorithms even when the receiver is equipped with a small number of RF chains. Therefore, deep learning is a powerful tool for channel estimation in mmWave communications.
The problem of wideband massive MIMO channel estimation is considered. Targeting for low complexity algorithms as well as small training overhead, a compressive sensing (CS) approach is pursued. Unfortunately, due to the Kronecker-type sensing (measurement) matrix corresponding to this setup, application of standard CS algorithms and analysis methodology does not apply. By recognizing that the channel possesses a special structure, termed hierarchical sparsity, we propose an efficient algorithm that explicitly takes into account this property. In addition, by extending the standard CS analysis methodology to hierarchical sparse vectors, we provide a rigorous analysis of the algorithm performance in terms of estimation error as well as number of pilot subcarriers required to achieve it. Small training overhead, in turn, means higher number of supported users in a cell and potentially improved pilot decontamination. We believe, that this is the first paper that draws a rigorous connection between the hierarchical framework and Kronecker measurements. Numerical results verify the advantage of employing the proposed approach in this setting instead of standard CS algorithms.
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.
In this paper, we address the message-passing receiver design for the 3D massive MIMO-OFDM systems. With the aid of the central limit argument and Taylor-series approximation, a computationally efficient receiver that performs joint channel estimation and decoding is devised by the framework of expectation propagation. Specially, the local belief defined at the channel transition function is expanded up to the second order with Wirtinger calculus, to transform the messages sent by the channel transition function to a tractable form. As a result, the channel impulse response (CIR) between each pair of antennas is estimated by Gaussian message passing. In addition, a variational expectation-maximization (EM)-based method is derived to learn the channel power-delay-profile (PDP). The proposed joint algorithm is assessed in 3D massive MIMO systems with spatially correlated channels, and the empirical results corroborate its superiority in terms of performance and complexity.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
