• DocumentCode
    2051228
  • Title

    Contention-free interleavers

  • Author

    Nimbalker, A. ; Fuja, T.E. ; Costello, D.J., Jr. ; Blankenship, T.K. ; Classon, B.

  • Author_Institution
    Dept. of Electr. Eng., Notre Dame Univ., IN, USA
  • fYear
    2004
  • fDate
    27 June-2 July 2004
  • Firstpage
    54
  • Abstract
    Interleavers that avoid memory contentions in parallelized log-MAP decoding are analyzed and designed. Bounds are derived demonstrating that the fraction of interleavers that are contention-free is small. Nevertheless, contention-free "inter-window shuffle" interleavers with a simple implementation and reasonable memory requirements are shown to surpass 3GPP performance.
  • Keywords
    AWGN channels; error statistics; interleaved codes; maximum likelihood decoding; turbo codes; contention-free interleavers; inter-window shuffle; parallelized log-MAP decoding; turbo codes; AWGN channels; Clocks; Decoding; Delay; Interleaved codes; NASA; Table lookup; Throughput; Upper bound; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
  • Print_ISBN
    0-7803-8280-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2004.1365089
  • Filename
    1365089
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2051228