WO2006005236A1 - Methode de planification multiplexe de nombre de decalage pilote dans un reseau cdma - Google Patents

Methode de planification multiplexe de nombre de decalage pilote dans un reseau cdma Download PDF

Info

Publication number
WO2006005236A1
WO2006005236A1 PCT/CN2004/001486 CN2004001486W WO2006005236A1 WO 2006005236 A1 WO2006005236 A1 WO 2006005236A1 CN 2004001486 W CN2004001486 W CN 2004001486W WO 2006005236 A1 WO2006005236 A1 WO 2006005236A1
Authority
WO
WIPO (PCT)
Prior art keywords
pilot
offset number
planning
grid
multiplexing
Prior art date
Application number
PCT/CN2004/001486
Other languages
English (en)
Chinese (zh)
Inventor
Weishi Yang
Yi Hu
Yun Wu
Dongchuan Li
Yue Ma
Yongpan Zhao
Qingtao Meng
Hui Wang
Yaping Wang
Original Assignee
Zte Corporation
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 Corporation filed Critical Zte Corporation
Publication of WO2006005236A1 publication Critical patent/WO2006005236A1/fr

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
    • 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/70701—Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation featuring pilot assisted reception

Definitions

  • the invention relates to a planning method for pilot offset number multiplexing in a C-A network, in particular to a method for orderly allocating pilots for pilot offset number multiplexing in a planning phase of a CDMA cellular mobile communication network.
  • the planning method belongs to the field of communication technology. Background technique
  • the network planning stage determines the architecture of the entire network and plays a decisive role in whether the final network meets the coverage and capacity requirements.
  • an important task in wireless parameter planning is the pilot offset number reuse planning, or PN (Pseudo random Number) multiplexing planning.
  • PN Pseudo random Number
  • Unsuitable multiplexing planning can cause serious consequences, resulting in networks. Quality is degraded.
  • PN reuse planning increases sharply with the increase of network scale. Due to the unpredictable potential network scale and investment budget constraints, the construction of wireless networks must be carried out in batches, if there is no more forward-looking.
  • the PN reuse planning method is bound to re-plan the PN every time it is built. This is not only time-consuming and laborious, but also likely to have a great impact on the existing network.
  • US Patent No.: 6618432 invented by Ganesh et al., entitled: System and method for minimizing interference and PN planning schemes in CDMA networks (System and method for minimizing interference and opt imizing PN planning in CDMA The idea of networks is: to implement PN planning by simulation, first to each sub-division With PN, according to the performance of the allocated PN analog system, the cells with poor performance are marked, and then the PNs of these cells are adjusted to simulate the system performance again until the performance requirements are finally met.
  • the main idea of the existing patents is to use simulation tools to find possible problems based on the preliminary PN plan, and then adjust the PN to solve the problem in the problem area.
  • the main disadvantages of this are:
  • the initial PN planning is too random, the initial planning results of different planners are different, and the complexity of subsequent adjustments is also different.
  • the Chinese patent application named "A PN Planning Method for C-A Cellular System", phased the human operation, using base stations in dense and non-dense area groups - mapping
  • the PN packet ensures that the multiplexing distance is not too close, but since this mapping relationship is based on the base station, it is impossible to give a general mapping rule, and the PN multiplexing distance is still guaranteed by the planner.
  • the theoretical minimum multiplexing distance cannot be predicted by itself.
  • the method guarantees the addition of the station by reserving the PN, and how many PNs are reserved to ensure that both the station requirement and the coverage of the reuse group are not too small, and still have to be answered. Summary of the invention
  • the object of the present invention is to solve the technical problems of the latent instability caused by the disorder of the PN reuse plan in the current C-A network planning, and the planning bottleneck for the network expansion and construction.
  • a planning method for pilot offset number multiplexing in a CDMA network is provided, which can effectively perform pilot planning and meet the requirements of smooth expansion.
  • the technical solution adopted by the present invention is a planning method for pilot offset number multiplexing in a CDMA network, which includes at least the following steps:
  • Step 1 Determine the coverage radius of the smallest cell in the dense area and the non-dense area according to the network scale and capacity expansion requirements;
  • Step 2 Determine the value of the pilot increment and the pilot difference of multiple cells in one base station, and divide all available pilots into several pilot groups;
  • Step 3 Calculate a pilot offset number multiplexing distance according to the coverage radius of the minimum cell and the value of the pilot increment.
  • Step 4 Setting a grid of the pilot offset number multiplexing area and a grid line scale 7 respectively assign each grid to the pilot group in order to implement inter-area pilot offset number multiplexing. .
  • Step 5 multiplexing the pilot offset number of the base station in the non-dense area of the entire network for further amplification
  • Step 6 Check the overall network planning result, and eliminate the result that the pilot offset number reuse distance is small.
  • step 1 above by analyzing the potential network size and capacity expansion requirements, the coverage half of the minimum cell is determined for the network size of the same frequency band or a similar frequency band.
  • the pilot demodulation capability of the base station may be used to calculate the pilot increment in the second step based on mutual interference. Value.
  • the length of the minimum cell coverage radius is twice the grid line scale
  • the pilot offset number multiplexing area is square
  • the side length is the pilot offset number multiplexing distance
  • the multiplexing area is within the multiplexing area.
  • the grids are numbered sequentially, and the pilot groups are sequentially assigned to the grids in the multiplex area.
  • the squares on the horizontal line belong to the upper square, and the squares on the vertical line belong to the right side.
  • pilot group in a small grid is not enough, the pilot group remaining after the primary allocation is used preferentially. If the remaining pilot groups are used up, the first small squares are borrowed first, starting from the right. Clockwise or counterclockwise to 8 neighbors to borrow.
  • the number of pilot groups is a multiple of the number of rasters, multiple pilots are assigned to each raster. If there is any remaining after the assignment is completed, it will be reserved for use. Some of the base stations that can be assigned this time can be used for a larger number of grids, and can be reserved for future expansion adjustment.
  • the minimum PN multiplexing distance that can be predicted by the PN resource can be expected
  • the method has the advantages of clear process and wide adaptability, and can efficiently and succinctly plan the pilot of the extra large network, and considers the future expansion problem in the initial stage of construction, so the future network expansion is not It is necessary to re-plan the used pilots and will not cause an impact on the in-use network.
  • Figure 1 is a flow chart of the present invention for orderly allocating PN multiplexing in a CDMA wireless network
  • Figure 2 is a schematic diagram of a specific embodiment of the PN multiplexing processing flow of the present invention. detailed description
  • the planning method for pilot offset number multiplexing in the CDMA network proposed by the present invention sets the pilot offset by setting the minimum coverage radius and the pilot increment (Pilot-INC) of the planned cell.
  • the grid size of the number multiplexing area, each pilot is assigned a pilot group in order, and then the pilot offset number multiplexing between the areas is performed.
  • the invention can be used in the initial pilot planning process of the CDMA wireless network, and can also be used in the pilot planning of the network expansion assumption in the later stage, and has the characteristics of smooth expansion and small impact on the existing network.
  • FIG. 1 A flow chart of the method of the present invention is shown in FIG.
  • the method of comparison can be used to refer to the network scale of the carrier or the competitor in the same frequency band or similar frequency band.
  • the base station is in the pilot increment of two sectors (Pilot INC) and the direction of the main lobe is opposite, and the inverse demodulation capability of the base station can be calculated based on the scrambling to calculate the dense urban area and the non-dense urban area.
  • the coverage radius of the cell combined with the actual network complexity, determines the pilot value of the network (Pi lot INC).
  • the multiplexing distance of PN is in principle the larger the better, but the theoretical derivation indicates that the multiplexing distance of the pilot group is ultimately limited by the pilot increment (Pilot-INC).
  • the coverage area of one base station is: 6 X 1/2 X sin(60)
  • X r 2 2.6 X r 2
  • the area covered by the base station in an ideal multiplexing area of ⁇ ⁇ ⁇ cells is approximately: 2.6r 2 xn 2
  • a pilot offset number multiplexing area is square, and the side length is the pilot offset number multiplexing distance, that is, kxr, so there are a total of k 2 /4 grids, and the grids in the area are sequentially numbered sequentially.
  • pilot groups are sequentially assigned to small grids in the multiplex area. If there is a special case of two base stations in a grid, pilots will be borrowed according to certain principles; these principles are summarized as follows:
  • pilot group in a small grid is not enough: The pilot group remaining after one allocation is used preferentially. If the remaining pilot group is used up, it is preferentially borrowed from the small squares around, for the unique borrowing. The order starts from the right and is borrowed from 8 neighbors clockwise or counterclockwise.
  • the number of base stations that can be loaned to this assignment can be used for a larger number of grids, or it can be reserved for future expansion adjustment.
  • the above PN plan can be appropriately adjusted.
  • the reuse distance can be further expanded.
  • the network is concentrated in an urban-rural and surrounding urban-rural integration department.
  • the number of base stations is nearly 200.
  • the method of using the case is shown in Figure 2.
  • the total study period is 80 ( ⁇ hours).
  • the main processing stages are as follows.
  • Network scale analysis There are 186 base stations in the urban planning. Referring to the operator's 1800GSM system (the base station is close to 700), there is a potential demand for future station expansion. Comprehensive consideration, not only to solve the current network needs, but also to leave sufficient room for future expansion, in the future to add stations, expansion will not need to re-plan the entire network PN. Otherwise the planning behind will be very difficult.
  • PIL0T_INC Selection of PIL0T_INC and determination of PN group: Considering factors such as the density of base stations in the future, using PIL0T-INC as 3 and all base stations being 3 sectors, all available pilots can be used at one time and can be allocated to 512 / 3/ 3-56 base stations, the PN of each base station is called a PN group, even if there is a two-sector, omni-directional base station, we still allocate a PN group.
  • the PN is set in 168 increments between sectors.
  • PN multiplexing distance The minimum cell coverage radius according to the comparison analysis will reach 0. 5km, so the multiplexing distance is 6km. In order to ensure the multiplexing distance of 6km, increase lkm, select the 7km X 7km multiplex block.
  • the multiplex block is divided into 49 small grids of lkm x lkm, and the spiral type is assigned 1 to 49 according to the upper right corner.
  • grid PN group assignment the 1 ⁇ 49 PN group is assigned to the small grid in turn, the remaining spare.

Landscapes

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

Abstract

L'invention concerne une méthode pour une planification multiplexe de nombre de décalage pilote dans des réseaux CDMA. Cette méthode comprend les étapes consistant à: déterminer le rayon de couverture de la plus petite sous-zone de zones denses et/ou de zones de densité selon la taille du réseau et une exigence de capacité croissante; déterminer une valeur d'incrémentation pilote et la différence pilote entre plusieurs sous-zones d'une station, puis diviser le pilote disponible en plusieurs groupes pilotes; calculer la distance de multiplexage du nombre de décalage pilote selon le rayon de couverture de la plus petite sous-zone et de la valeur d'incrémentation pilote; déterminer les grilles et le critère de ligne de grille des zones multiplexes de nombre de décalage pilote, puis distribuer chaque grille de manière ordonnée aux groupes pilotes, ce qui met en oeuvre le multiplexage de nombre de décalage pilote entre les zones. L'invention est claire dans ces étapes et présente une grande plage d'applications. L'invention est efficace et fournit une conception pratique pour piloter un réseau à grande capacité de manière simultanée, et permet de résoudre le problème de capacité croissante dans le futur, à des jours prédéterminés. Par conséquent, il n'est pas nécessaire de reconcevoir le pilote utilisé pour augmenter la capacité à l'avenir, et ceci n'a pas d'impact sur le réseau existant.
PCT/CN2004/001486 2004-07-13 2004-12-21 Methode de planification multiplexe de nombre de decalage pilote dans un reseau cdma WO2006005236A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CNB2004100688696A CN100375400C (zh) 2004-07-13 2004-07-13 一种在码分多址系统中实现有序分配导频的方法
CN200410068869.6 2004-07-13

Publications (1)

Publication Number Publication Date
WO2006005236A1 true WO2006005236A1 (fr) 2006-01-19

Family

ID=35783504

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2004/001486 WO2006005236A1 (fr) 2004-07-13 2004-12-21 Methode de planification multiplexe de nombre de decalage pilote dans un reseau cdma

Country Status (2)

Country Link
CN (1) CN100375400C (fr)
WO (1) WO2006005236A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101163314B (zh) * 2006-12-26 2010-04-21 中兴通讯股份有限公司 码分多址系统中自动规划导频的方法

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101420258B (zh) * 2007-10-26 2012-07-18 中兴通讯股份有限公司 一种在cdma网络中自动pn规划的方法
CN101730114B (zh) * 2009-11-16 2012-07-11 深圳市优网科技有限公司 一种邻小区的确定方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5883889A (en) * 1997-02-06 1999-03-16 Northern Telecom Limited Directional pseudonoise offset assignment in a CDMA cellular radiotelephone system
US6490313B1 (en) * 1999-12-11 2002-12-03 Verizon Laboratories Inc. System and method for PN offset index planning in a digital CDMA cellular network
US6618432B1 (en) * 1997-12-11 2003-09-09 Verizon Laboratories Inc. Systems and methods for minimizing interference and optimizing PN planning in CDMA networks
CN1476684A (zh) * 2000-09-29 2004-02-18 �����ɷ� 生成任意相位pn序列的方法和装置
CN1556601A (zh) * 2004-01-08 2004-12-22 中兴通讯股份有限公司 一种用于cdma蜂窝系统的pn规划方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1428956A (zh) * 2001-12-27 2003-07-09 杨大成 一种高有效性的cdma系统的导频相位自动分配方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5883889A (en) * 1997-02-06 1999-03-16 Northern Telecom Limited Directional pseudonoise offset assignment in a CDMA cellular radiotelephone system
US6618432B1 (en) * 1997-12-11 2003-09-09 Verizon Laboratories Inc. Systems and methods for minimizing interference and optimizing PN planning in CDMA networks
US6490313B1 (en) * 1999-12-11 2002-12-03 Verizon Laboratories Inc. System and method for PN offset index planning in a digital CDMA cellular network
CN1476684A (zh) * 2000-09-29 2004-02-18 �����ɷ� 生成任意相位pn序列的方法和装置
CN1556601A (zh) * 2004-01-08 2004-12-22 中兴通讯股份有限公司 一种用于cdma蜂窝系统的pn规划方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101163314B (zh) * 2006-12-26 2010-04-21 中兴通讯股份有限公司 码分多址系统中自动规划导频的方法

Also Published As

Publication number Publication date
CN1722624A (zh) 2006-01-18
CN100375400C (zh) 2008-03-12

Similar Documents

Publication Publication Date Title
CN101730110B (zh) 边缘频带资源分配方法、装置及基站
AU655360B2 (en) Apparatus and method for non-regular channel assignment in wireless communication networks
CN103702337B (zh) 一种小型基站部署位置的确定方法
EP1786221B1 (fr) Système et procédé de sélection dynamique des fréquences basée sur l'étiquette de spectre
CN101119140B (zh) 一种分层小区结构中的负载平衡方法与装置
US5507007A (en) Method of distributing capacity in a radio cell system
JPH0748903B2 (ja) セル方式無線電話システムにおけるチャンネル割当方法及び同システム
JPH08340571A (ja) 無線通信ネットワークにおける適応型動的チャンネル割り当て装置及び方法
CN109600419A (zh) 一种移动边缘计算环境下支持车联网应用的计算迁移方法
CN103945540A (zh) 一种逻辑信道优先级处理方法及装置
CN104105141A (zh) 无线电资源管理设备、方法以及系统
KR20150005970A (ko) 스펙트럼 관리 시스템 및 방법
CN107889127A (zh) 小区簇的资源管理方法、装置及通信系统
CN103607719A (zh) Lte 网络中小区pci设置方法和系统
CN106658526B (zh) 一种超密集小蜂窝网络中基于模拟退火算法频谱分配方法
CN108513304B (zh) 一种资源分配方法及装置
JP2014533903A (ja) ベースバンドリソースの配分方法及びその装置
WO2006005236A1 (fr) Methode de planification multiplexe de nombre de decalage pilote dans un reseau cdma
Kulshreshtha et al. Maximum packing channel assignment in cellular networks
CN106817768A (zh) 一种td-scdma网络频率分配方法及装置
WO2016107262A1 (fr) Procédé et dispositif d'attribution de ressources de bande de fréquence de petites cellules
CN104796912A (zh) 一种gsm-r网络频率规划的方法及系统
CN111738624B (zh) 一种用于解决供求关系平衡的区域划分方法及系统
CN101692732B (zh) 扰码分配方法及装置
CN103052163A (zh) 一种信道借用方法

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 NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM 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 NA 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 IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

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

WWW Wipo information: withdrawn in national office

Ref document number: DE

WWE Wipo information: entry into national phase

Ref document number: 407/KOLNP/2007

Country of ref document: IN

122 Ep: pct application non-entry in european phase