Results 271 to 280 of about 60,244 (309)
Some of the next articles are maybe not open access.
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
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 ...
Ajit Nimbalker +4 more
openaire +1 more source
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 ...
Ajit Nimbalker +4 more
openaire +1 more source
Network Coding With Interleaving
2007 International Conference on Parallel Processing Workshops (ICPPW 2007), 2007Interleaving is a scheme of adapting random error-correcting codes to bursty channels in the classical coding theory Network coding has been first introduced as a new paradigm of improving network throughput by allowing coding of incoming messages at the intermediate nodes.
Zheng Huang +3 more
openaire +1 more source
2014
AbstractThis chapter discusses the phonological properties of morphologically complex words, i.e. those formed by more than one word-formation process. This chapter discusses both “cyclicity”, in the strict sense of the same phonological alternation or constraint applying at each step of word formation, and “layering”, in which phonology is imposed at ...
openaire +1 more source
AbstractThis chapter discusses the phonological properties of morphologically complex words, i.e. those formed by more than one word-formation process. This chapter discusses both “cyclicity”, in the strict sense of the same phonological alternation or constraint applying at each step of word formation, and “layering”, in which phonology is imposed at ...
openaire +1 more source
IEEE Transactions on Communications, 2013
\boldmath In this paper, computationally efficient schemes for enumerating the so-called inliers of a wide range of permutations employed in pruned variable-size (turbo) interleavers are proposed. The objective is to accelerate pruned interleaving time in turbo codes by computing a statistic known as the pruning gap that enables determining a permuted ...
openaire +1 more source
\boldmath In this paper, computationally efficient schemes for enumerating the so-called inliers of a wide range of permutations employed in pruned variable-size (turbo) interleavers are proposed. The objective is to accelerate pruned interleaving time in turbo codes by computing a statistic known as the pruning gap that enables determining a permuted ...
openaire +1 more source
Proceedings of International Conference on Software Maintenance, 2002
Spencer Rugaber +2 more
openaire +1 more source
Spencer Rugaber +2 more
openaire +1 more source
Synchronized Disk Interleaving
IEEE Transactions on Computers, 1986A group of disks may be interleaved to speed up data transfers in a manner analogous to the speedup achieved by main memory interleaving. Conventional disks may be used for interleaving by spreading data across disks and by treating multiple disks as if they were a single one.
openaire +1 more source
Interleaving sessions with predicates
Proceedings of the Symposium on Applied Computing, 2017We propose an extension of binary session types with interleaved sessions that work similar to interrupts. The participants in a session register a set of trigger predicates that are associated with local protocols. When a trigger fires, all participants switch simultaneously to the interleaved protocol and return to the original protocol afterwards ...
openaire +2 more sources
Flexibly Interleaving Processes
1999We discuss several problems of analogy-driven proof plan construction which prevent a solution for more difficult target problems or make a solution very expensive. Some of these problems are due to the previously assumed fixed order of matching, reformulation, and replay in case-based reasoning and from a too restricted combination of planning from ...
Erica Melis, Carsten Ullrich
openaire +1 more source