2000 character limit reached
Compute-and-Forward over Block-Fading Channels Using Algebraic Lattices
Published 5 Feb 2017 in cs.IT and math.IT | (1702.01422v2)
Abstract: Previous approaches to compute-and-forward (C&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C&F strategy over block fading channels using Construction A over rings, so as to allow better quantization for the channels. Advantages in decoding error probabilities and computation rates are demonstrated, and the construction is shown to outperform the C&F strategy over the integers $\mathbb{Z}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.