Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

A. A. Shaar

dblp:165/3787 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1987
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › sequences › pseudorandom sequences
m-sequences
0.011987
Bounds on the Cross-Correlation Functions of State m-Sequences · IEEE Trans. Commun. 1987
Coding theory › sequences
sequence design
0.011987
Bounds on the Cross-Correlation Functions of State m-Sequences · IEEE Trans. Commun. 1987
Coding theory › sequences › sequence design
spread-spectrum sequences
0.011987
Bounds on the Cross-Correlation Functions of State m-Sequences · IEEE Trans. Commun. 1987
Physical-layer communications › spread spectrum
frequency hopping
0.011987
Bounds on the Cross-Correlation Functions of State m-Sequences · IEEE Trans. Commun. 1987
Physical-layer communications
spread spectrum
0.011987
Bounds on the Cross-Correlation Functions of State m-Sequences · IEEE Trans. Commun. 1987

Methods — techniques the papers use, named apart from their topics

linear feedback shift register analysis · 0.0
YearPublicationVenuePosition
1987 Bounds on the Cross-Correlation Functions of State m-Sequences
abstract
The performance of the periodic Hamming correlation function of the sequences of states ofm-sequence simple linear feedback shift register generators is evaluated. We call these sequences statemsequences. Theoretical lower and upper bounds on the peaks of the Hamming cross-correlation functions of those sequences, which are often used in frequency-hopped spread-spectrum systems, are derived. Numerical results in support of the theory are presented, and it is shown that the worst-case shift of the cross-correlation for relatively short sequences is of burst nature. The state position mapped (SPM) sequences of the statem-sequences are introduced. Their suitability for OR-channel code division multiplexing is numerically examined. The behavior of the periodic crosscorrelation function of these SPM sequences is used as the basis for judging their performance. It is explained also that the lower bound on the peak of the periodic Hamming cross-correlation function of the statem-sequences is naturally a lower bound on the peak of the periodic crosscorrelation function of SPM statem-sequences. This is due to the general relationship (a decimation relationship) between the two types of correlation functions. This relationship is explained and illustrated by an example. Tables of the peaks of both cross-correlation functions are presented for all sets of sequences for sequence generators of 5, 6, 7, and 8 stages.
A. A. Shaar, Chris F. Woodcock, Phil A. Davies
IEEE Trans. Commun.1