The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a novel scheme for the slow block fading Gaussian multiple access relay channel inspired by the compute-and-forward (CoF) relaying strategy. The CoF relaying strategy exploits interference to obtain significantly higher rates between users in a network by decoding linear functions of the transmitted messages. Unlike other approaches in the literature, our approach is valid for...
We consider analog multiple description joint source-channel schemes for the transmission of a Gaussian source over two independent AWGN parallel channels under a quadratic error distortion criteria. For such systems, Lines mapping was proved to be a simple and efficient mapping when MMSE decoding is used. However, MMSE decoding presents a high computational load. In order to reduce complexity of...
This paper proposes a low-complexity coding strategy for the flat fading Gaussian Multiple Access Channel (MAC) based on the concept of Compute-and-Forward. To assess the performance of the proposed coding scheme, we compare the block error probability of a particular code implementation with that of an optimal Gaussian MAC code with the same rates, when applied to our slow fading Gaussian MAC. We...
In this paper we propose a coding and decoding strategy for computing modulo M sums in a Multiple Access Channel over Additive White Gaussian Noise based on linear codes in FM. The complexity of our strategy is the same as the complexity of the linear code and we show that when there are 2 users in the network and M = 2, our strategy is close to the theoretical limit. We also provide some figures...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.