[go: up one dir, main page]

CN101287267B - Code word cell allocation method - Google Patents

Code word cell allocation method Download PDF

Info

Publication number
CN101287267B
CN101287267B CN2007100958684A CN200710095868A CN101287267B CN 101287267 B CN101287267 B CN 101287267B CN 2007100958684 A CN2007100958684 A CN 2007100958684A CN 200710095868 A CN200710095868 A CN 200710095868A CN 101287267 B CN101287267 B CN 101287267B
Authority
CN
China
Prior art keywords
sub
district
adjacent
distribution
cells
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.)
Expired - Fee Related
Application number
CN2007100958684A
Other languages
Chinese (zh)
Other versions
CN101287267A (en
Inventor
李萍
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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN2007100958684A priority Critical patent/CN101287267B/en
Publication of CN101287267A publication Critical patent/CN101287267A/en
Application granted granted Critical
Publication of CN101287267B publication Critical patent/CN101287267B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

A code word cell allocation method is disclosed, wherein the order of cell allocation code words is arranged from large to small according to the number of adjacent cells, and the number of adjacent cells of the first cell allocated with code words is the largest. And taking the cell with the largest number of adjacent cells as a starting point, sequentially distributing scrambling codes for the adjacent cells, sequencing the distribution sequence according to the size of the adjacent cells, and distributing code words for the adjacent cells of the adjacent cells, wherein the distribution sequence is also sequenced according to the size of the adjacent cells, and the distribution sequence is topologically opened, and is distributed in a cluster until all the cells are distributed. The method of the invention can reduce the interference between the code words between the cells of the system network under the same code resource and improve the system performance.

Description

Method for distributing codewords among cells
Technical field
The present invention relates to the method for networking code word planning cell allocation order in a kind of communication system, be particularly useful for the cdma system scrambler resource distribution method of field of mobile communication.
The present invention can also be used for all TDD-CDMA systems of moving communicating field and all SCDMA systems.
Background technology
In cdma system; Will be different cell allocation different code word, the data that receive owing to receiving terminal between adjacent cell also have the code word data of other sub-districts except the code word data that contain this sub-district; So just introduced adjacent area interference; Interference between different code words varies in size, and is necessary to study the phase mutual interference between code word, gives each cell allocation different code word in the network; Because a sign indicating number resource is limited, so the order of cell allocation code word directly influences the performance of network in the system group network.
In following document, disclosed content about cell code resource:
【1】TS25.221Physical?channels?and?mapping?of?transport?channels?ontophysical?channels(TDD),V4.7.0,3GPP;
【2】TS25.223Spreading?and?modulation(TDD),V4.5.0,3GPP;
[3] CN1142648C " distribution method of spreading code in a kind of broadband CDMA system ";
[4] CN1581748A " is used for the scrambling code distribution method that communication system is switched ";
[5] CN1694380A " collocation method of sub-district code source in the TDS-CDMA system networking ";
[6] CN1917408A " a kind of cell code resource planing method of S-CDMA ";
[7] CN1728622A " the district code word planing method of time-division-synchronization code multi-address division system ".
In above-mentioned document [1] and [2], discussed the sign indicating number resource of TD-SCDMA communication system, comprised descending synchronous code, uplink synchronous code, scrambler, spreading code, basic midamble code etc.Document [3] and [4] have provided the distribution method of spreading code, scrambler respectively.Document [5] has provided a kind of networking code word collocation method of TD-SCDMA communication system on the basis of the their cross correlation of analyzing descending synchronous code and scrambler.Document [6] relates to the cell code resource planing method in identical networking and network planning process in the TD-SCDMA communication system.Document [7] relates to the planing method of system cell code word in the CDMA mobile communication systems.
In the CDMA mobile communication systems, since code source is so in short supply, the method affect of district code word planning is to systematic function, work out allocative decision after, how to give each sub-district with code assignment, will be that planning code resources must an obligato research direction.
Summary of the invention
In view of this, main purpose of the present invention is to propose a kind of more excellent cell allocation method in proper order, under identical sign indicating number resource, system group network minizone code word is disturbed reduced to minimum.
A kind of method for distributing codewords among cells is applied to CDMA systems, with the sub-district of code word to be allocated according to its adjacent sub-district number how many descending arrangements; Be followed successively by each cell allocation code word according to putting in order.First is assigned with the adjacent cells of cells most number of code word.That sub-district with adjacent sub-district most number is a starting point; Be followed successively by its adjacent cell allocation scrambler, the order of distribution is the adjacent area distribution codeword of its adjacent sub-district with the ordering of adjacent area number size again; The order of distributing also is with the ordering of adjacent area number size; Topology is opened, and the distribution of cluster cluster all distributes up to all sub-districts.
The core algorithm of method for distributing codewords among cells of the present invention is:
Step a. selects a maximum sub-district of adjacent area number, as initial distribution sub-district A;
Step b. puts into distribution queue with sub-district A;
Step c is the center with sub-district A, is followed successively by its adjacent sub-district Bi and distributes scrambler, and i=1 wherein, 2 ..., m, the order of distribution is according to the descending arrangement of adjacent sub-district number of each sub-district Bi;
Steps d. the adjacent area Bi of sub-district A is put into the distribution queue afterbody successively;
Step e. is the center with sub-district B1, is followed successively by its adjacent sub-district C1j and distributes scrambler, and j=1 wherein, 2 ..., n, the order of distribution is according to the descending arrangement of adjacent sub-district number of each sub-district C1j;
Step f. puts into the distribution queue afterbody successively with the adjacent area C1j of sub-district B1;
Step g. with sub-district B2 is the center, be followed successively by its adjacent sub-district C2k and distribute scrambler, k=1 wherein, 2 ..., q, the order of distribution is according to the descending arrangement of adjacent sub-district number of each sub-district C2k;
Step h. puts into the distribution queue afterbody successively with the adjacent area C2k of sub-district B2;
Step I. topology is opened, and cluster cluster ground continues to distribute, and has all entered distribution queue up to all sub-districts.
When each sub-district adds formation, to judge earlier that all this sub-district is not or not in the formation, if in formation; This sub-district no longer adds formation so; If this sub-district not in formation, adds tail of the queue with this sub-district so, just the element in this formation is an inequality.
In any link of above distribution, if two adjacent cells of cells numbers are as many, so just see the size of its all adjacent adjacent cells of cells numbers, confirm that according to this size two sub-districts get into the sequencing of formation.
Adopt the method for the invention under identical sign indicating number resource, reduce the interference between the code word of system group network minizone, improve systematic function.Other advantages of the present invention, target; To in specification subsequently, set forth to a certain extent with characteristic; And to a certain extent,, perhaps can from practice of the present invention, obtain instruction based on being conspicuous to those skilled in the art to investigating of hereinafter.Target of the present invention and other advantages can be passed through following specification, claims, and the structure that is particularly pointed out in the accompanying drawing realizes and obtains.
Description of drawings
In order to make the object of the invention, technical scheme and advantage clearer, will combine accompanying drawing that the present invention is made further detailed description below, wherein:
Fig. 1 is the neighboring BS relationship level sketch map of each minizone.
Embodiment
Do further to describe in detail below in conjunction with the enforcement of 1 pair of technical scheme of accompanying drawing:
1. select a maximum sub-district of adjacent area number, as initial distribution sub-district A;
2. A is put into assigned sequence, Queue=[A];
3. be the center with this sub-district, be followed successively by its adjacent sub-district B and distribute scrambler that the order of distribution is with the adjacent area number size ordering Bi of B, B1->B2->B3;
4. Bi is put into assigned sequence, Queue=[A, B1, B2, B3];
5.C1j be according to the descending arrangement of each adjacent cells of cells number adjacent, C11-with B1>C12;
6. successively the adjacent area C1j of B1 is put into Queue, Queue=[A, B1, B2, B3, C11, C12];
7.C2k be according to the descending arrangement of each adjacent cells of cells number adjacent, C21-with B2>C22;
8. successively the adjacent area C2k of B2 is put into Queue, Queue=[A, B1, B2, B3, C11, C12, C21, C22];
9. continue to distribute, all entered distribution queue up to all sub-districts, Queue=[A, B1, B2, B3, C11, C12, C21, C22, C31, C32].
Sequencing when the dotted arrow among Fig. 1 is illustrated in each grade, the order of then final distribution are A->B1->B2->B3->C11->C12->C21->C22->C31->C32, when each sub-district adds formation; To judge earlier that all this sub-district is not or not in the formation; If in formation, this sub-district no longer adds formation so, if this sub-district is not in formation; So this sub-district is added tail of the queue, just the element in this formation is an inequality.
The present invention is applicable to cdma system, and any have a signal processing, and the engineer of knowledge background such as communication can design corresponding device thereof according to the present invention, and it all should be included in thought of the present invention and the scope.

Claims (6)

1. a method for distributing codewords among cells is applied to CDMA systems, it is characterized in that, comprising:
That sub-district with adjacent sub-district most number is a starting point, is followed successively by its adjacent cell allocation scrambler, and the order of distribution is with the ordering of adjacent area number size;
Be the adjacent area distribution codeword of its adjacent sub-district again, the order of distribution also is with the ordering of adjacent area number size; And
Topology is opened, and the distribution of cluster cluster all distributes up to all sub-districts.
2. according to the method for distributing codewords among cells of claim 1, it is characterized in that first is assigned with the adjacent cells of cells most number of code word.
3. according to the method for distributing codewords among cells of claim 1, it is characterized in that may further comprise the steps:
Step a. selects a maximum sub-district of adjacent area number, as initial distribution sub-district A;
Step b. puts into distribution queue with sub-district A;
Step c is the center with sub-district A, is followed successively by its adjacent sub-district Bi and distributes scrambler, and i=1 wherein, 2 ..., m, the order of distribution is according to the descending arrangement of adjacent sub-district number of each sub-district Bi;
Steps d. the adjacent area Bi of sub-district A is put into the distribution queue afterbody successively;
Step e. is the center with sub-district B1, is followed successively by its adjacent sub-district C1j and distributes scrambler, and j=1 wherein, 2 ..., n, the order of distribution is according to the descending arrangement of adjacent sub-district number of each sub-district C1j;
Step f. puts into the distribution queue afterbody successively with the adjacent area C1j of sub-district B1;
Step g is the center with sub-district B2, is followed successively by its adjacent sub-district C2k and distributes scrambler, and k=1 wherein, 2 ..., q, the order of distribution is according to the descending arrangement of adjacent sub-district number of each sub-district C2k;
Step h. puts into the distribution queue afterbody successively with the adjacent area C2k of sub-district B2;
Step I. topology is opened, and cluster cluster ground continues to distribute, and has all entered distribution queue up to all sub-districts.
4. according to each method for distributing codewords among cells among the claim 1-3, it is characterized in that:
When each sub-district adds formation, judge this sub-district earlier or not in the distribution queue, if in distribution queue, this sub-district no longer adds distribution queue so, if this sub-district not in distribution queue, adds tail of the queue with this sub-district so.
5. according to the method for distributing codewords among cells of claim 4, it is characterized in that the element in the said distribution queue is an inequality.
6. according to each method for distributing codewords among cells among the claim 1-3, it is characterized in that:
If two adjacent cells of cells numbers are as many, so just see the size of its all adjacent adjacent cells of cells numbers, confirm that according to this size two sub-districts get into the sequencing of distribution queue.
CN2007100958684A 2007-04-10 2007-04-10 Code word cell allocation method Expired - Fee Related CN101287267B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2007100958684A CN101287267B (en) 2007-04-10 2007-04-10 Code word cell allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2007100958684A CN101287267B (en) 2007-04-10 2007-04-10 Code word cell allocation method

Publications (2)

Publication Number Publication Date
CN101287267A CN101287267A (en) 2008-10-15
CN101287267B true CN101287267B (en) 2012-05-23

Family

ID=40059184

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2007100958684A Expired - Fee Related CN101287267B (en) 2007-04-10 2007-04-10 Code word cell allocation method

Country Status (1)

Country Link
CN (1) CN101287267B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102013936A (en) * 2010-12-10 2011-04-13 上海百林通信软件有限公司 Method for code assignment in code division multiple access (CDMA) network optimization

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002335577A (en) * 2001-05-10 2002-11-22 Ntt Docomo Inc Method for assigning uplink scrambling code and mobile communication system
KR20030080154A (en) * 2002-04-04 2003-10-11 엘지전자 주식회사 Allocation method for scrambling code of mobile telecommunication terminal equipment
CN1722888A (en) * 2004-07-13 2006-01-18 中兴通讯股份有限公司 Method of code resource allocation under multi-carrier cell
WO2007016933A1 (en) * 2005-07-28 2007-02-15 Telecom Italia S.P.A. Method for the assignment of scrambling codes to cells of a cdma cellular mobile communications network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002335577A (en) * 2001-05-10 2002-11-22 Ntt Docomo Inc Method for assigning uplink scrambling code and mobile communication system
KR20030080154A (en) * 2002-04-04 2003-10-11 엘지전자 주식회사 Allocation method for scrambling code of mobile telecommunication terminal equipment
CN1722888A (en) * 2004-07-13 2006-01-18 中兴通讯股份有限公司 Method of code resource allocation under multi-carrier cell
WO2007016933A1 (en) * 2005-07-28 2007-02-15 Telecom Italia S.P.A. Method for the assignment of scrambling codes to cells of a cdma cellular mobile communications network

Also Published As

Publication number Publication date
CN101287267A (en) 2008-10-15

Similar Documents

Publication Publication Date Title
US8880089B2 (en) Mobile communication system and radio resource assignment method
CN1092455C (en) CDMA cellular radio transmission system
CN101873703B (en) Dispatching method and communication equipment of space division multiple access resources
MY127222A (en) Fractional reuse through channel allocation tiering
CN102088736A (en) User position list-based method for selectively multiplexing multiple honeycomb user resources for device to device (D2D) user pairs
JP2000236574A (en) Improvement of re-use of code and spectrum in cdma system having cells divided into a plurality of sectors
CN112073974A (en) Unauthorized spectrum edge access and anti-interference method and device for cooperative terminal communication
CN102802269A (en) Method, device and system for processing scheduling information
CN100592812C (en) Method for distributing channel processing resource and centralized base station for realizing the same method
CN103227819B (en) The transmission method of business datum and system, base station and UE in machine type communication
CN104639642A (en) Spatial internet information service system and method
CN101582751B (en) Transmission method of orthogonal extension block, receiving method thereof and system thereof
CN106455105A (en) Low-power LORA wireless communication network channel access control method
US7236512B2 (en) Code channel allocations in a wireless communications system
CN101287267B (en) Code word cell allocation method
CN105992186A (en) Data transmission method and device
CN104620649A (en) Multi-carrier selection method and device
CN101345547B (en) Method and apparatus for optimized distribution of scrambler resource in TDD system
EP1189375A1 (en) Dynamic reassignment of code space among multiple modes of operation
EP1158688A1 (en) Dynamic finger allocation for rake receiver
Saini et al. An efficient multicode design for real time QoS support in OVSF based CDMA networks
CN1925376B (en) Descending main scrambling code optimum distribution method in broad band CDMA system
CN101692732B (en) Method and device for distributing scrambling codes
KR100943061B1 (en) Distribution method and joint detection method of a plurality of basic midambles
CN101969688A (en) Carrier processing method, communication device and communication system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20120523

Termination date: 20160410