A Lattice Compress-and-Forward Scheme

Lattice codes have been shown to perform as well as random codes for certain Gaussian channels, and to outperform random codes for specific Gaussian channels. As much is known about lattice codes and their performance in single path (point-to-point, multiple access and broadcast where information flows along one path) source and channel coding scenarios, in this paper the authors take the next step towards the goal of demonstrating that lattices may mimic random codes by considering a simple multiple path Gaussian network - the simple three user Gaussian relay channel in which information may flow from the source to the destination along two paths.

Provided by: University of Illinois Topic: Mobility Date Added: Aug 2011 Format: PDF

Find By Topic