2017
DOI: 10.1109/comst.2016.2639739
|View full text |Cite
|
Sign up to set email alerts
|

Sequence Sets in Wireless Communication Systems: A Survey

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(21 citation statements)
references
References 179 publications
0
21
0
Order By: Relevance
“…For example, the m-sequence set has nearly ideal cyclic auto-correlation property (to be exact, the auto-correlation function of the m-sequence is −1 for any non-zero shift, hence is "nearly" optimal), while its cyclic crosscorrelation and flipped correlation functions are unbounded. The Gold sequence set and the Kasami sequence set (candidate in W-CDMA) have better cyclic cross-correlation properties and acceptable cyclic auto-correlation properties, but their flipped correlations are unbounded (see the excellent survey [21] on the correlation functions of these sequences).…”
Section: A Codes In Legacy Cdma Systemsmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, the m-sequence set has nearly ideal cyclic auto-correlation property (to be exact, the auto-correlation function of the m-sequence is −1 for any non-zero shift, hence is "nearly" optimal), while its cyclic crosscorrelation and flipped correlation functions are unbounded. The Gold sequence set and the Kasami sequence set (candidate in W-CDMA) have better cyclic cross-correlation properties and acceptable cyclic auto-correlation properties, but their flipped correlations are unbounded (see the excellent survey [21] on the correlation functions of these sequences).…”
Section: A Codes In Legacy Cdma Systemsmentioning
confidence: 99%
“…Specifically, each time we feed a vertex v i into the DNN, it outputs a policy estimation P and a reward estimation R . Each entry in distribution P is exactly the prior probability P (v i , a j ) for each edge of vertex v i , and R will be used for updating the mean reward Q(v i , a j ), given by (21) later.…”
Section: A Mctsmentioning
confidence: 99%
“…2) For u = 1, 2, · · · , U and i = 0, 1, 2, · · · , K, set y u,i equal to L consecutive elements of y ′ that begin at the index that matches the spreading gain vector z u,i . Once y u,i are obtained, the set of decision variables c (u) i,j are calculated, using (12), for each user and compared against the hypothesis distributions H 0 and H 1 . Subsequently, for those users whose decision variables c (u) i,j found to belong to the hypothesis H 1 distribution, the corresponding information bits may be extracted according to (11).…”
Section: Cp-dsss Signal Detectionmentioning
confidence: 99%
“…In fact, the former is affected by the cross-correlation properties between different codes of the sets whereas the latter is influenced by the autocorrelation properties, that is the correlation between timeshifted versions of the same code [16]- [20]. In wireless communication systems, orthogonal sequences have been used to achieve communication among users and simultaneously manage interference as well as multiple access [21]- [23]. In this respect, structured binary sequences, like Legendre, Gold, Kasami, m-sequences, Gong, Paterson and Weil have been introduced and used in many CDMA/wireless communication systems [24]- [32].…”
Section: Introductionmentioning
confidence: 99%