Results 221 to 230 of about 275 (256)
Some of the next articles are maybe not open access.
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
2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), 2022
Sana Damani +5 more
openaire +1 more source
Sana Damani +5 more
openaire +1 more source
On the Equivalence of Interleavers for Turbo Codes
IEEE Wireless Communications Letters, 2015Charbel Abdel Nour, Catherine Douillard
exaly
Design of fast-prunable S-random interleavers
IEEE Transactions on Wireless Communications, 2005S Benedetto
exaly
Practical Interleavers for Repeat--Accumulate Codes
IEEE Transactions on Communications, 2009Sarah J Johnson, Steven R Weller
exaly