EP1576752A1 - Ameliorations apportees a ou relatives a des codes d'etalement pour des systemes quasi-synchrones d'acces multiple par repartition de code - Google Patents

Ameliorations apportees a ou relatives a des codes d'etalement pour des systemes quasi-synchrones d'acces multiple par repartition de code

Info

Publication number
EP1576752A1
EP1576752A1 EP03780406A EP03780406A EP1576752A1 EP 1576752 A1 EP1576752 A1 EP 1576752A1 EP 03780406 A EP03780406 A EP 03780406A EP 03780406 A EP03780406 A EP 03780406A EP 1576752 A1 EP1576752 A1 EP 1576752A1
Authority
EP
European Patent Office
Prior art keywords
code
sequences
codes
small
correlation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP03780406A
Other languages
German (de)
English (en)
Inventor
Glyn Bae Systems C4ISR WYMAN
Richard Anthony Bae Systems C4ISR JONES
Derek Howard Smith
Stephanie Perkins
Geoffrey Raymond QinetiQ Limited BRADBEER
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
BAE Systems PLC
Original Assignee
BAE Systems PLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from GBGB0230260.2A external-priority patent/GB0230260D0/en
Priority claimed from GB0303141A external-priority patent/GB0303141D0/en
Application filed by BAE Systems PLC filed Critical BAE Systems PLC
Publication of EP1576752A1 publication Critical patent/EP1576752A1/fr
Withdrawn legal-status Critical Current

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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé de génération de codes d'étalement, assurant que la corrélation croisée est égale à -1 pour toutes les paires de séquences au cours des temps de propagation appropriés.
EP03780406A 2002-12-23 2003-12-18 Ameliorations apportees a ou relatives a des codes d'etalement pour des systemes quasi-synchrones d'acces multiple par repartition de code Withdrawn EP1576752A1 (fr)

Applications Claiming Priority (5)

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 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 2003-02-10
PCT/GB2003/005512 WO2004057784A1 (fr) 2002-12-23 2003-12-18 Ameliorations apportees a ou relatives a des codes d'etalement pour des systemes quasi-synchrones d'acces multiple par repartition de code

Publications (1)

Publication Number Publication Date
EP1576752A1 true EP1576752A1 (fr) 2005-09-21

Family

ID=32683996

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03780406A Withdrawn EP1576752A1 (fr) 2002-12-23 2003-12-18 Ameliorations apportees a ou relatives a des codes d'etalement pour des systemes quasi-synchrones d'acces multiple par repartition de code

Country Status (3)

Country Link
EP (1) EP1576752A1 (fr)
AU (1) AU2003288567A1 (fr)
WO (1) WO2004057784A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8035555B2 (en) 2004-12-17 2011-10-11 Jon Olafur Winkel Spreading codes for a satellite navigation system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6324159B1 (en) * 1998-05-06 2001-11-27 Sirius Communications N.V. Method and apparatus 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
EP1068682B1 (fr) * 1999-01-29 2007-09-26 Daiei Electronics Co., Ltd. Système adaptatif à spectre étale et débarassé d'interférences, employant des jeux de séquences de codes binaires présentant des propriétés de zone à corrélation nulle

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2004057784A1 *

Also Published As

Publication number Publication date
WO2004057784A1 (fr) 2004-07-08
AU2003288567A1 (en) 2004-07-14

Similar Documents

Publication Publication Date Title
Boztas et al. Binary sequences with Gold-like correlation but larger linear span
Long et al. A generalized QS-CDMA system and the design of new spreading codes
US5210770A (en) Multiple-signal spread-spectrum transceiver
Yang et al. Performance comparison of multiwavelength CDMA and WDMA+ CDMA for fiber-optic networks
KR101664375B1 (ko) 통신 신호들을 위한 시퀀스들의 대수 생성기
US6834291B1 (en) Gold code generator design
US7352796B1 (en) Multiple data rate complex Walsh codes for CDMA
CN101277125B (zh) 产生零相关区码、发送扩频码和接收扩频码的方法及装置
EP2382725B1 (fr) Système de communications employant des codes d'étalement chaotiques orthogonaux
WO2001022637A1 (fr) Systeme de communication amrc utilisant un ensemble de sequences de code presentant une region de correlation non croisee
KR20010012192A (ko) 유사-랜덤 잡음 생성기를 위한 마스크 생성 다항식
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 (fr) Ameliorations apportees a ou relatives a des codes d'etalement pour des systemes quasi-synchrones d'acces multiple par repartition de code
US20060008034A1 (en) Spreading codes for quasisynchronous code division multiple access systems
Suneel Chaotic sequences for secure CDMA
Yadav et al. Design and performance analysis of 1D, 2D and 3D prime sequence code family for optical CDMA network
Jos et al. Method of generating multiple sets of orthogonal codes with wide choice of spreading factors
US20020016805A1 (en) Method and device for self-clock controlled pseudo random noise (PN) sequence generation
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
CN102025390B (zh) 一种扩频通信控制方法、装置及***
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
KR100743888B1 (ko) 보호구간 시퀀스를 추가한 준직교 확산시퀀스를 사용하는코드분할 다중접근 통신 장치 및 시스템

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20050629

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20090701