skip to main content

Explore Research Products in the NSF-PAR

Title: Hardware-Aware Beamspace Precoding for All-Digital mmWave Massive MU-MIMO
Massive multi-user multiple-input multiple-output (MU-MIMO) wireless systems operating at millimeter-wave (mmWave) frequencies enable simultaneous wideband data transmission to a large number of users. In order to reduce the complexity of MU precoding in all-digital basestation architectures that equip each antenna element with a pair of data converters, we propose a two-stage precoding architecture which first generates a sparse precoding matrix in the beamspace domain, followed by an inverse fast Fourier transform that converts the result to the antenna domain. The sparse precoding matrix requires a small amount of multipliers and enables regular hardware architectures, which allows the design of hardware-efficient all-digital precoders. Simulation results demonstrate that our methods approach the error-rate performance of conventional Wiener filter precoding with more than 2x lower complexity.  more » « less
Award ID(s):
1824379 1717559
NSF-PAR ID:
10295783
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
IEEE Communications Letters
ISSN:
1089-7798
Page Range / eLocation ID:
1 to 1
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; ( , Asilomar Conference on Signals, Systems, and Computers)
    Power consumption of multiuser (MU) precoding is a major concern in all-digital massive MU multiple-input multiple-output (MIMO) basestations with hundreds of antenna elements operating at millimeter-wave (mmWave) frequencies. We propose to replace part of the linear Wiener filter (WF) precoding matrix by a Finite-Alphabet WF Precoding (FAWP) matrix, which enables the use of low-precision hardware that consumes low power and area. To minimize the performance loss of our approach, we present methods that efficiently compute mean-square error (MSE)-optimal FAWP matrices. Our results show that FAWP matrices are able to approach infinite-precision error-rate and error vector magnitude performance with only 3-bit precoding weights, even when operating under realistic mmWave propagation conditions. Hence, FAWP is a promising approach to substantially reduce power consumption and silicon area in all-digital mmWave massive MU-MIMO systems. 
    more » « less
  2. ; ( , IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP))
    null (Ed.)
    We propose equalization-based data detection algorithms for all-digital millimeter-wave (mmWave) massive multiuser multiple-input multiple-out (MU-MIMO) systems that exploit sparsity in the beamspace domain to reduce complexity. We provide a condition on the number of users, basestation antennas, and channel sparsity for which beamspace equalization can be less complex than conventional antenna-domain processing. We evaluate the performance-complexity trade-offs of existing and new beamspace equalization algorithms using simulations with realistic mmWave channel models. Our results reveal that one of our proposed beamspace equalization algorithms achieves up to 8× complexity reduction under line-of-sight conditions, assuming a sufficiently large number of transmissions within the channel coherence interval. 
    more » « less
  3. ; ; ; ( , 2018 IEEE 52nd Asilomar Conference on Signals, Systems, and Computers)
    Massive multi-user multiple-input multiple-output (MU-MIMO) enables significant gains in spectral efficiency and link reliability compared to conventional, small-scale MIMO technology. In addition, linear precoding using zero forcing or Wiener filter (WF) precoding is sufficient to achieve excellent error rate performance in the massive MU-MIMO downlink. However, these methods typically require centralized processing at the base-station (BS), which causes (i) excessively high interconnect and chip input/output data rates, and (ii) high implementation complexity. We propose two feed-forward architectures and corresponding decentralized WF precoders that parallelize precoding across multiple computing fabrics, effectively mitigating the limitations of centralized approaches. To demonstrate the efficacy of our decentralized precoders, we provide implementation results on a multi-GPU system, which show that our solutions achieve throughputs in the Gbit/s regime while achieving (near-)optimal error-rate performance in the massive MU-MIMO downlink. 
    more » « less
  4. ; ; ; ( , Asilomar Conference on Signals, Systems, and Computers)
    Massive multi-user multiple-input multiple-output (MU-MIMO) enables significant gains in spectral efficiency and link reliability compared to conventional, small-scale MIMO technology. In addition, linear precoding using zero forcing or Wiener filter (WF) precoding is sufficient to achieve excellent error rate performance in the massive MU-MIMO downlink. However, these methods typically require centralized processing at the base-station (BS), which causes (i) excessively high interconnect and chip input/output data rates, and (ii) high implementation complexity. We propose two feedforward architectures and corresponding decentralized WF precoders that parallelize precoding across multiple computing fabrics, effectively mitigating the limitations of centralized approaches. To demonstrate the efficacy of our decentralized precoders, we provide implementation results on a multi-GPU system, which show that our solutions achieve throughputs in the Gbit/s regime while achieving (near-)optimal error-rate performance in the massive MU-MIMO downlink. 
    more » « less
  5. ; ; ; ( , IEEE International Symposium on Information Theory (ISIT))
    Massive multi-user (MU) multiple-input multiple-output (MIMO) promises significant gains in spectral efficiency compared to traditional, small-scale MIMO technology. Linear equalization algorithms, such as zero forcing (ZF) or minimum mean-square error (MMSE)-based methods, typically rely on centralized processing at the base station (BS), which results in (i) excessively high interconnect and chip input/output data rates, and (ii) high computational complexity. In this paper, we investigate the achievable rates of decentralized equalization that mitigates both of these issues. We consider two distinct BS architectures that partition the antenna array into clusters, each associated with independent radio-frequency chains and signal processing hardware, and the results of each cluster are fused in a feedforward network. For both architectures, we consider ZF, MMSE, and a novel, non-linear equalization algorithm that builds upon approximate message passing (AMP), and we theoretically analyze the achievable rates of these methods. Our results demonstrate that decentralized equalization with our AMP-based methods incurs no or only a negligible loss in terms of achievable rates compared to that of centralized solutions. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email