WO2004057784A1 - Improvements in or relating to spreading codes for quasisynchronous code division multiple access systems - Google Patents
Improvements in or relating to spreading codes for quasisynchronous code division multiple access systems Download PDFInfo
- Publication number
- WO2004057784A1 WO2004057784A1 PCT/GB2003/005512 GB0305512W WO2004057784A1 WO 2004057784 A1 WO2004057784 A1 WO 2004057784A1 GB 0305512 W GB0305512 W GB 0305512W WO 2004057784 A1 WO2004057784 A1 WO 2004057784A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- code
- sequences
- codes
- small
- correlation
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
- H04B1/7073—Synchronisation aspects
- H04B1/7075—Synchronisation aspects with code phase acquisition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/10—Code generation
- H04J13/12—Generation of orthogonal codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B2201/00—Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
- H04B2201/69—Orthogonal indexing scheme relating to spread spectrum techniques in general
- H04B2201/707—Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
- H04B2201/7097—Direct sequence modulation interference
- H04B2201/709709—Methods of preventing interference
Definitions
- the present invention relates to improvements in or relating to spreading codes for quasisynchronous code division multiple access systems, and is more particularly concerned with the optimisation of code assignment for such systems.
- This "synchronisation” can be achieved, for example, by providing each user of the system with a global positioning system (GPS) receiver and triggering the user bit epochs by a GPS clock. The relative delays of received signals can then be held to within a few chips.
- GPS global positioning system
- the candidate spreading codes are m -length sequences, the small Kasami set, the Gold codes and the large Kasami set. These terms are well known in the relevant technical field and no further discussion will be given here. These codes correspond to periodic binary sequences.
- a method of generating codes for a multiplicity of cliques in which the properties within the cliques are orthogonal or pseudo orthogonal and the cross-correlation of pairs selected from different cliques exhibit pseudo orthogonal properties within specific time windows.
- 'clique' is meant a fully connected subset of constraints as will be readily understood by a person of ordinary skill in the art.
- the pairs may be selected from different cliques are such that both elements of each pair are in the small Kasami set.
- the pairs selected from different cliques are such that one element of each pair is in the small Kasami set and the other element of each pair is a Gold code.
- the pairs selected from different cliques are such that each element of each pair is generated by a simplex code.
- the small Kasami set has good cross-correlation properties and it is possible to use several different phases of the same sequence for different users.
- the small Kasami set contains an m-length sequence, and is embedded within the large Kasami set which also contains a set of Gold codes. Whilst it may be thought that the small Kasami set is too small to be useful in a system with many users, this assumption ignores the following:-
- the small Kasami set contains an m -length sequence and some of the most important pairs of transmitters can be assigned different phases of this sequence. Should the small Kasami set prove inadequate, some transmitters can be assigned Gold codes, and the correlation of a small Kasami code-Gold code pair is no worse than that of a Gold code pair. Such an assignment is made to a pair where the interference potential is relatively limited.
- ⁇ x y ⁇ is generally required to be small for all ⁇ . In quasisynchronous systems, it may be simply required that, for any user codes x and , then ⁇ x y ⁇ ) is small for 0 ⁇
- the correlation functions can also be defined in the same way when the periods of the sequences are divisors of p .
- the correlation functions can also be defined over windows of length w ⁇ p . In this case the definitions are:
- K_ ( «) ⁇ -., « ⁇ w, u ⁇ Tw,u® T 2 w...,u® T " 2 ⁇ 2 > ⁇ ,
- the small Kasami set is contained within the large Kasami set, which also includes Gold codes.
- These Gold codes can be expressed as:
- the assignment of spreading codes in CDMA systems appears to have received almost no attention. There appear to be two basic reasons for this. The first reason is concerned with the need for code re-use. In many circumstances, particularly with long spreading codes, the number of codes available may be sufficiently large that code assignment is not a critical problem. An example of this is the long (scrambling) codes proposed for cells in UMTS mobile telephone systems. Code re-use is clearly more critical when the small Kasami set is used. The second reason is concerned with the assignment of codes so that constraints on the codes assigned to pairs of transmitters are satisfied. This does not generally arise when codes are used for which the maximum correlation between all pairs of codes is the same. This does not hold for the codes described here.
- Electromagnetic Compatibility Vol. 43, No. 2, pages210 to 218, 2001 can be modified for spreading code assignment. If f(t,) denote the code assigned to a transmitter t, . Pairs of transmitters t,,t 2 have one of the following:
- the frequency domains (or sets of available frequencies) in the frequency assignment algorithms are replaced by codewords which are equally spaced phases (separated by at least 2-- max +1 cyclic shifts) of the various sequences.
- the cost function is simply a (weighted) sum of the number of constraint violations. Although it is not possible to give a theoretical estimate of the reduction of the ' multiple access interference in the system without making many assumptions, the assignment of the best code pairs to the most critical interfering pairs should ensure that the overall reduction is substantial.
- X. D. Lin and K. H. Chang have proposed a construction for spreading sequences for QS-CDMA ("Optimal PN sequence design for quasisynchronous CDMA communication systems", IEEE Trans.
- ⁇ xA ⁇ > where ⁇ m (d) is the cross-correlation function of certain seed sequences u, v .
- ⁇ x y -1 for the chosen pair of vectors X,Y , but it is easy to see that if m > 3 , this cannot be the case for every pair.
- ⁇ be a primitive element of the Galois field, GF(2"), and
- Tr n '](x) _" l "' ⁇ x ⁇ 2" " be the trace function from GF(2") to GE(2 m ), then the properties of the trace function are as described in MacWilliams and Sloane referenced above.
- the sequence X e of length 2"-l for a balanced seed vector can be constructed from a (2 m -l)xT array with columns labelled 0, 1, ..., T- ⁇ as follows:- If s, - ⁇ , then the tth column is a column of zeros. If -., ⁇ ⁇ , then the / th column is the transpose of (e Sj , e ⁇ +1 , ..., c , +2 *»_ 2mod(2 *. ) ) a d thus ' s a cyclic shift of e .
- ⁇ e ( e s 0 s e S ⁇ ⁇ > — ⁇ > e ⁇ ⁇ . t • > e ⁇ ⁇ > • •• ⁇ > e !2(7 ._ l) > e *--. ⁇ > •• • ⁇ > e ⁇ i ,
- ⁇ ef (0) -1 for any pair of seed vectors. It is also required that all the vectors must be cyclically distinct.
- a simplex code is the dual of a Hamming code as discussed by F. J.
- MacWilliams and N. J. A. Sloane in "The theory of error-correcting codes", Amsterdam, Elsevier 1996, 9 th Edition. It is a linear code with a generator matrix with columns formed from the set of all distinct, non-zero (0, 1) vectors of length m in some order. The code has parameters (2 m -1, m, 2 (m_1) ) . Thus a simplex code is an equidistant code and all 2"' -l non-zero codewords have weight 2"' "1 . It follows that if these 2"' -l non-zero codewords are used as seed vectors, then ⁇ ef (0) -l for any pair.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/493,421 US20060008034A1 (en) | 2002-12-23 | 2003-12-18 | Spreading codes for quasisynchronous code division multiple access systems |
AU2003288567A AU2003288567A1 (en) | 2002-12-23 | 2003-12-18 | Improvements in or relating to spreading codes for quasisynchronous code division multiple access systems |
EP03780406A EP1576752A1 (en) | 2002-12-23 | 2003-12-18 | Improvements in or relating to spreading codes for quasisynchronous code division multiple access systems |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GBGB0230260.2A GB0230260D0 (en) | 2002-12-23 | 2002-12-23 | Improvements in or relating to spreading codes for quasisynchronous code division multiple access systems |
GB0230260.2 | 2002-12-23 | ||
GB0303141A GB0303141D0 (en) | 2003-02-10 | 2003-02-10 | Improvements in or relating to spreading codes for quasisynchronous code division multiple access systems |
GB0303141.6 | 2003-02-10 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004057784A1 true WO2004057784A1 (en) | 2004-07-08 |
Family
ID=32683996
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/GB2003/005512 WO2004057784A1 (en) | 2002-12-23 | 2003-12-18 | Improvements in or relating to spreading codes for quasisynchronous code division multiple access systems |
Country Status (3)
Country | Link |
---|---|
EP (1) | EP1576752A1 (en) |
AU (1) | AU2003288567A1 (en) |
WO (1) | WO2004057784A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006063613A1 (en) * | 2004-12-17 | 2006-06-22 | European Space Agency | Spreading codes for a satellite navigation system |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6091760A (en) * | 1998-06-29 | 2000-07-18 | L-3 Communications Corporation | Non-recursively generated orthogonal PN codes for variable rate CDMA |
WO2000045530A1 (en) * | 1999-01-29 | 2000-08-03 | Toyo Communication Equipment Co., Ltd. | Adaptive interference-free spread-spectrum system employing binary code sequence sets with zero correlation zone properties |
US20020136171A1 (en) * | 1998-05-06 | 2002-09-26 | Jan Mennekens | Method and system for code division multiple access communication with increased capacity through self-noise reduction |
-
2003
- 2003-12-18 WO PCT/GB2003/005512 patent/WO2004057784A1/en not_active Application Discontinuation
- 2003-12-18 AU AU2003288567A patent/AU2003288567A1/en not_active Abandoned
- 2003-12-18 EP EP03780406A patent/EP1576752A1/en not_active Withdrawn
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020136171A1 (en) * | 1998-05-06 | 2002-09-26 | Jan Mennekens | Method and system for code division multiple access communication with increased capacity through self-noise reduction |
US6091760A (en) * | 1998-06-29 | 2000-07-18 | L-3 Communications Corporation | Non-recursively generated orthogonal PN codes for variable rate CDMA |
WO2000045530A1 (en) * | 1999-01-29 | 2000-08-03 | Toyo Communication Equipment Co., Ltd. | Adaptive interference-free spread-spectrum system employing binary code sequence sets with zero correlation zone properties |
Non-Patent Citations (2)
Title |
---|
BATTITI R ET AL: "ASSIGNING CODES IN WIRELESS NETWORKS: BOUNDS AND SCALING PROPERTIES", WIRELESS NETWORKS, ACM, US, VOL. 5, NR. 3, PAGE(S) 195-208, ISSN: 1022-0038, XP000834509 * |
LIN X ET AL: "OPTIMAL PN SEQUENCE DESIGN FOR QUASI-SYNCHRONOUS CDMA COMMUNICATIONSYSTEMS", 1995 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS). SEATTLE, APR. 30 - MAY 3, 1995, NEW YORK, IEEE, US, vol. 1, 30 April 1995 (1995-04-30), pages 81 - 84, XP000583186, ISBN: 0-7803-2571-0 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006063613A1 (en) * | 2004-12-17 | 2006-06-22 | European Space Agency | Spreading codes for a satellite navigation system |
US8035555B2 (en) | 2004-12-17 | 2011-10-11 | Jon Olafur Winkel | Spreading codes for a satellite navigation system |
Also Published As
Publication number | Publication date |
---|---|
AU2003288567A1 (en) | 2004-07-14 |
EP1576752A1 (en) | 2005-09-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Boztas et al. | Binary sequences with Gold-like correlation but larger linear span | |
US7457348B2 (en) | Spread-spectrum transceiver | |
Long et al. | A generalized QS-CDMA system and the design of new spreading codes | |
Lin et al. | Optimal PN sequence design for quasisynchronous CDMA communication systems | |
US5267271A (en) | Signal analysis technique for determining a subject of binary sequences most likely to have been transmitted in a multi-node communication network | |
KR101664375B1 (en) | Algebraic generators of sequences for communication signals | |
US20050273480A1 (en) | Gold code generator design | |
US7352796B1 (en) | Multiple data rate complex Walsh codes for CDMA | |
CN101277125B (en) | Method and apparatus for generating zero correlation section code, transmitting and receiving spread-spectrum code | |
WO2001022637A1 (en) | Cdma communication system employing code sequence set having non-cross correlation region | |
WO1999045670A2 (en) | Mask generating polynomials for pseudo-random noise generators | |
US10805031B2 (en) | Method for constructing orthogonal sequence sets in CDMA system, code word generating device, communication base station, base station controller, and wireless communication network | |
WO2004057784A1 (en) | Improvements in or relating to spreading codes for quasisynchronous code division multiple access systems | |
Suneel | Chaotic sequences for secure CDMA | |
US20060008034A1 (en) | Spreading codes for quasisynchronous code division multiple access systems | |
Yadav et al. | Design and performance analysis of 1D, 2D and 3D prime sequence code family for optical CDMA network | |
US20020016805A1 (en) | Method and device for self-clock controlled pseudo random noise (PN) sequence generation | |
US20120257640A1 (en) | Uniquely Decodable Codes And Decoder for Overloaded Synchronous CDMA Systems | |
US20030137956A1 (en) | Method and system for multiple-shift code acquisition of optical orthogonal codes in optical CDMA systems | |
Song et al. | Correlation of column sequences from the arrays of Sidelnikov sequences of different periods | |
Tsuneda et al. | Performance evaluation of asynchronous DS/CDMA communications using unipolar codes | |
Parthiban et al. | Wavelet-based multiple access technique for mobile communications | |
Alkasassbeh et al. | BER performance using linear phase orthogonal binary codes for multi-users mobile communication | |
RU2205510C1 (en) | Method for transmitting digital data over radio link using pseudorandom operating frequency control | |
WOJUOLA | Cross-correlation index and multiple-access performance of spreading codes for a wireless system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2003780406 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2006008034 Country of ref document: US Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10493421 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 2003780406 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 10493421 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: JP |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: JP |