• DocumentCode
    104565
  • Title

    Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes

  • Author

    Ozgur, Ayfer ; Diggavi, Suhas N.

  • Author_Institution
    Stanford Univ., Stanford, CA, USA
  • Volume
    59
  • Issue
    12
  • fYear
    2013
  • fDate
    Dec. 2013
  • Firstpage
    8275
  • Lastpage
    8294
  • Abstract
    Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been demonstrated to approximately achieve (within an additive constant number of bits) the Gaussian relay network capacity, universally, i.e., for arbitrary topologies, channel gains, and SNRs. This was established using Gaussian codebooks for transmission and random mappings at the relays. In this paper, we develop structured lattice codes that implement the QMF strategy. The main result of this paper is that such structured lattice codes can approximately achieve the Gaussian relay network capacity universally, again within an additive constant. In addition, we establish a similar result for half-duplex networks, where we demonstrate that one can approximately achieve the capacity using fixed transmit-receive (TX-RX) schedules for the relays with no transmit power optimization across the different TX-RX states of the network.
  • Keywords
    codes; radio networks; scheduling; Gaussian codebooks; Gaussian relay network capacity; QMF strategy; SNR; TX-RX states; arbitrary topologies; channel gains; fixed transmit-receive schedules; gaussian relay network capacity; half-duplex networks; lattice-based QMF codes; quantize-map-and-forward scheme; random mappings; relaying strategy; relays; structured lattice codes; transmission mappings; Approximation methods; Decoding; Lattices; Quantization (signal); Relays; Vectors; Zinc; Capacity approximation; Gaussian relay networks; compress-and-forward; half-duplex relays; lattice-codes; quantize-map-and-forward;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2013.2280167
  • Filename
    6587830