Contention-free interleavers

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 imple...

Full description

Saved in:
Bibliographic Details
Main Authors: Nimbalker, A., Fuja, T.E., Costello, D.J., Blankenship, T.K., Classon, B.
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
AWGN channels
Clocks
Computer science
control theory
systems
Decoding
Delay
Exact sciences and technology
Information theory
Information, signal and communications theory
Interleaved codes
NASA
Table lookup
Telecommunications and information theory
Throughput
Upper bound
Writing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/ISIT.2004.1365089