Results 11 to 20 of about 25,641 (336)

Permutation Polynomial Interleaved DFT-s-OFDM

open access: yesIEEE Open Journal of the Communications Society, 2023
We propose frequency-domain interleaver for discrete Fourier transform spread orthogonal division multiplexing (DFT-s-OFDM) based on a linear- or quadratic permutation polynomial (LPP/QPP).
Fredrik Berggren, Branislav M. Popovic
doaj   +1 more source

Design Optimization of Flattop Interleaver and Its Dispersion Compensation [PDF]

open access: yes, 2007
The objective of this paper is to present a general strategy for design optimization of flattop interleavers, and dispersion compensation for the interleavers, in order to achieve superior optical performance.
Lit, John W.Y., Wei, Li
core   +2 more sources

Interleaver Optimal Turbo Code pada Kanal Flat Fading

open access: yesRekayasa, 2009
Turbo Code is one of the channel encoding technique used in wireless cellular networks are approaching  the limit of Shannon's  theory. Interleaver  is used  to determine  the rules of the randomization technique of bits of information in relation to the
Dwi Kuswanto
doaj   +1 more source

INTERLEAVING LOGIC AND COUNTING

open access: yesThe Bulletin of Symbolic Logic, 2023
AbstractReasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common linguistic usage and its extension into the broader practice of natural language plus ‘grassroots mathematics’.We ...
van Benthem, J., Icard, T.
openaire   +4 more sources

Design of a Modified Interleaving Algorithm Based on Golden Section Theory Enhancing the Performance of Turbo Codes

open access: yesJournal of Telecommunications and Information Technology, 2022
This paper investigates the design of a modified matrix interleaving algorithm as a way to improve the performance of turbo codes. This proposed solution, known as the matrix-dithered golden (MDG) interleaver, utilizes the characteristics of a matrix ...
Essedik Iftene   +2 more
doaj   +1 more source

Understanding interleaved code [PDF]

open access: yesAutomated Software Engineering, 1996
Complex programs often contain multiple, interwoven strands of computation, each responsible for accomplishing a distinct goal. The individual strands responsible for each goal are typically delocalized and overlap rather than being composed in a simple linear sequence. We refer to these code fragments as being interleaved.
Spencer Rugaber   +2 more
openaire   +1 more source

Fixed‐latency architecture for multi‐stage algebraic interleavers in interleave division multiple access systems

open access: yesElectronics Letters, 2022
In this letter, a fixed‐latency interleaver architecture is proposed for interleave division multiple access (IDMA) systems. The existing multi‐stage algebraic interleaver suffers from the high latency originated from a series of multipliers and adders ...
Byeong Yong Kong
doaj   +1 more source

Turbo Code with Hybrid Interleaver in the Presence of Impulsive Noise

open access: yesInternational Journal of Emerging Research in Engineering, Science, and Management, 2022
In this paper, a numerical density function of Impulsive symmetric α-stable (ISAS) noise was presented and simulated in the turbo coding environment. The ISAS noise has no closed-form expression, making it difficult to realize. The ISAS noise can be used
Y Ravisankaraiah, S Varadarajan
doaj   +1 more source

The Interleaved Genome

open access: yesTrends in Genetics, 2016
Eukaryotic genomes are pervasively transcribed but until recently this noncoding transcription was considered to be simply noise. Noncoding transcription units overlap with genes and genes overlap other genes, meaning genomes are extensively interleaved. Experimental interventions reveal high degrees of interdependency between these transcription units,
Mellor, J, Woloszczuk, R, Howe, F
openaire   +3 more sources

Interleaved Group Products [PDF]

open access: yesSIAM Journal on Computing, 2019
Let $G$ be the special linear group ${SL}(2,q)$. We show that if $(a_1,\ldots,a_t)$ and $(b_1,\ldots,b_t)$ are sampled uniformly from large subsets $A$ and $B$ of $G^t$, then their interleaved product $a_1 b_1 a_2 b_2 \cdots a_t b_t$ is nearly uniform over $G$. This extends a result of the first author [W. T. Gowers, Combin. Probab. Comput., 17 (2008),
Gowers, WT, Viola, Emanuele
openaire   +4 more sources

Home - About - Disclaimer - Privacy