核心概念
The compute-forward multiple access (CFMA) scheme can achieve the ergodic sum capacity of a two-user Gaussian fast fading multiple access channel (MAC) under appropriate channel conditions.
要約
This paper investigates the CFMA scheme for a two-user Gaussian fast fading MAC with channel state information only available at the receiver (CSIR). The key contributions are:
-
CFMA is extended to fading channels with new technical contributions, including the analysis of ambiguity decoding of lattice codes in the CFMA scheme. This subsumes known results for CFMA in fixed channels and successive interference cancellation (SIC) decoding with lattice codes for the Gaussian MAC.
-
Sufficient and necessary conditions are identified under which the entire ergodic capacity is achievable using CFMA. A key is that the scaling parameter in the code construction should be chosen judiciously based on the channel statistics.
-
The impact of channel statistics is investigated. It is found that in general, large mean and small variance of the channel gains benefit the capacity achievability. Numerical examples illustrate the theoretical findings.
統計
The ergodic sum capacity of the two-user Gaussian fast fading MAC is given by:
C(P, h) = 1/2 E_h [log (1 + Ph^2_1 + Ph^2_2)]
引用
"Compute-forward multiple access (CFMA) is a generalized CF scheme proposed in [3], which allows the users to have different rates whereas each user shares the same rate in the original CF."
"It is not a straightforward task to extend the CFMA scheme to the fading case. CFMA and the original compute-and-forward scheme use lattice decoding (quantization with respect to lattice) which relies on the algebraic structure of lattice codes. The first observation in the fading case is that since each symbol in a codeword experiences a possibly different channel gain, the algebraic structure of lattice codes will be corrupted from the decoder's perspective, so it is not immediately clear how to extend the lattice decoder to the fading case."