Proceedings of Vehicular Technology Conference - VTC
DOI: 10.1109/vetec.1996.504054
|View full text |Cite
|
Sign up to set email alerts
|

New coding schemes for increased number of users or messages in frequency-hopped multilevel FSK

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…The cardinality of the set of sequences equals p' -1. 1 /i is the unique inverse of i in the Galois field GF(p') and can be calculated as [17] 1= -2 (mod p'). (10) An example of operation of an interleaver is shown in Table I.…”
Section: E Interleaver Sequence Designmentioning
confidence: 99%
See 1 more Smart Citation
“…The cardinality of the set of sequences equals p' -1. 1 /i is the unique inverse of i in the Galois field GF(p') and can be calculated as [17] 1= -2 (mod p'). (10) An example of operation of an interleaver is shown in Table I.…”
Section: E Interleaver Sequence Designmentioning
confidence: 99%
“…The Hamming cross-correlation returns the number of coincidences or hits, between the sequences for relative time delay T and is given by Please note that in (17) and (18) (19) The mean value of normalized Hamming cross-correlation of (16) the sequences examined in this paper equals A indicating on average one hit for the whole sequence length Lp = 400. We have also calculated the average mean square aperiodic correlation functions defined in [21] and for all of the sequences investigated in this paper, the values were similar.…”
Section: Hamming Correlationmentioning
confidence: 99%
“…The cardinality of the set of sequences equals p' -1. 1/i is the unique inverse of i in the Galois field GF(p') and can be calculated as [14] I ip (mod p').…”
Section: Introductionmentioning
confidence: 99%
“…They are defined through the following placement operator [12]: y(k) = ak (mod p) (4) For simulation purposes, the cardinality and the periodicity of the codes are chosen to be equivalent, equal to the value of p. This method produces a family ofp different sequences.…”
Section: Linear Congruence Codesmentioning
confidence: 99%
“…Designed through a simple relationship between the user number, the iteration number, and a primitive element r, given by the equation [ 1]: y(k) = rk+ a (mod p) (12) This method requires a Galois field of size p, and the finding of a primitive element (r) of the field (which when raised to the powers from 0 to p-2 provides all elements of the field). For this simulation, r was chosen as 2, this being a primitive element of a Galois field of size 11 (see Section IV).…”
Section: J One-coincidence Sequencesmentioning
confidence: 99%