Compute-Forward Multiple Access for Gaussian Fast Fading Channels (2404.19468v2)
Abstract: Compute-forward multiple access (CFMA) is a transmission strategy which allows the receiver in a multiple access channel (MAC) to first decode linear combinations of the transmitted signals and then solve for individual messages. Compared to existing MAC strategies such as joint decoding or successive interference cancellation (SIC), CFMA was shown to achieve the MAC capacity region for fixed channels under certain signal-to-noise (SNR) conditions without time-sharing using only single-user decoders. This paper studies the CFMA scheme for a two-user Gaussian fast fading MAC with channel state information only available at the receiver (CSIR). We develop appropriate lattice decoding schemes for the fading MAC and derive the achievable rate pairs for decoding linear combinations of codewords with any integer coefficients. We give a sufficient and necessary condition under which the proposed scheme can achieve the ergodic sum capacity. Furthermore, we investigate the impact of channel statistics on the capacity achievability of the CFMA scheme. In general, the sum capacity is achievable if the channel variance is small compared to the mean value of the channel strengths. Various numerical results are presented to illustrate the theoretical findings.
- B. Nazer and M. Gastpar, “Compute-and-Forward: Harnessing Interference Through Structured Codes,” IEEE Transactions on Information Theory, vol. 57, no. 10, pp. 6463–6486, 2011.
- J. Zhu and M. Gastpar, “Gaussian Multiple Access via Compute-and-Forward,” IEEE Transactions on Information Theory, vol. 63, no. 5, pp. 2678–2695, 2017.
- B. Nazer, V. R. Cadambe, V. Ntranos, and G. Caire, “Expanding the Compute-and-Forward Framework: Unequal Powers, Signal Levels, and Multiple Linear Combinations,” IEEE Transactions on Information Theory, vol. 62, no. 9, pp. 4879–4909, 2016.
- S.-N. Hong and G. Caire, “Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems,” IEEE Transactions on Information Theory, vol. 59, no. 9, pp. 5227–5243, 2013.
- O. Ordentlich and Y. Polyanskiy, “Low Complexity Schemes for the Random Access Gaussian Channel,” in 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 2528–2532.
- J. Zhan, B. Nazer, U. Erez, and M. Gastpar, “Integer-Forcing Linear Receivers,” IEEE Transactions on Information Theory, vol. 60, no. 12, pp. 7661–7685, 2014.
- W. He, B. Nazer, and S. Shamai Shitz, “Uplink-Downlink Duality for Integer-Forcing,” IEEE Transactions on Information Theory, vol. 64, no. 3, pp. 1992–2011, 2018.
- S. Lyu, A. Campello, and C. Ling, “Ring Compute-and-Forward Over Block-Fading Channels,” IEEE Transactions on Information Theory, vol. 65, no. 11, pp. 6931–6949, 2019.
- U. Erez and R. Zamir, “Achieving 1/2 log (1+SNR) on the AWGN Channel with Lattice Encoding and Decoding,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2293–2314, 2004.
- O. Ordentlich and U. Erez, “Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap,” IEEE Transactions on Information Theory, vol. 61, no. 1, pp. 323–340, 2015.
- A. Hindy and A. Nosratinia, “Achieving the Ergodic Capacity with Lattice Codes,” in 2015 IEEE International Symposium on Information Theory (ISIT), 2015, pp. 441–445.
- A. Campello, C. Ling, and J.-C. Belfiore, “Algebraic Lattices Achieving the Capacity of the Ergodic Fading Channel,” in 2016 IEEE Information Theory Workshop (ITW), 2016, pp. 459–463.
- H. El Gamal, G. Caire, and M. Damen, “Lattice Coding and Decoding Achieve the Optimal Diversity-Multiplexing Tradeoff of MIMO Channels,” IEEE Transactions on Information Theory, vol. 50, no. 6, pp. 968–985, 2004.
- C. A. Bechlawi, J.-C. Belfiore, and F. Guilloud, “Reed-Muller Lattice Coding for the Rayleigh Block Fading Channel,” in 2016 IEEE Wireless Communications and Networking Conference, 2016, pp. 1–6.
- A. Karrila, N. R. Väisänen, D. Karpuk, and C. Hollanti, “Lattice Coding for Rician Fading Channels from Hadamard Rotations,” in 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 3110–3114.
- A. Hindy and A. Nosratinia, “Lattice Strategies for the Ergodic Fading Dirty Paper Channel,” in 2016 IEEE International Symposium on Information Theory (ISIT), 2016, pp. 2774–2778.
- U. Erez, S. Litsyn, and R. Zamir, “Lattices Which Are Good for (Almost) Everything,” IEEE Transactions on Information Theory, vol. 51, no. 10, pp. 3401–3416, 2005.
- H.-A. Loeliger, “Averaging Bounds for Lattices and Linear Codes,” IEEE Transactions on Information Theory, vol. 43, no. 6, pp. 1767–1773, 1997.