Results 271 to 280 of about 2,041,584 (301)
Some of the next articles are maybe not open access.

Zero-Correlation Zone Sequence Set Construction Using an Even-Perfect Sequence and an Odd-Perfect Sequence

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
The present paper introduces a new construction of a class of binary periodic sequence set having a zero-correlation zone sequence set. The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone.
openaire   +1 more source

Perfect Sequences of Odd Prime Length

IEEE Signal Processing Letters, 2018
A sequence is said to be perfect if it has an ideal periodic autocorrelation function. In addition, the degree of a sequence is defined as the number of distinct nonzero elements within each period of the sequence. This study presents a systematic method for constructing perfect sequences (PSs) of odd prime periods, where the general constraint ...
Chih-Peng Li   +3 more
openaire   +1 more source

Perfect sequences for belief networks representation

Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001, 2002
In contrast to most other approaches used to represent multidimensional probability distributions, which are based on graphical Markov modelling (i.e. dependence structure of distributions is represented by graphs), the described method is rather procedural.
Radim Jirousek, Jirina Vejnarová
openaire   +2 more sources

On Integer-Valued Almost-Perfect Sequences

IEEE Communications Letters, 2015
In this letter, a new class of integer-valued sequences with almost-perfect periodic autocorrelation function is proposed. To construct these sequences, two groups of base sequences with two and four base sequences in each group are developed, and each base sequence is generated from a generalized Hadamard matrix.
openaire   +1 more source

Almost p-Ary Perfect Sequences

2010
A sequence a = (a0, a1, a2, ..., an) is said to be an almost p-ary sequence of period n + 1 if a0 = 0 and ai = ξpbi for 1 ≤ i ≤ n, where ξp is a primitive p-th root of unity and bi ∈ {0, 1, ..., p - 1}. Such a sequence a is called perfect if all its out-of-phase autocorrelation coefficients are zero; and is called nearly perfect if its out-of-phase ...
Yeow Meng Chee, Yin Tan, Yue Zhou 0001
openaire   +1 more source

Binary Alexis sequences with perfect correlation

IEEE Transactions on Communications, 2001
Summary: Binary Alexis sequences are useful signals for fast startup equalization, channel estimation, synchronization, or ranging. The aperiodic autocorrelation functions of Alexis sequences vanish in a broad window region when correlated using additional binary preamble and postamble sequences.
openaire   +3 more sources

Almost perfect sequence family with perfect crosscorrelation.

IEICE Proceeding Series, 2020
Gangsan, Kim, Hong-Yeop, Song
openaire   +2 more sources

One construction of perfect ternary sequences

Cryptography and Communications, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Some Constructions of Almost-Perfect, Odd-Perfect and Perfect Polyphase and Almost-Polyphase Sequences

2010
In the paper, some new almost-perfect (AP), odd-perfect (OP) and perfect polyphase and almost-polyphase sequences derived from the Frank and Milewski sequences are presented. The considered almost-polyphase sequences are polyphase sequences with some zero elements.
openaire   +1 more source

The Existence of Perfect 3-Sequences

The Fibonacci Quarterly, 1968
openaire   +2 more sources

Home - About - Disclaimer - Privacy