skip to main content
10.1145/2070562.2070568acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article

Rateless spinal codes

Published:14 November 2011Publication History

ABSTRACT

A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary with time. An ideal solution is a rateless wireless system, in which the sender encodes data without any explicit estimation or adaptation, implicitly adapting to the level of noise or interference. In this paper, we present a novel rateless code, the spinal code, which uses a hash function over the message bits to produce pseudo-random bits that in turn can be mapped directly to a dense constellation for transmission. Results from theoretical analysis and simulations show that spinal codes essentially achieve Shannon capacity, and out-perform best-known fixed rate block codes.

References

  1. R. Barron, C. Lo, and J. Shapiro. Global design methods for raptor codes using binary and higher-order modulations. In IEEE MILCOM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Bicket. Bit-Rate Selection in Wireless Networks. Master's thesis, Massachusetts Institute of Technology, Feb. 2005.Google ScholarGoogle Scholar
  3. U. Erez, M. Trott, and G. Wornell. Coding for Gaussian Channels. In ISIT 05-06, journal version on Arxiv, 2007.Google ScholarGoogle Scholar
  4. A. Gudipati and S. Katti. Automatic rate adaptation. In Hotnets, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Gudipati and S. Katti. Strider: Automatic rate adaptation and collision handling. In SIGCOMM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Ha, J. Kim, and S. McLaughlin. Rate-compatible puncturing of low-density parity-check codes. IEEE Trans. on Info. Theory, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Holland, N. Vaidya, and P. Bahl. A Rate-Adaptive MAC Protocol for Multihop Wireless Networks. In MobiCom, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. G. Judd, X. Wang, and P. Steenkiste. Efficient Channel-aware Rate Adaptation in Dynamic Environments. In MobiSys, June 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Li and K. Narayanan. Rate-compatible low density parity check codes for capacity-approaching ARQ scheme in packet data communications. In Int. Conf. on Comm., Internet, and Info. Tech., 2002.Google ScholarGoogle Scholar
  10. M. Luby. LT codes. In FOCS, 2003.Google ScholarGoogle Scholar
  11. R. Mantha and F. Kschischang. A capacity-approaching hybrid ARQ scheme using turbo codes. In GLOBECOM, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  12. Y. Polyanskiy, H. Poor, and S. Verdú. Channel coding rate in the finite blocklength regime. IEEE Trans. on Info. Theory, 56(5), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. S. Sen, N. Santhapuri, R. Choudhury, and S. Nelakuditi. AccuRate: Constellation-based rate estimation in wireless networks. NSDI, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Sesia, G. Caire, and G. Vivier. Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes. IEEE Trans. on Comm., 52(8): 1311--1321, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  15. A. Shokrollahi. Raptor codes. IEEE Trans. Info. Theory, 52(6), 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. E. Soljanin, N. Varnica, and P. Whiting. Incremental redundancy hybrid ARQ with LDPC and Raptor codes. IEEE Trans. on Info. Theory, 2005.Google ScholarGoogle Scholar
  17. G. Ungerboeck. Channel coding with multilevel/phase signals. IEEE Trans. on Info. Theory, IT-28(1):55--67. Jan. 1982.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. G. Ungerboeck and I. Csajka. On improving data-link performance by increasing the channel alphabet and introducing sequence coding. In ISIT, 1976.Google ScholarGoogle Scholar
  19. M. Vutukuru, H. Balakrishnan, and K. Jamieson. Cross-Layer Wireless Bit Rate Adaptation. In SIGCOMM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Wong, H. Yang, S. Lu, and V. Bharghavan. Robust Rate Adaptation for 802.11 Wireless Networks. In MobiCom, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Rateless spinal codes

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        HotNets-X: Proceedings of the 10th ACM Workshop on Hot Topics in Networks
        November 2011
        148 pages
        ISBN:9781450310598
        DOI:10.1145/2070562

        Copyright © 2011 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 14 November 2011

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate110of460submissions,24%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader