Pastore, AdrianoLim, Sung HoonFeng, ChenNazer, BobakGastpar, Michael2021-11-062021-11-062021-11-062021-01-0110.1109/ISIT45174.2021.9518259https://infoscience.epfl.ch/handle/20.500.14299/182862WOS:000701502202051We present a novel unified framework of compute- forward achievable rate regions for simultaneous decoding of multiple linear codeword combinations. This framework covers a wide class of discrete and continuous-input channels, and computation over finite fields, integers, and reals. The resulting rate regions recover several well-known achievability results, and in some cases extend them. The framework is built upon a recently established achievable rate region based on linear codes and joint typicality decoding. The latter is extended from finite fields to computation over the integers and, via a discretization approach, to computation over the reals with integer coefficients and continuous inputs. Evaluating the latter with Gaussian distributions, we obtain a closed-form rate region which generalizes the classic compute-forward rates originally derived by means of lattice codes by Nazer and Gastpar.Computer Science, Theory & MethodsEngineering, Electrical & ElectronicComputer ScienceEngineeringachievable rate regionchannelinterferencetext::conference output::conference proceedings::conference paper