WO2007065335A1 - Procede d'allocation de code de walsh - Google Patents

Procede d'allocation de code de walsh Download PDF

Info

Publication number
WO2007065335A1
WO2007065335A1 PCT/CN2006/002679 CN2006002679W WO2007065335A1 WO 2007065335 A1 WO2007065335 A1 WO 2007065335A1 CN 2006002679 W CN2006002679 W CN 2006002679W WO 2007065335 A1 WO2007065335 A1 WO 2007065335A1
Authority
WO
WIPO (PCT)
Prior art keywords
wash
new
release
allocated
occupied
Prior art date
Application number
PCT/CN2006/002679
Other languages
English (en)
Chinese (zh)
Inventor
Zhouyu Deng
Original Assignee
Huawei Technologies Co., Ltd.
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
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Publication of WO2007065335A1 publication Critical patent/WO2007065335A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/16—Code allocation
    • H04J13/18—Allocation of orthogonal codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/004—Orthogonal
    • H04J13/0048—Walsh

Definitions

  • This relates to wood in the communication system
  • WaSh is used more frequently in the communication system than in the code forward (A Code vs ope Acces) system. Was is also in each forward direction.
  • the forward direction refers to
  • the occupancy status can also be an occupancy status that cannot be allocated again. There are cases where fans ca n’t reallocate and occupy.
  • the principle of Wash distribution is that the media Was has been allocated, and all and all its children ca n’t be reallocated. Among them, the other children that are allocated because they cannot be redistributed can be allocated. Assign Was Other rules that follow the irregular rules can not be allocated with the same Wash. To distribute the Wash, all of its children must be allocated to the Wash. The amount of low Wash is not reduced. The Was is not reduced. That is, the new Was are allocated to those who have occupied or the nearest.
  • the forward direction in the CD A system includes the common channel and the basic component (FC F dame a Cha e) and
  • the existing wood with the same SC is the new B s of the original SC B s user.
  • the Was allocation includes the following steps. The SC of each existing B s allocates the new B s. Are the new and B s the same? If the rate is the same, it is not Update Wash direct new B s allocation The Wash fruit rate of B s is different, and then the new Wash B in Was village is reallocated to Wa h. The new B s and B s belong to the same user.
  • the Wash is not updated considering that the rate of B s is the same.
  • the required Wash is not the same.
  • the rate is different.
  • the hollow Wa h in the Was village does not contain the Wash being used by B s.
  • 2a indicates the hoard before the SC allocates the Wash, and 2a indicates the non-Wash indicates Was.
  • SC assigns Wash Wa, and Likong. 2
  • the Was part of the Wash is allocated to the SC to indicate hoarding, and 2 indicates the Wash occupied by the SC. Represents the Was occupied by the Wash except for SC.
  • Wash, and Likong Wash are assigned principles.
  • Wash and all its children are assigned SC
  • 2c is interested in the replacement of other calls.
  • the symbolic cause of Wash's crossover is 2c, which means Was occupied by SC mentioned in 2b, and Was which is occupied by other parts except SC means hollow Was.
  • We occupied by B s of Wash SC because of occupancy, so other users can not use 2b occupied Wash to look at other calls, in 2c special force. Therefore, there are broken Wash and Wash in the Wash village shown in 2c. If there is already B s The new B s of C uses Wa of B s, and the Wa h used by this C is not in the best position in the village. There is fragmentation in the village of Was.
  • the Was of the existing wood is a constant speed SC. Was will remain unchanged.
  • Was is assigned to C. It may be assigned to SC in the most position in the Wash village, but in the SC ’s fancy, the new call is not replaced.
  • Was is not updated.
  • C The directly used Wash has been in the tree is no longer in the best position, causing Wash to be broken and other users to allocate high-speed SC content
  • the main purpose of this book is to provide a Wash distribution method to reduce Was fragmentation.
  • step c Compare Was allocated in step b. Wah released in step a. Wah that needs to be released and used.
  • each C that already has B s allocates the Was occupied by B s before the new B
  • the newly allocated Wash is larger than Was, or the newly allocated Wash is smaller than Wa h, or the newly allocated Wash Wa is exactly the same.
  • This method also provides a solution for the distribution of Wash in the case when the Was in SC are large or small.
  • the Was larger means that the new Was is larger than the Wash
  • the Was reduced means that the new Was is smaller than the Wash.
  • the shattering of Wa sh has increased a lot. Wash signal hoard
  • the b idea of this book is Was redistribution of Wash before the release of B s. Compared to the redistribution of Was, the Wash needs 5 Was to be released and used. Among them, the Was of the former B s may be the allocation of new B s in the C of each existing B s, and the WaSh of releasing B s may also be the release of Wash of all B s in.
  • the pre-release B s Wash in this book is to allocate new B s and B s Wash to each existing B s SC.
  • the B s means that the existing B s B s and the new B s are for the same user. Since the allocation method in 1 is a new B s that needs to allocate users, and the user's unused Wash is also an event Wash reorganization method.
  • 3 indicates the distribution of Wa in this book, and the steps shown in 3 include the following steps
  • Step 301 allocates a new B s with each existing B s C, and releases the Wash occupied by the previous SC B s.
  • step 301 What is described in step 301 is the Wah mercury wash occupied by the previous SC B s, and the B s that Was not used at this time are used immediately.
  • Step 302 The new B s of SC is reassigned Was.
  • step 302 the Wash before washing and the Wah allocation in step 301, and the rest allocation can be in accordance with a certain allocation principle, and the Was allocation principle can have a younger brother or the nearest one than Qiu Xian.
  • the newly allocated Wash accounts for in.
  • Step 301 and step 302 can reassign Wash to the new B s of the SC. This article will redistribute the Was to the Wash Wah released in step 301 of the new Was.
  • Step 303 compares the redistributed new Wa that was released in step 301, and the new and Was applications that do not overlap are released at B s.
  • the new and Was can have 4 divine powers, completely heavy, or not overlapping at all, or the new Wash is larger than Was, or the new Was is smaller than Was, and so on. Its, if the new and Wash completely overlap, because B
  • the Wash has been used by all new B s, so all of the Wash is not, and the Zhuang Guo is still occupied in the Wash village. Wah is completely unimportant. B s Release all the unused Was Clear the Wash Occupied in the Was village, the released Wash can be used by other users. The new Wah is larger than the Wash. Since the B released at the end of the B has been used by all new B s, because JL Was is not released, the new fruit is still occupied in Wash Wash is smaller than Wash and B s ends. The remaining part, that is, the non-heavy part of Was, is still occupied in Wa h.
  • the Wa reassignment used by the B s of the SC was assigned the Wa h Wash to release Teli Kong.
  • the SC of the existing B s is assigned a new B s.
  • the SC of each existing B s in this book allocates a new B s.
  • the result of the judgment of the C judgment is that there is no new B s.
  • B s each SC that already has B s allocates a new B s, and the Wash occupied by the previous B.
  • the SC's judgment is generally better than the B's advance period, such as the Hundred-Holiday advance situation.
  • the new B work judged earlier in this book is not the same as the B s end.
  • Step 501 will be the Wash of all SCs.
  • Step 501 is to explain the Was of SCs.
  • Step 501 can be any ratio B s
  • the multiple rest period can be determined in advance.
  • the release in in step 501 is the Was of Was mercury occupied by the former C B s. Immediately, the release result of this Was unused B is not reasonable, so it is a false release.
  • Step 502 Reassign Was in.
  • Step 503 In SC, compare the newly allocated Was and Wash. If they are not completely the same, update the Wash. If they are completely the same, use Wa.
  • the update of Wash mentioned in step 03 refers to the message that C uses the newly allocated Was and releases Wash, to update Wah.
  • the strength of the book is better, not limited to the use of the book.

Landscapes

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

Abstract

La présente invention concerne un procédé d'allocation de code de Walsh caractérisé en ce qu'il comprend: a) la génération préalable de code de Walsh dans la rafale courante; b) la réallocation du code de Walsh; c) la comparaison de la relation entre le code de Walsh généré à l'étape b) et le code de Walsh préalablement généré à l'étape a) afin de déterminer un code de Walsh à générer. L'invention permet de réduire le fragment de Walsh.
PCT/CN2006/002679 2005-12-05 2006-10-12 Procede d'allocation de code de walsh WO2007065335A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2005101266840A CN1852067B (zh) 2005-12-05 2005-12-05 一种沃尔什码分配方法
CN200510126684.0 2005-12-05

Publications (1)

Publication Number Publication Date
WO2007065335A1 true WO2007065335A1 (fr) 2007-06-14

Family

ID=37133538

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2006/002679 WO2007065335A1 (fr) 2005-12-05 2006-10-12 Procede d'allocation de code de walsh

Country Status (2)

Country Link
CN (1) CN1852067B (fr)
WO (1) WO2007065335A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1219831A (zh) * 1997-12-09 1999-06-16 三星电子株式会社 Cdma蜂窝系统中按组分配沃尔什码的方法
CN1411294A (zh) * 2001-09-29 2003-04-16 Lg电子株式会社 分配Walsh码资源的方法
WO2003056869A1 (fr) * 2001-12-24 2003-07-10 Nortel Networks Limited Gestion de codes walsh dans un systeme de communication sans fil cellulaire a acces multiple par repartition de code
US20050124348A1 (en) * 2003-11-26 2005-06-09 Peter Gaal Code channel management in a wireless communications system
CN1659805A (zh) * 2002-04-29 2005-08-24 高通股份有限公司 专用信道上的传输格式信息的传输

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7366518B2 (en) * 2000-12-01 2008-04-29 Lucent Technologies Inc. Supplemental channel sharing algorithm

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1219831A (zh) * 1997-12-09 1999-06-16 三星电子株式会社 Cdma蜂窝系统中按组分配沃尔什码的方法
CN1411294A (zh) * 2001-09-29 2003-04-16 Lg电子株式会社 分配Walsh码资源的方法
WO2003056869A1 (fr) * 2001-12-24 2003-07-10 Nortel Networks Limited Gestion de codes walsh dans un systeme de communication sans fil cellulaire a acces multiple par repartition de code
CN1659805A (zh) * 2002-04-29 2005-08-24 高通股份有限公司 专用信道上的传输格式信息的传输
US20050124348A1 (en) * 2003-11-26 2005-06-09 Peter Gaal Code channel management in a wireless communications system

Also Published As

Publication number Publication date
CN1852067B (zh) 2010-11-24
CN1852067A (zh) 2006-10-25

Similar Documents

Publication Publication Date Title
US8782240B2 (en) Resource allocation using shared resource pools
US5987021A (en) Method and apparatus for allocating resources between queued and non-queued services
AU2005246402B2 (en) System and method for application server with overload protection
KR101483835B1 (ko) 시스템 리소스들의 재할당을 관리하는 방법 및 장치
EP1250826A1 (fr) Attribution preventive de largeur de bande par positionnement dynamique
JP4769874B2 (ja) 通信システムにおけるユニークワードの適応割当システムおよび方法
US8730794B2 (en) Priority service protection
JPH04506444A (ja) 広領域中継チャネルビジー・オーバライド
JP2002152813A (ja) 移動通信システムにおけるタイムスロット割り当て方法および移動通信システムにおけるタイムスロット割り当て装置
KR20120128681A (ko) 시스템 리소스들의 계층 관리를 위한 방법 및 장치
CN114070822A (zh) 一种Kubernetes Overlay IP地址管理方法
WO2018137611A1 (fr) Procédé de traitement de tâche, nœud, support, dispositif et réseau de distribution de contenu
CN112491566B (zh) 资源管理方法、资源管理系统及计算机可读存储介质
WO2010148787A1 (fr) Procédé d'ordonnancement de service de téléconférence et système de téléconférence
WO2007065335A1 (fr) Procede d'allocation de code de walsh
JP2001195268A (ja) サービスレベルによる資源割当方式
JP2002111629A (ja) 多動作モード間でのコードスペースの動的再割り当て
US20020196799A1 (en) Throttling queue
WO2022099856A1 (fr) Procédé et appareil de configuration de ressources, et terminal de lecture audio et vidéo
WO2011075919A1 (fr) Procédé et dispositif permettant de partager des ressources abis
KR19990060514A (ko) 코드 분할 다중 접속 방식 개인 휴대 통신 시스템의 트래픽 채널할당 방법
CN100505637C (zh) 一种通信系统中资源分配方法
CN116720179B (zh) Api接口管理方法、终端设备及计算机可读存储介质
KR20120070482A (ko) 무선통신시스템에서의 고정할당 장치 및 방법
KR100396663B1 (ko) 이동 통신 시스템의 자원 할당 방법

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06791250

Country of ref document: EP

Kind code of ref document: A1