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 addresses the problem of single-cell point-to-multipoint communications. We consider a base station that needs to transmit a common information to a group of users. We propose a layered Wyner-Ziv coding (WZC) scheme based on nested lattice quantization. In our scheme, we use the base layer generated by a standard coder as the decoders side information. Then, WZC is performed for quality...
In this paper, we investigate the problem of energy-efficiency for physical layer multicasting in multi-cell network under the assumption that only downlink channel distribution information (CDI) is available at the base station. Each BS, equipped with multiple antennas, uses a single beamformer to convey a common information to a group of single antenna users. The problem is formulated as the global...
This paper considers distributed approaches for the downlink of multi-user MIMO interference network where all nodes iteratively and distributedly update their precoders or receive filters. Those include the distributed interference alignment and minimum sum mean-squared error schemes. We analyse these algorithms in presence of effective imperfect channel estimation at each iteration and we present...
This paper studies a Gaussian two-way relay channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half-duplex mode without any direct link between the communication nodes. A compress-and-forward relaying strategy using nested lattice codes is first proposed. Then, the proposed scheme is improved by performing layered coding: A...
Two-way relay channel (TWRC) models a cooperative communication situation performing duplex transmission via a relay station. For this channel, we have shown previously that a lattice-based physical layer network coding strategy achieves, at the limit of arbitrarily large dimension, the same rate as that offered by the random coding-based regular compress-and-forward. In this paper, we investigate...
Parallel two-way relay channel models a cooperative communication scenario where a relay helps two terminals to exchange their messages over independent Gaussian channels. For the single channel case, we have shown previously that lattice-based physical layer network coding achieves the same rate as compress-and-forward scheme with a random coding strategy. A direct extension of this lattice-based...
A Two-Way Relay Channel (TWRC) in which duplex transmission between two users via a relay station is considered. A physical layer network coding strategy based on compress-and-forward relaying scheme for the TWRC is proposed. In the underlying coding strategy, we use nested lattices for Wyner-Ziv coding and decoding. The relay uses the weaker side information available at the receivers from the first...
Two way relay channel (TWRC) is being proposed as a competitive strategy for data transmission in cooperative networks. The capacity region of this model has been recently extensively investigated and achievable bounds are derived based on the cut-set theorem and decode and forward relaying strategy. However, capacity limits that have been derived assume infinite block length which is impractical...
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.