Results 231 to 240 of about 1,253 (283)
Some of the next articles are maybe not open access.
Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing, 2002
We investigate the costs and benefits of implementing memory interleaving in software. As our main contribution, we compare software memory interleaving to row-major allocation and logarithmic broadcasting. Our analysis demonstrates the clear superiority of software interleaving over row-major allocation in the presence of memory contention.
Ricardo Bianchini +3 more
openaire +1 more source
We investigate the costs and benefits of implementing memory interleaving in software. As our main contribution, we compare software memory interleaving to row-major allocation and logarithmic broadcasting. Our analysis demonstrates the clear superiority of software interleaving over row-major allocation in the presence of memory contention.
Ricardo Bianchini +3 more
openaire +1 more source
annals of telecommunications - annales des télécommunications, 2008
This paper is a proposal for a new form of random interleaver for a turbo code based on the probability distribution of channel statistic model of transmission, instead of a uniform probability distribution. In our work, we use the normal (Gaussian) and Rayleigh probability distribution in accordance with the channel type and compare them with classic ...
Lahcène Hadj Abderrahmane +1 more
openaire +2 more sources
This paper is a proposal for a new form of random interleaver for a turbo code based on the probability distribution of channel statistic model of transmission, instead of a uniform probability distribution. In our work, we use the normal (Gaussian) and Rayleigh probability distribution in accordance with the channel type and compare them with classic ...
Lahcène Hadj Abderrahmane +1 more
openaire +2 more sources
Optimized prunable single-cycle interleavers for turbo codes
This paper is aimed at the problem of designing optimized interleavers for parallel concatenated convolutional codes (PCCC) that satisfy several requirements simultaneously: 1) designing interleavers tailored to the constituent codes of the PCCC; 2 ...
M Laddomada, F Daneshgaran
exaly +2 more sources
Practical Interleavers for Systematic Repeat-Accumulate Codes
In this paper we design deterministic interleavers for systematic repeat-accumulate (RA) codes. Despite their simple description the new interleavers are shown to outperform traditional interleavers over a wide range of code lengths and ...
S J Johnson, S R Weller
exaly +1 more source
Proceedings of International Conference on Software Maintenance, 2002
Spencer Rugaber +2 more
openaire +2 more sources
Spencer Rugaber +2 more
openaire +2 more sources
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, 2009Steven R Weller +2 more
exaly
Annales Des Telecommunications/Annals of Telecommunications, 2013
Lucian Trifina, Daniela Tarniceriu
exaly
Lucian Trifina, Daniela Tarniceriu
exaly

