pith. sign in

arxiv: 1907.03262 · v1 · pith:K7J4DLYYnew · submitted 2019-07-07 · 💻 cs.IT · math.IT

Max-Min Rate of Cell-Free Massive MIMO Uplink with Optimal Uniform Quantization

Manijeh Bashar , Kanapathippillai Cumanan , Alister G. Burr , Hien Quoc Ngo , Merouane Debbah , Pei Xiao This is my paper

Pith reviewed 2026-05-25 01:35 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords cell-free massive MIMOmax-min rateuniform quantizationfronthaul capacityuplinkBussgang decompositiongeometric programming
0
0 comments X

The pith

An iterative algorithm using uplink-downlink duality optimally maximizes the minimum user rate in cell-free massive MIMO uplink when signals are quantized for limited fronthaul capacity.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that an iterative scheme solves the max-min rate optimization in cell-free massive MIMO where access points quantize weighted signals before forwarding them over capacity-limited fronthaul links to a central processor. It compares three cases: perfect fronthaul, quantized channel estimates plus signals, and quantized signals alone, all modeled via the Bussgang decomposition. The non-convex problem is split into receiver filter design and power allocation subproblems, solved respectively by a generalized eigenvalue problem and geometric programming, with the overall procedure proved optimal by duality. A separate user assignment step further raises the minimum rates. If the approach holds, designers can maintain fairness across users despite coarse quantization and finite fronthaul.

Core claim

The proposed iterative algorithm is optimal for the max-min rate problem with power and fronthaul capacity constraints, as proved through uplink-downlink duality after decomposing the problem into receiver filter design and power allocation subproblems. The Bussgang decomposition models quantization effects, and numerical results show gains from the algorithm and from the user assignment procedure across the three fronthaul scenarios.

What carries the argument

Decomposition of the max-min problem into a generalized-eigenvalue receiver filter design step and a geometric-programming power allocation step, whose optimality is established by uplink-downlink duality.

If this is right

  • The iterative scheme converges to the optimal solution of the max-min rate problem under the stated power and fronthaul constraints.
  • The user assignment algorithm produces a significant increase in the achieved minimum rate.
  • Performance differs measurably among the perfect-fronthaul, quantized-channel-plus-signal, and quantized-signal-only cases.
  • Geometric programming and the generalized eigenvalue problem supply efficient numerical solutions for the two subproblems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the duality argument extends beyond the uplink, the same decomposition could be tested on the downlink with analogous fronthaul limits.
  • The framework could be applied to non-uniform quantizers once a corresponding linear model replaces the Bussgang step.
  • The reported gains suggest that, in large deployments, the algorithm may allow a given fronthaul capacity to support more users at a target minimum rate.

Load-bearing premise

The Bussgang decomposition provides an accurate linear model of the quantization distortion that holds under the uniform quantizer and the specific signal statistics present in the cell-free uplink.

What would settle it

A cell-free network simulation in which the minimum rate obtained by running the iterative algorithm deviates from the value given by the closed-form rate expressions derived under the uniform quantization model.

Figures

Figures reproduced from arXiv: 1907.03262 by Alister G. Burr, Hien Quoc Ngo, Kanapathippillai Cumanan, Manijeh Bashar, Merouane Debbah, Pei Xiao.

Figure 1
Figure 1. Figure 1: The uplink of a cell-free Massive MIMO system with [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Performance of different cases of uplink transmis [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The cumulative distribution of the per-user uplin [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Convergence 0 0.5 1 1.5 2 2.5 3 3.5 4 Per-user uplink rate (bits/s/Hz) 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Cumulatice distribution Problem P1 Problem P6 Problem P7 M=70, N=4, K=40, =30 M=30, N=8, K=50, =50 M=30, N=8, K=50, =30 [PITH_FULL_IMAGE:figures/full_fig_p012_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The cumulative distribution of the per-user uplin [PITH_FULL_IMAGE:figures/full_fig_p012_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Average per-user uplink rate. b= E  h 2 (z) [PITH_FULL_IMAGE:figures/full_fig_p013_6.png] view at source ↗
read the original abstract

Cell-free Massive multiple-input multiple-output (MIMO) is considered, where distributed access points (APs) multiply the received signal by the conjugate of the estimated channel, and send back a quantized version of this weighted signal to a central processing unit (CPU). For the first time, we present a performance comparison between the case of perfect fronthaul links, the case when the quantized version of the estimated channel and the quantized signal are available at the CPU, and the case when only the quantized weighted signal is available at the CPU. The Bussgang decomposition is used to model the effect of quantization. The max-min problem is studied, where the minimum rate is maximized with the power and fronthaul capacity constraints. To deal with the non-convex problem, the original problem is decomposed into two sub-problems (referred to as receiver filter design and power allocation). Geometric programming (GP) is exploited to solve the power allocation problem whereas a generalized eigenvalue problem is solved to design the receiver filter. An iterative scheme is developed and the optimality of the proposed algorithm is proved through uplink-downlink duality. A user assignment algorithm is proposed which significantly improves the performance. Numerical results demonstrate the superiority of the proposed schemes.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper considers cell-free Massive MIMO uplink where APs apply conjugate beamforming and quantize the result before forwarding to the CPU under fronthaul capacity limits. Using the Bussgang decomposition to model uniform quantization, it compares three scenarios (perfect fronthaul, quantized channel+signal, quantized signal only), decomposes the max-min rate problem into a generalized-eigenvalue receiver-filter subproblem and a geometric-programming power-allocation subproblem, develops an iterative algorithm whose optimality is asserted via uplink-downlink duality, and adds a user-assignment heuristic. Numerical results illustrate performance gains.

Significance. If the claimed optimality holds under the quantization model, the work supplies a concrete, duality-based procedure for joint filter and power optimization in a practically relevant quantized cell-free setting, together with the first explicit comparison of the three fronthaul-information scenarios. The user-assignment step and GP-based subproblem solver are reusable building blocks for related constrained MIMO problems.

major comments (2)
  1. [Abstract / optimality proof] Abstract and optimality-proof section: the claim that the iterative algorithm is optimal for the true max-min rate rests on uplink-downlink duality after decomposition. However, the Bussgang gain α is a function of the received-signal variance, which itself depends on the user powers p_k. Treating α as fixed inside each GP solve while iterating therefore solves an approximate problem whose fixed point need not coincide with a stationary point of the original non-linear quantization mapping; the standard duality argument (which assumes linear effective channels and power-independent noise) does not automatically carry over.
  2. [Bussgang decomposition and rate expressions] Bussgang-model section (and rate-expression derivations): the paper invokes the linear Bussgang model to obtain closed-form rate expressions that are then optimized. No analysis or numerical check is supplied showing that the approximation remains accurate when the uplink powers that determine the quantization gain are themselves decision variables; this assumption is load-bearing for both the rate formulas and the subsequent optimality claim.
minor comments (2)
  1. [Introduction] Notation for the three fronthaul scenarios is introduced only in the abstract; a short table or explicit subsection early in the paper would improve readability.
  2. [User assignment algorithm] The user-assignment algorithm is presented without complexity analysis or comparison against exhaustive search; a brief remark on scalability would be helpful.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful and insightful review. The comments raise important points about the treatment of the Bussgang gain and the validity of the optimality claim. We respond to each major comment below and indicate the revisions we will make.

read point-by-point responses

  1. Referee: [Abstract / optimality proof] Abstract and optimality-proof section: the claim that the iterative algorithm is optimal for the true max-min rate rests on uplink-downlink duality after decomposition. However, the Bussgang gain α is a function of the received-signal variance, which itself depends on the user powers p_k. Treating α as fixed inside each GP solve while iterating therefore solves an approximate problem whose fixed point need not coincide with a stationary point of the original non-linear quantization mapping; the standard duality argument (which assumes linear effective channels and power-independent noise) does not automatically carry over.

    Authors: We appreciate the referee pointing out this subtlety in the dependence of α on the powers. In the algorithm, α is recomputed at every iteration from the most recent power vector before solving the GP subproblem; upon convergence the pair (powers, α) is self-consistent. For any fixed α the receiver design via generalized eigenvalues and the power allocation via GP are each optimal, and uplink-downlink duality applies directly to that linear effective model. The overall procedure therefore converges to a stationary point of the problem in which α is treated as a function of the current powers. We acknowledge that this is not necessarily a stationary point of the fully non-linear mapping without the iterative freezing of α. We will revise the optimality section to state this distinction explicitly and to clarify that the claimed optimality holds for the iteratively approximated model. revision: partial

  2. Referee: [Bussgang decomposition and rate expressions] Bussgang-model section (and rate-expression derivations): the paper invokes the linear Bussgang model to obtain closed-form rate expressions that are then optimized. No analysis or numerical check is supplied showing that the approximation remains accurate when the uplink powers that determine the quantization gain are themselves decision variables; this assumption is load-bearing for both the rate formulas and the subsequent optimality claim.

    Authors: The Bussgang decomposition yields an exact linear representation (scaled signal plus uncorrelated distortion) when the input is Gaussian; the rate expression then lower-bounds the mutual information by treating the distortion as additional Gaussian noise. This modeling step is standard in the quantized MIMO literature. To directly address the concern, we will add a new numerical subsection that, for the powers returned by the algorithm, compares the closed-form rates against Monte-Carlo estimates obtained by applying the actual uniform quantizer to the received signals and computing empirical mutual information. The results will be reported for the operating regimes considered in the paper. revision: yes

Circularity Check

0 steps flagged

No circularity; derivation relies on standard external duality and Bussgang model

full rationale

The paper decomposes the max-min problem into receiver-filter (generalized eigenvalue) and power-allocation (GP) subproblems, then invokes uplink-downlink duality to claim optimality of the iterative scheme. Duality is a standard MIMO result independent of this work; Bussgang linearization is likewise a standard quantization model. No equation reduces by construction to a fitted parameter or prior self-citation, and no load-bearing premise is justified solely by overlapping-author citations. The derivation is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The central claim depends on the Bussgang linearization of quantization, the validity of uplink-downlink duality in the quantized setting, and standard MIMO channel and noise models; no new entities are postulated and the free parameters are the explicit constraints rather than fitted constants.

free parameters (1)
  • Fronthaul capacity (bits per sample)
    Treated as a hard constraint in the optimization; values are chosen per scenario rather than fitted to data.
axioms (2)
  • domain assumption Uplink-downlink duality holds for the quantized cell-free system
    Invoked to establish optimality of the iterative algorithm after the problem decomposition.
  • domain assumption Bussgang decomposition accurately represents uniform quantization distortion
    Used to obtain tractable rate expressions that enable the geometric programming formulation.

pith-pipeline@v0.9.0 · 5771 in / 1529 out tokens · 27349 ms · 2026-05-25T01:35:55.149246+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

49 extracted references · 49 canonical work pages · 1 internal anchor

  1. [1]

    On the total energy efficiency of cell-free Massive MIMO,

    H. Q. Ngo, L. Tran, T. Q. Duong, M. Matthaiou, and E. G. Lars son, “On the total energy efficiency of cell-free Massive MIMO,” IEEE Trans. Green Commun. and Netw. , vol. 2, no. 1, pp. 25–39, Mar. 2017

    work page 2017

  2. [2]

    Cell-free Massive MIMO versus small cells,

    H. Q. Ngo, A. Ashikhmin, H. Y ang, E. G. Larsson, and T. L. Ma rzetta, “Cell-free Massive MIMO versus small cells,” IEEE Trans. Wireless Commun., vol. 16, no. 3, pp. 1834–1850, Mar. 2017

    work page 2017

  3. [3]

    Enhanced max-min SINR for uplink cell-free Massive MIMO sy stems,

    M. Bashar, K. Cumanan, A. G. Burr, M. Debbah, and H. Q. Ngo, “Enhanced max-min SINR for uplink cell-free Massive MIMO sy stems,” in Proc. IEEE ICC , May 2018, pp. 1–6

    work page 2018

  4. [4]

    Cell- free Massive MIMO with limited backhaul,

    M. Bashar, K. Cumanan, A. G. Burr, H. Q. Ngo, and M. Debbah, “Cell- free Massive MIMO with limited backhaul,” in Proc. IEEE ICC , May 2018, pp. 1–7

    work page 2018

  5. [5]

    NOMA/OMA mode selection-based cell-free Massive MIMO,

    M. Bashar, K. Cumanan, A. Burr, H. Q. Ngo, L. Hanzo, and P . X iao, “NOMA/OMA mode selection-based cell-free Massive MIMO,” i n Proc. IEEE ICC , May 2019

    work page 2019

  6. [6]

    Cell-free Massive MIMO: User-c entric approach,

    S. Buzzi and C. DAndrea, “Cell-free Massive MIMO: User-c entric approach,” IEEE Wireless Commun. Lett. , vol. 6, no. 6, pp. 1–4, Aug. 2017

    work page 2017

  7. [7]

    Ubiquitous cell-free Massive MIMO communications,

    G. Interdonato, E. Bjornson, H. Q. Ngo, P . Frenger, and E. G. Larsson, “Ubiquitous cell-free Massive MIMO communications,” IEEE Commun. Mag., pp. 1–19, submitted

    work page

  8. [8]

    Downlink spect ral effi- ciency of distributed Massive MIMO systems with linear beam forming under pilot contamination,

    J. Li, D. Wang, P . Zhu, J. Wang, and X. Y ou, “Downlink spect ral effi- ciency of distributed Massive MIMO systems with linear beam forming under pilot contamination,” IEEE Trans. V eh. Technol., vol. 67, no. 2, pp. 1130–1145, Feb. 2018

    work page 2018

  9. [9]

    Ultra-dense radio ac cess networks for smart cities: Cloud-RAN, Fog-RAN and cell-free Massive MIMO,

    A. Burr, M. Bashar, and D. Maryopi, “Ultra-dense radio ac cess networks for smart cities: Cloud-RAN, Fog-RAN and cell-free Massive MIMO,” in Proc. IEEE PIMRC , Sep. 2018

    work page 2018

  10. [10]

    MmWave Massive-MIMO-based wireless backhaul for the 5G ul tra- dense network,

    Z. Gao, L. Dai, D. Mi, Z. Wang, M. A. Imran, and M. Z. Shakir , “MmWave Massive-MIMO-based wireless backhaul for the 5G ul tra- dense network,” IEEE Trans. Wireless Commun. , vol. 22, no. 5, pp. 13–21, Oct. 2015

    work page 2015

  11. [11]

    On the energy efficiency of limited-backhaul cell-free Mas sive MIMO,

    M. Bashar, K. Cumanan, A. Burr, H. Q. Ngo, E. Larsson, and P . Xiao, “On the energy efficiency of limited-backhaul cell-free Mas sive MIMO,” in Proc. IEEE ICC , May 2019

    work page 2019

  12. [12]

    Relationship between two distortion mea sures for memo- ryless nonlinear systems,

    P . Zillmann, “Relationship between two distortion mea sures for memo- ryless nonlinear systems,” IEEE Signal Process. Lett. , vol. 17, no. 11, pp. 917–920, Feb. 2010

    work page 2010

  13. [13]

    Precoding and power optimization in cell-free Massive MIM O sys- tems,

    E. Nayebi, A. Ashikhmin, T. L. Marzetta, H. Y ang, and B. D . Rao, “Precoding and power optimization in cell-free Massive MIM O sys- tems,” IEEE Trans. Wireless Commun. , vol. 16, no. 7, pp. 4445–4459, Jul. 2017

    work page 2017

  14. [14]

    P erformance of cell-free Massive MIMO systems with MMSE and LSFD receive rs,

    E. Nayebi, A. Ashikhmin, T. L. Marzetta, and B. D. Rao, “P erformance of cell-free Massive MIMO systems with MMSE and LSFD receive rs,” in IEEE Asilomar , Nov. 2016

    work page 2016

  15. [15]

    On the performance of backhaul constrained cell- free Massive MIMO with linear receivers,

    M. Bashar, H. Q. Ngo, K. Cumanan, A. G. Burr, D. Maryopi, a nd E. G. Larsson, “On the performance of backhaul constrained cell- free Massive MIMO with linear receivers,” in IEEE Asilomar , 2018, pp. 1–6. 17

    work page 2018

  16. [16]

    Secrecy rate optimizations for a MIMO secrecy channel with a multipl e-antenna eavesdropper,

    K. Cumanan, Z. Ding, B. Sharif, G. Y . Tian, and K. K. Leung , “Secrecy rate optimizations for a MIMO secrecy channel with a multipl e-antenna eavesdropper,” IEEE Trans. V eh. Technol., vol. 63, no. 4, pp. 1678–1690, May 2014

    work page 2014

  17. [17]

    Rate balancin g based linear transceiver design for multiuser MIMO system with multiple linear transmit covariance constraints,

    K. Cumanan, J. Tang, and S. Lambotharan, “Rate balancin g based linear transceiver design for multiuser MIMO system with multiple linear transmit covariance constraints,” in Proc. IEEE ICC, Jun. 2011, pp. 1–5

    work page 2011

  18. [18]

    Secrecy rate o ptimization for secure multicast communications,

    K. Cumanan, Z. Ding, M. Xu, and H. V . Poor, “Secrecy rate o ptimization for secure multicast communications,” IEEE J. Sel. Top. in Signal Proces., vol. 10, no. 8, pp. 1417–1432, Oct. 2016

    work page 2016

  19. [19]

    Joint beamforming and user maximization techniques for techniqu es for cognitive radio networks based on branch and bound method,

    K. Cumanan, R. Krishna, L. Musavian, and S. Lambotharan , “Joint beamforming and user maximization techniques for techniqu es for cognitive radio networks based on branch and bound method,” IEEE Trans. Wireless Commun. , vol. 9, no. 10, pp. 3082–3092, Oct. 2010

    work page 2010

  20. [20]

    SINR balancing technique for downlink beamforming in cogn itive radio networks,

    K. Cumanan, L. Musavian, S. Lambotharan, and A. B. Gersh man, “SINR balancing technique for downlink beamforming in cogn itive radio networks,” IEEE Signal Process. Lett. , vol. 17, no. 2, pp. 133–136, Feb. 2010

    work page 2010

  21. [21]

    A mixed quality of service based linear transceiver design fo r multi-user MIMO network with linear transmit covariance constraints,

    K. Cumanan, Y . Rahulamathavan, S. Lambotharan, and Z. D ing, “A mixed quality of service based linear transceiver design fo r multi-user MIMO network with linear transmit covariance constraints, ” in Proc. IEEE WCNC , Apr. 2013

    work page 2013

  22. [22]

    MMSE based beamforming techniques for relay broad cast chan- nel,

    ——, “MMSE based beamforming techniques for relay broad cast chan- nel,” IEEE Trans. V eh. Technol. , vol. 62, no. 8, pp. 4045–4051, Oct. 2013

    work page 2013

  23. [23]

    A m ixed SINR-balancing and SINR-target-constraints-based beamf ormer design technique for spectrum-sharing networks,

    Y . Rahulamathavan, K. Cumanan, and S. Lambotharan, “A m ixed SINR-balancing and SINR-target-constraints-based beamf ormer design technique for spectrum-sharing networks,” IEEE Trans. V eh. Technol. , vol. 60, no. 9, pp. 4403–4414, Oct. 2011

    work page 2011

  24. [24]

    Linear precoding via conic optimization for fixed MIMO receivers,

    A. Wiesel, Y . C. Eldar, and S. Shamai, “Linear precoding via conic optimization for fixed MIMO receivers,” IEEE Trans. Signal Process. , vol. 54, no. 1, pp. 161 – 176, Jan. 2006

    work page 2006

  25. [25]

    A unified analysi s of max- min weighted SINR for MIMO downlink system,

    D. W. H. Cai, T. Q. S. Quek, and C. W. Tan, “A unified analysi s of max- min weighted SINR for MIMO downlink system,” IEEE Trans. Signal Process., vol. 59, no. 8, pp. 3850–3862, Aug. 2011

    work page 2011

  26. [26]

    Solution of the multiuser dow nlink beam- forming problem with individual SINR constraints,

    M. Schubert and H. Boche, “Solution of the multiuser dow nlink beam- forming problem with individual SINR constraints,” IEEE Trans. V eh. Technol., vol. 53, no. 1, pp. 18 – 28, Jan. 2004

    work page 2004

  27. [27]

    Downlink-uplink duality and effective bandwidths,

    D. N. C. Tse and P . Viswanath, “Downlink-uplink duality and effective bandwidths,” in Proc. IEEE ISlT , Jul. 2002

    work page 2002

  28. [28]

    Golub and C

    G. Golub and C. V . Loan, Matrix Computations , 2nd ed. Baltimore, MD: The Johns Hopkins Univ. Press, 1996

    work page 1996

  29. [29]

    Chiang, C

    M. Chiang, C. W. Tan, D. P . Palomar, D. O’Neill, and D. Jul ian, Power Control by Geometric Programming, in Resource Allocation i n Next Generation Wireless Networks . W. Li, Y . Pan, Editors, Nova Sciences Publishers, 2006

    work page 2006

  30. [30]

    On the uplink max-min SINR of cell-free Massive MIMO systems,

    M. Bashar, K. Cumanan, A. G. Burr, M. Debbah, and H. Q. Ngo , “On the uplink max-min SINR of cell-free Massive MIMO systems,” IEEE Trans. Wireless Commun. , vol. 18, no. 4, pp. 2021–2036, Apr. 2019

    work page 2021

  31. [31]

    T. S. Rappaport, Wireless Communications: Principles and Practice . Englewood Cliffs, NJ, USA: Prentice-Hall, 2002

    work page 2002

  32. [32]

    Interference Reduction in Multi-Cell Massive MIMO Systems I: Large-Scale Fading Precoding and Decoding

    A. Ashikhmin, T. L. Marzetta, and L. Li, “Interference r eduction in multi-cell Massive MIMO systems I: Large-scale fading prec oding and decoding,” Available: http:https://arxiv.org/abs/1411.4182, Submitted

    work page internal anchor Pith review Pith/arXiv arXiv

  33. [33]

    A study of dynamic multipath clusters at 60 GHz in a large indoor environment,

    M. Bashar, K. Haneda, A. Burr, and K. Cumanan, “A study of dynamic multipath clusters at 60 GHz in a large indoor environment,” in Proc. IEEE Globecom W orkshop, Dec. 2018

    work page 2018

  34. [34]

    Evaluation of low complexity massi ve MIMO techniques under realistic channel conditions,

    M. Bashar, A. G. Burr, K. Haneda, K. Cumanan, M. M. Molu, M. Khalily, and P . Xiao, “Evaluation of low complexity massi ve MIMO techniques under realistic channel conditions,” IEEE Trans. V eh. Tech- nol., Accepted

    work page

  35. [35]

    Robust geometry-based user scheduling for large MIMO syst ems under realistic channel conditions,

    M. Bashar, A. G. Burr, D. Maryopi, K. Haneda, and K. Cuman an, “Robust geometry-based user scheduling for large MIMO syst ems under realistic channel conditions,” in Proc. IEEE EW , May 2018, pp. 1–6

    work page 2018

  36. [36]

    Cooperative acce ss networks: Optimum fronthaul quantization in distributed Massive MIM O and cloud RAN,

    A. G. Burr, M. Bashar, and D. Maryopi, “Cooperative acce ss networks: Optimum fronthaul quantization in distributed Massive MIM O and cloud RAN,” in Proc. IEEE VTC , Jun. 2018, pp. 1–7

    work page 2018

  37. [37]

    On the uplink throug hput of zero-forcing in cell-free Massive MIMO with coarse quantiz ation,

    D. Maryopi, M. Bashar, and A. Burr, “On the uplink throug hput of zero-forcing in cell-free Massive MIMO with coarse quantiz ation,” IEEE Trans. V eh. Technol., pp. 1–5, Jun. 2019

    work page 2019

  38. [38]

    L. C. Andrews, Special Functions of Mathematics for Engineers , 2nd ed. Oxford University Press, 1997

    work page 1997

  39. [39]

    Quantizing for minimum distortion,

    J. Max, “Quantizing for minimum distortion,” IEEE Trans. Inf. Theory , vol. 6, no. 1, pp. 7–12, Mar. 1960

    work page 1960

  40. [40]

    A. V . Oppenheim, R. W. Schafer, and J. R. Buck, Discrete-time signal processing. Prentice-hall Englewood Cliffs, 1989

    work page 1989

  41. [41]

    Bashar, Cell-free Massive MIMO and Millimeter W ave Channel Modelling for 5G and Beyond

    M. Bashar, Cell-free Massive MIMO and Millimeter W ave Channel Modelling for 5G and Beyond . Ph.D. dissertation, University of Y ork, United Kingdom, 2019

    work page 2019

  42. [42]

    T. L. Marzetta, E. G. Larsson, H. Y ang, and H. Q. Ngo, Fundamentals of Massive MIMO . Cambridge University Press, 2016

    work page 2016

  43. [43]

    Network deployment for maximal energy efficiency in uplink with mult islope path loss,

    A. Pizzo, D. V erenzuela, L. Sanguinetti, and E. Björnso n, “Network deployment for maximal energy efficiency in uplink with mult islope path loss,” IEEE Trans. Green Commun. and Net. , pp. 1–30, submitted

    work page

  44. [44]

    Mixed quality of service in cell-free Massive MIMO,

    M. Bashar, K. Cumanan, A. G. Burr, H. Q. Ngo, and H. V . Poor , “Mixed quality of service in cell-free Massive MIMO,” IEEE Commun. Lett. , vol. 22, no. 7, pp. 706–709, Jul. 2018

    work page 2018

  45. [45]

    Boyd and L

    S. Boyd and L. V andenberghe, Convex Optimization. Cambridge, UK: Cambridge University Press, 2004

    work page 2004

  46. [46]

    Iterative multiuser uplink a nd downlink beamforming under SINR constraints,

    M. Schubert and H. Boche, “Iterative multiuser uplink a nd downlink beamforming under SINR constraints,” IEEE Trans. Signal Process. , vol. 53, no. 7, pp. 2324–2334, Jul. 2005

    work page 2005

  47. [47]

    Bit per joul e efficiency of cooperating base stations in cellular networks,

    A. J. Fehske, P . Marsch, and G. P . Fettweis, “Bit per joul e efficiency of cooperating base stations in cellular networks,” in Proc. IEEE Globecom W orkshops, Dec. 2010, pp. 1406–1411

    work page 2010

  48. [48]

    Weighted sum rate maximization for multiuser MISO systems with low resolution digital to analog converters,

    A. Kakkavas, J. Munir, A. Mezghani, H. Brunner, and J. A. Nossek, “Weighted sum rate maximization for multiuser MISO systems with low resolution digital to analog converters,” in Proc. IEEE WSA , Mar. 2016

    work page 2016

  49. [49]

    Energy efficiency of the cell-free Massive MIMO upl ink with optimal uniform quantization,

    M. Bashar, K. Cumanan, A. G. Burr, H. Q. Ngo, E. G. Larsson , and P . Xiao, “Energy efficiency of the cell-free Massive MIMO upl ink with optimal uniform quantization,” IEEE Trans. Green Commun. and Net. , Accepted

    work page