1988
DOI: 10.1109/18.2615
|View full text |Cite
|
Sign up to set email alerts
|

N-shift cross-orthogonal sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
109
0
1

Year Published

2003
2003
2017
2017

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 330 publications
(121 citation statements)
references
References 2 publications
1
109
0
1
Order By: Relevance
“…Based on two users, each user is assigned a set of two codes of length N and two transmitting bands. The user kth signal during the two intervals is observed in (11). While the transmitting signals during the odd and even intervals on band m are observed in (12) and (13) respectively.…”
Section: An Actual Implementation Of a Decode-and-forward Cooperativementioning
confidence: 99%
See 1 more Smart Citation
“…Based on two users, each user is assigned a set of two codes of length N and two transmitting bands. The user kth signal during the two intervals is observed in (11). While the transmitting signals during the odd and even intervals on band m are observed in (12) and (13) respectively.…”
Section: An Actual Implementation Of a Decode-and-forward Cooperativementioning
confidence: 99%
“…The highlighted cooperative algorithm is presented in [9]; it considers a decode-and-forward multiple-access cooperation transmission framework using the complete complementary (CC) code sets. These codes have particular correlation properties [10][11][12]. Along each set, the autocorrelation sum is impulsive.…”
Section: An Actual Implementation Of a Decode-and-forward Cooperativementioning
confidence: 99%
“…In Fig. 3, it is shown that three different seed codes (a, b and c) effectively lead to three sub-sets of the OC codes, which are sub-sets A, B and C, representing the complete complementary codes [15,16], binary complementary codes and polyphase complementary codes respectively, where A & B & S and C & S. Therefore in principle, by using a series of carefully selected seed codes, we can generate the whole super-set S of the perfect complementary codes, each of which should ensure MAI-free and MI-free operation of a CDMA system. Now let us give a simple example to show step by step how the generation procedure works.…”
Section: Corollarymentioning
confidence: 99%
“…Both Golay and Turyn studied pairs of binary complementary codes whose autocorrelation function is zero for all even shifts except the zero shift. Suehiro [15] extended the concept to generation of so called complete complementary (CC) codes whose autocorrelation function is zero for all even and odd shifts except the zero shift and whose cross-correlation function for any pair is zero for all possible shifts. The work carried out in [15] had paved the way for possible applications of the CC codes in CDMA systems, a possible architecture of which has been proposed and studied in [16].…”
Section: Introductionmentioning
confidence: 99%
“…In order to support higher splitting factors and longer transmission distance, several coding schemes have been proposed [19][20][21] . The CCC is a sequence set that contains sets of sequences having ideal autocorrelation and cross-correlation properties [22] . Suppose a collection of m sequence sets, each of which contains n finite length sequences of length l. A sequence of CCC U ðmÞ n can be defined as…”
mentioning
confidence: 99%